Your search returned the following 6 documents:

6. The price of anarchy on uniformly related machines revisited
   Leah Epstein and Rob van Stee
   In: Algorithmic Game Theory, First International Symposium, SAGT 2008, Paderborn, Germany, 2008, 46-57
   [Download: poa-sagt.dvi]
   
5. The factor algorithm for regular all-to-all communication on clusters of SMP nodes
   Peter Sanders and Jesper Larsson Träff
   In: Proceedings of the 8th International Euro-Par Conference, Paderborn, 2002, 799-803
   
4. Average Case Analysis of List Update Algorithms, with Applications to Data Compression
   Susanne Albers and Michael Mitzenmacher
   In: Automata, Languages and Programming: 23rd International Colloquium (ICALP'96), Paderborn, Germany, July, 8 - 12, 1996, 514-525
   
3. Lower Bounds for Row Minima Searching
   Phillip Gnassi Bradford and Knut Reinert
   In: Automata Languages and Programming: 23rd International Colloquium (ICALP'96), Paderborn, July, 8th - 12th, 1996, 454-465
   
2. Area-time Optimal Division for T=Omega(log n)$^1+epsilon$"
   Kurt Mehlhorn and Franco P. Preparata
   In: STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, Orsay, France, 1986, 341-352
   
1. Selected Topics from Computational Geometry, Data Structures and Motion Planning
   Rudolf Fleischer, Otfried Fries, Kurt Mehlhorn, Stefan Meiser, Stefan Näher, Hans Rohnert, Stefan Schirra, Klaus Simon, Athanasios Tsakalidis, and Christian Uhrig
   In: Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, 1992, 25-43