Your search returned the following 13 documents:

13. A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems
    Radu Curticapean and Marvin Künnemann
    In: 21st Annual European Symposium on Algorithms (ESA 2013), Sophia Antipolis, France, 2013, 349-360
    
12. Balls into Bins Made Faster
    Megha Khosla
    In: Algorithms - ESA 2013, Sophia Antipolis, France, 2013
    
11. Reliable and Efficient Geometric Computing
    Kurt Mehlhorn
    In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, Rome, Italy, 2006, 1-2
    
10. Tighter Approximation Bounds for LPT Scheduling in Two Special Cases
    Annamária Kovács
    In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, Rome, Italy, 2006, 187-198
    
9. Approximation algorithms for Euclidean Group TSP
   Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, and Rene Sitters
   In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, Lisbon, Portugal, 2005, 1115-1126
   
8. Polynomial Time Preemptive Sum-Multicoloring on Paths
   Annamária Kovács
   In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, Lisbon, Portugal, 2005, 840-852
   
7. Towards Optimal Multiple Selection
   Kanela Kaligosi, Kurt Mehlhorn, J. Ian Munro, and Peter Sanders
   In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, Lisbon, Portugal, 2005, 103-114
   [PDF: Download: Mehlhorn_a_2005_o.pdf]
   
6. Engineering a Sorted List Data Structure for 32 Bit Key
   Roman Dementiev, Lutz Kettner, Jens Mehnert, and Peter Sanders
   In: Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX-04), New Orleans, LA, USA, 2004, 142-151
   
5. $\Delta$-Stepping: A Parallel Single Source Shortest Path Algorithm
   Ulrich Meyer and Peter Sanders
   In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), Venice, Italy, August, 24 - 26, 1998, 393-404
   
4. 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
   Roberto Solis-Oba
   In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), Venice, Italy, August 1998, 1998, 441-452
   
3. An experimental study of dynamic algorithms for directed graphs
   Daniele Frigioni, Tobias Miller, Umberto Nanni, Giulio Pasqualone, Guido Schäfer, and Christos Zaroliagis
   In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), Venice, Italy, August, 24-26, 1998, 368-380
   
2. Improved deterministic parallel padded sorting
   Ka Wong Chong and Edgar A. Ramos
   In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), Venice, Italy, August 24-26, 1998, 405-416
   
1. Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
   Phillip Gnassi Bradford, Mordecai J. Golin, Lawrence L. Larmore, and Wojciech Rytter
   In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), Venice, Italy, August 24-26, 1998, 43-54