Your search returned the following 25 documents:

25. A Method for Obtaining Randomized Algorithms with Small Tail Probabilities
    Helmut Alt, L. Guibas, Kurt Mehlhorn, Richard M. Karp, and A. Wigderson
    Algorithmica 16 (4/5): 543-547, 1996
    [PDF: Download: Mehlhorn_a_1996_b.pdf]
    
24. A lower bound for the nondeterministic space complexity of context-free recognition
    Helmut Alt, Viliam Geffert, and Kurt Mehlhorn
    Information Processing Letters 42 (1): 25-27, 1992
    
    
23. Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
    Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, and Christian Uhrig
    Algorithmica 8 (5/6): 391-408, 1992. Note: Conference version in Proceedings of 6th ACM Symposium on Computational Geometry, 1990
    
22. A Method for Obtaining Randomized Algorithms with Small Tail Probabilities
    Helmut Alt, L. Guibas, Kurt Mehlhorn, Richard M. Karp, and A. Wigderson
    ICSI, Berkeley, ICSI Technical Report tr-91-057
    [PDF: Download: Mehlhorn_a_1991_a.pdf]
    
21. Computing a maximum cardinality matching in a bipartite graph in time $O(n^1.5 \sqrtm/\log n)$
    Helmut Alt, Norbert Blum, Kurt Mehlhorn, and Markus Paul
    Information Processing Letters 37 (4): 237-240, 1991
    
    
20. Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures
    Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, and Christian Uhrig
    In: Computational geometry (SCG-90) : 6th annual symposium, Berkeley, USA, 1990, 281-289
    
19. A Lower Bound on the Complexity of the Union-Split-Find Problem
    Kurt Mehlhorn, Stefan Näher, and Helmut Alt
    SIAM Journal on Computing 17 (6): 1093-1102, 1988
    
18. Congruence, Similarity, and Symmetries of Geometric Objects
    Helmut Alt, Kurt Mehlhorn, Hubert Wagener, and Emo Welzl
    Discrete and Computational Geometry 3: 237-256, 1988
    [PDF: Download: CongruenceSimilarity.pdf]
    
17. A Lower Bound for the Complexity of the Union-Split-Find Problem
    Kurt Mehlhorn, Stefan Näher, and Helmut Alt
    In: Automata, Languages and Programming (ICALP-87) : 14th International Colloquium, Karlsruhe, Federal Republic of Germany, 1987, 479-488
    
16. Congruence, similarity and symmetries of geometric objects
    Helmut Alt, Kurt Mehlhorn, Hubert Wagener, and Emo Welzl
    Universität des Saarlandes / Fachbereich Informatik, Saarbrücken, A 02/87, Technischer Bericht
    [PDF: Download: Mehlhorn_SFB_A_02_87.pdf]
    
15. Convergence, Similarity and Symmetries of Geometric Objects
    Helmut Alt, Kurt Mehlhorn, Hubert Wagener, and Emo Welzl
    In: Computational geometry (SCG-87) : 3rd symposium, Waterloo, Canada, 1987, 308-315
    
14. Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones
    Helmut Alt, Torben Hagerup, Kurt Mehlhorn, and Franco P. Preparata
    In: Parallel Algorithms and Architectures : International Workshop, Suhl, FRG, 1987, 11-15
    [PDF: Download: DeterministicSimulationParallel.pdf]
    
13. Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
    Helmut Alt, Torben Hagerup, Kurt Mehlhorn, and Franco P. Preparata
    SIAM Journal on Computing 16 (5): 808-835, 1987
    
12. A Lower Bound for the Complexity of the Union-Split-Find Problem
    Kurt Mehlhorn, Stefan Näher, and Helmut Alt
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 86/07
    
11. Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
    Helmut Alt, Torben Hagerup, Kurt Mehlhorn, and Franco P. Preparata
    In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), Bratislava, Czechoslovakia, 1986, 199-208
    
10. Deterministic simulation of idealized parallel computers on more realistic ones
    Helmut Alt, Torben Hagerup, Kurt Mehlhorn, and Franco P. Preparata
    Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken/Kaiserslautern, 85/36
    
9. Searching Semisorted Tables
   Helmut Alt and Kurt Mehlhorn
   SIAM Journal on Computing 14 (4): 840-848, 1985
   [PDF: Download: SearchingSemiSortedTables.pdf]
   
8. On the complexity of partial match retrieval
   Helmut Alt, Kurt Mehlhorn, and J. Munro
   Information Processing Letters 19 (2): 61-65, 1984
   
7. Partial match retrieval in implicit data structures
   Helmut Alt, Kurt Mehlhorn, and J. Ian Munro
   Information Processing Letters 19 (2): 61-65, 1984
   [PDF: Download: PartialMatchRetrieval.pdf]
   
6. Partial Match Retrieval in Implicit Data Structures
   Helmut Alt, Kurt Mehlhorn, and J. Ian Munro
   In: Mathematical foundations of computer science (MFCS-81) : 10th symposium, ,, Strbské Pleso, Czechoslovakia, 1981, 156-161
   
5. Complexity arguments in algebraic language theory
   Helmut Alt and Kurt Mehlhorn
   Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO / Association Française pour la Cybernétique Economique et Technique 13 (3): 217-225, 1979
   
   
4. Complexity Arguments in Algebraic Language Theory
   Helmut Alt and Kurt Mehlhorn
   Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 78/10
   
3. Lower Bounds for the Space Complexity of Context-Free Recognition
   Helmut Alt and Kurt Mehlhorn
   In: Third International Colloquium on Automata, Languages and Programming, Edinburgh, UK, 1976, 338-354
   [PDF: Download: ICALP76.PDF]
   
2. A Language over a One Symbol Alphabet Requiring only O(log log n) Space
   Helmut Alt and Kurt Mehlhorn
   SIGACT News 7 (4): 31-33, 1975
   [PDF: Download: Mehlhorn_a_1975_b.pdf]
   
1. Untere Schranken für den Platzbedarf bei der kontext-freien Analyse
   Helmut Alt and Kurt Mehlhorn
   Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 75/13