Database Entry Point
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF D1 Publications, generated: 4:20, 22 May 2013

Search the publication database

  . Return

Your search returned the following 25 documents:

  1. Helmut Alt, L. Guibas, Kurt Mehlhorn, Richard M. Karp, and A. Wigderson
    A Method for Obtaining Randomized Algorithms with Small Tail Probabilities
    Algorithmica 16 (4/5): 543-547, 1996
    [PDF: Download: Mehlhorn_a_1996_b.pdf]
  2. Helmut Alt, Viliam Geffert, and Kurt Mehlhorn
    A lower bound for the nondeterministic space complexity of context-free recognition
    Information Processing Letters 42 (1): 25-27, 1992

  3. Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, and Christian Uhrig
    Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
    Algorithmica 8 (5/6): 391-408, 1992. Note: Conference version in Proceedings of 6th ACM Symposium on Computational Geometry, 1990
  4. Helmut Alt, L. Guibas, Kurt Mehlhorn, Richard M. Karp, and A. Wigderson
    A Method for Obtaining Randomized Algorithms with Small Tail Probabilities
    ICSI, Berkeley, ICSI Technical Report tr-91-057
    [PDF: Download: Mehlhorn_a_1991_a.pdf]
  5. Helmut Alt, Norbert Blum, Kurt Mehlhorn, and Markus Paul
    Computing a maximum cardinality matching in a bipartite graph in time $O(n^1.5 \sqrtm/\log n)$
    Information Processing Letters 37 (4): 237-240, 1991

  6. Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, and Christian Uhrig
    Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures
    In: Computational geometry (SCG-90) : 6th annual symposium, Berkeley, USA, 1990, 281-289
  7. Kurt Mehlhorn, Stefan Näher, and Helmut Alt
    A Lower Bound on the Complexity of the Union-Split-Find Problem
    SIAM Journal on Computing 17 (6): 1093-1102, 1988
  8. Helmut Alt, Kurt Mehlhorn, Hubert Wagener, and Emo Welzl
    Congruence, Similarity, and Symmetries of Geometric Objects
    Discrete and Computational Geometry 3: 237-256, 1988
    [PDF: Download: CongruenceSimilarity.pdf]
  9. Kurt Mehlhorn, Stefan Näher, and Helmut Alt
    A Lower Bound for the Complexity of the Union-Split-Find Problem
    In: Automata, Languages and Programming (ICALP-87) : 14th International Colloquium, Karlsruhe, Federal Republic of Germany, 1987, 479-488
  10. Helmut Alt, Kurt Mehlhorn, Hubert Wagener, and Emo Welzl
    Congruence, similarity and symmetries of geometric objects
    Universität des Saarlandes / Fachbereich Informatik, Saarbrücken, A 02/87, Technischer Bericht
    [PDF: Download: Mehlhorn_SFB_A_02_87.pdf]
  11. Helmut Alt, Kurt Mehlhorn, Hubert Wagener, and Emo Welzl
    Convergence, Similarity and Symmetries of Geometric Objects
    In: Computational geometry (SCG-87) : 3rd symposium, Waterloo, Canada, 1987, 308-315
  12. Helmut Alt, Torben Hagerup, Kurt Mehlhorn, and Franco P. Preparata
    Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones
    In: Parallel Algorithms and Architectures : International Workshop, Suhl, FRG, 1987, 11-15
    [PDF: Download: DeterministicSimulationParallel.pdf]
  13. Helmut Alt, Torben Hagerup, Kurt Mehlhorn, and Franco P. Preparata
    Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
    SIAM Journal on Computing 16 (5): 808-835, 1987
  14. Kurt Mehlhorn, Stefan Näher, and Helmut Alt
    A Lower Bound for the Complexity of the Union-Split-Find Problem
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 86/07
  15. Helmut Alt, Torben Hagerup, Kurt Mehlhorn, and Franco P. Preparata
    Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
    In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), Bratislava, Czechoslovakia, 1986, 199-208
  16. Helmut Alt, Torben Hagerup, Kurt Mehlhorn, and Franco P. Preparata
    Deterministic simulation of idealized parallel computers on more realistic ones
    Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken/Kaiserslautern, 85/36
  17. Helmut Alt and Kurt Mehlhorn
    Searching Semisorted Tables
    SIAM Journal on Computing 14 (4): 840-848, 1985
    [PDF: Download: SearchingSemiSortedTables.pdf]
  18. Helmut Alt, Kurt Mehlhorn, and J. Munro
    On the complexity of partial match retrieval
    Information Processing Letters 19 (2): 61-65, 1984
  19. Helmut Alt, Kurt Mehlhorn, and J. Ian Munro
    Partial match retrieval in implicit data structures
    Information Processing Letters 19 (2): 61-65, 1984
    [PDF: Download: PartialMatchRetrieval.pdf]
  20. Helmut Alt, Kurt Mehlhorn, and J. Ian Munro
    Partial Match Retrieval in Implicit Data Structures
    In: Mathematical foundations of computer science (MFCS-81) : 10th symposium, ,, Strbské Pleso, Czechoslovakia, 1981, 156-161
  21. Helmut Alt and Kurt Mehlhorn
    Complexity arguments in algebraic language theory
    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

  22. Helmut Alt and Kurt Mehlhorn
    Complexity Arguments in Algebraic Language Theory
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 78/10
  23. Helmut Alt and Kurt Mehlhorn
    Lower Bounds for the Space Complexity of Context-Free Recognition
    In: Third International Colloquium on Automata, Languages and Programming, Edinburgh, UK, 1976, 338-354
    [PDF: Download: ICALP76.PDF]
  24. Helmut Alt and Kurt Mehlhorn
    A Language over a One Symbol Alphabet Requiring only O(log log n) Space
    SIGACT News 7 (4): 31-33, 1975
    [PDF: Download: Mehlhorn_a_1975_b.pdf]
  25. Helmut Alt and Kurt Mehlhorn
    Untere Schranken für den Platzbedarf bei der kontext-freien Analyse
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 75/13