Friedhelm Meyer auf der Heide 1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Local Strategies for Building Geometric Formations.
Tight integrality gaps for vertex-cover semidefinite relaxations in the Lovász-Schrijver Hierarchy Avner Magen Joint work with Costis Georgiou, Toni Pitassi.
CSCI-1680 Network Layer: Intra-domain Routing Based partly on lecture notes by David Mazières, Phil Levis, John Jannotti Rodrigo Fonseca.
The Round Complexity of Two-Party Random Selection Saurabh Sanghvi and Salil Vadhan Harvard University.
IEEE ICCCN 2013 - Continuous Gossip-based Aggregation through Dynamic Information Aging
Multi-Party Contract Signing Sam Hasinoff April 9, 2001.
A Distributed Algorithm for the Dead End Problem of Location Based Routing in Sensor Networks Le Zou, Mi Lu, Zixiang Xiong, Department of Electrical Engineering,
Distributed Symmetry Breaking and the Constructive Lovász Local Lemma Seth Pettie Kai-Min Chung, Seth Pettie, and Hsin-Hao Su, Distributed algorithms for.
Barrier Synchronization Companion slides for The Art of Multiprocessor Programming by Maurice Herlihy & Nir Shavit.
Advanced Computer Graphics (Spring 2005) COMS 4162, Lecture 14: Review / Subdivision Ravi Ramamoorthi cs4162 Slides courtesy.
High-entropy random selection protocols Michal Koucký (Institute of Mathematics, Prague) Harry Buhrman, Matthias Christandl, Zvi Lotker, Boaz Patt-Shamir,
Roger Wattenhofer @ WISARD 2008 –1 The Complexity of Connectivity in Wireless Networks TexPoint fonts used in EMF. Read the TexPoint manual before you.