ICALP logo
Skip to content

Last updated on 2020-08-20Conference > Program > Track C

Track C 

Updated Tue Jul 8 12:58:38 CEST 2014

Tuesday 10.00–12.00 AUD3

Chair: Pierre Fraigneaud

  1. 10:00 (BEST STUDENT PAPER) Mohsen Ghaffari, appearing in the shape of a Double Telepresence Robot. Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set
  2. 10:25 (BEST PAPER) Oliver Göbel, Martin Hoefer, Thomas Kesselheim, Thomas Schleiden and Berthold Voecking. Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods
  3. 10:50 David Adjiashvili and Noy Rotbart. Labeling Schemes for Bounded Degree Graphs
  4. 11:15 Merav Parter. Bypassing Erdos' Girth Conjecture: Hybrid Stretch and Sourcewise Spanners
  5. 11:40 Afshin Nikzad and R Ravi. Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems

Tuesday 13.00–14.35 AUD3

Chair: Amos Korman

  1. 13:00 Yuval Emek, Tobias Langner, Jara Uitto and Roger Wattenhofer. Solving the ANTS problem with Asynchronous Finite State Machines
  2. 13:25 Jérémie Chalopin, Yoann Dieudonne, Arnaud Labourel and Andrzej Pelc. Fault-Tolerant Rendezvous in Networks
  3. 13:50 Adrian Kosowski and Dominik Pajak. Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router
  4. 14:15 Jérémie Chalopin, Riko Jacob, Matus Mihalak and Peter Widmayer. Data Delivery by Energy-Constrained Mobile Agents on a Line

Tuesday 15.00–16.35 AUD3

Chair: Roger Wattenhofer

  1. 15:00 Johannes Dams, Martin Hoefer and Thomas Kesselheim. Jamming-Resistant Learning in Wireless Networks
  2. 15:25 David Eisenstat, Claire Mathieu and Nicolas Schabanel. Facility Location in Evolving Metrics
  3. 15:50 George Giakkoupis, Thomas Sauerwald and Alexandre Stauffer. Randomized Rumor Spreading in Dynamic Graphs
  4. 16:15 Tsvi Kopelowitz, Robert Krauthgamer, Ely Porat and Shay Solomon. Orienting Fully Dynamic Graphs with Worst-Case Time Bounds

Wednesday 10.00–12.00 AUD3

Chair: Claire Mathieu

  1. 10:00 Olga Ohrimenko, Michael Goodrich, Roberto Tamassia and Eli Upfal. The Melbourne Shuffle: Improving Oblivious Storage in the Cloud
  2. 10:25 Chen Avin, Michael Borokhovich, Zvi Lotker and David Peleg. Distributed Computing on Core-Periphery Networks: Axiom-based Design
  3. 10:50 Rom Aschner and Matthew Katz. Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints
  4. 11:15 Erez Kantor and Shay Kutten. Optimal competitiveness for Symmetric Rectilinear Steiner Arborescence and related problems
  5. 11:40 Colin Cooper, Robert Elsässer and Tomasz Radzik. The power of two choices in distributed voting

Find this page Online