Your search returned the following 10 documents:

10. Popular Mixed Matchings
    T. Kavitha, Julián Mestre, and M. Nasre
    In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, Rhodes, Greece, 2009, 574-584
    
9. Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
   Benjamin Doerr, Tobias Friedrich, and Thomas Sauerwald
   In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, Rhodes, Greece, 2009, 366-377
   
8. Smoothed Analysis of Balancing Networks
   Tobias Friedrich, Thomas Sauerwald, and Dan Vilenchik
   In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, Rhodes, Greece, 2009, 472-483
   
7. Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets
   Stefan Funke and Sören Laue
   In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, 2007, 272-283
   
   
6. New Approximation Algorithms for Minimum Cycle Bases of Graphs
   Telikepalli Kavitha, Kurt Mehlhorn, and Dimitrios Michail
   In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, 2007, 512-523
   [PDF: Download: Mehlhorn_2007_a_m.pdf]
   
5. Randomly Rounding Rationals with Cardinality Constraints and Derandomizations
   Benjamin Doerr
   In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, 2007, 441-452
   
   
4. Conflict-Free Colorings of Rectangle Ranges
   Khaled M. Elbassioni and Nabil H. Mustafa
   In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, 2006, 254-263
   
3. Generating Randomized Roundings with Cardinality Constraints and Derandomizations
   Benjamin Doerr
   In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, 2006, 571-583
   
   
2. A Bandwidth Latency Tradeoff for Broadcast and Reduction
   Peter Sanders and Jop F. Sibeyn
   In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), Munich, Germany, August 29 - September 1, 2000, 918-926
   
1. Parallel Shortest Path for Arbitrary Graphs
   Ulrich Meyer and Peter Sanders
   In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), Munich, Germany, August, 29 - September, 1, 2000, 461-470