Your search returned the following 16 documents:

16. Contention Resolution under Selfishness
    Giorgos Christodoulou, Katrina Ligett, and Evangelia Pyrga
    In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. II, Bordeaux, France, 2010, 430-441
    
15. Max-min online allocations with a reordering buffer
    Leah Epstein, Asaf Levin, and Rob van Stee
    In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, Bordeaux, France, 2010, 336-347
    
    
14. Orientability of random hypergraphs and the power of multiple choices
    Nikolaos Fountoulakis and Konstantinos Panagiotou
    In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. 1, Bordeaux, France, 2010, 348-359
    
13. Preprocessing of Min Ones Problems: A Dichotomy
    Stefan Kratsch and Magnus Wahlström
    In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, Bordeaux, France, 2010, 653-665
    
12. Infrastructure-Establishment from Scratch in Wireless Sensor Networks
    Stefan Funke and Nikola Milosavljevic
    In: Distributed computing in sensor systems : First IEEE International Conference, DCOSS 2005, Marina Del Rey, USA, 2005, 354-367
    
11. Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher
    Sang-Min Park, Jae-Ha Lee, and Kyung-Yong Chwa
    In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP-01), Crete,Greece, July,8 - July,12, 2001, 456-468
    
10. A powerful heuristic for telephone gossiping
    Rene Beier and Jop F. Sibeyn
    In: Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity (SIROCCO-00), L'Aquila, Italy, June 20-22, 2000, 2000, 17-36
    
9. A Polyhedral Approach to Planar Augmentation and Related Problems
   Petra Mutzel
   In: Algorithms - ESA'95: 3rd Annual European Symposium, Corfu, Greece, September, 25th - 27th, 1995, 494-507
   
8. Beyond the Worst-Case Bisection Bound: Fast Ranking and Counting on Meshes
   Michael Kaufmann, Jop F. Sibeyn, and Torsten Suel
   In: Algorithms - ESA'95: 3rd Annual European Symposium, Corfu, Greece, September, 25th - 27th, 1995, 75-88
   
7. On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka
   Kurt Mehlhorn and Volker Priebe
   In: Algorithms - ESA'95: 3rd Annual European Symposium, Corfu, Greece, September, 25th - 27th, 1995, 185-198
   
6. Optimal Parallel Shortest Paths in Small Treewidth Digraphs
   Shiva Chaudhuri and Christos Zaroliagis
   In: Algorithms - ESA'95: 3rd Annual European Symposium, Corfu, Greece, September, 25th - 27th, 1995, 31-45
   
5. Self-Simulation for the Passive Optical Star Model
   P. Berthomé, T. Duboux, Torben Hagerup, I. Newman, and Assaf Schuster
   In: Algorithms-ESA'95: 3rd Annual European Symposium, Corfu, Greece, September, 25th - 27th, 1995, 268-380
   
4. VLSI algorithms and architectures : Aegean workshop on computing
   Fillia Makedon, Kurt Mehlhorn, Theodore S. Papatheodorou, and Paul G. Spirakis(Ed.)
   Lecture Notes in Computer Science. 227, , Springer, Berlin, 1986
   
3. VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
   Fillia Makedon, Kurt Mehlhorn, Theodore S. Papatheodorou, and Paul G. Spirakis(Ed.)
   Lecture Notes in Computer Science. 227, , Springer, Berlin, 1986
   
2. VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
   Fillia Makedon, Kurt Mehlhorn, Theodore S. Papatheodorou, and Paul G. Spirakis(Ed.)
   Lecture Notes in Computer Science. 227, , Springer, Berlin, 1986
   
1. AT$^2$-Optimal Galois Field Multiplier for VLSI
   Martin Fürer and Kurt Mehlhorn
   In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, Loutraki, Greece, 1986, 217-225