MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 38 documents:

  1. Translating a Planar Object to Maximize Point Containment
    Pankaj Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel Smid, and Emo Welzl
    In: Algorithms - ESA 2002 : 10th Annual European Symposium, Rome, Italy, 2002, 42-53
  2. Dynamic algorithms for graphs of bounded treewidth
    Torben Hagerup
    Algorithmica 27 (3/4): 292-315, 2000
  3. Parallel preprocessing for path queries without concurrent reading
    Torben Hagerup
    Information and Computation 158 (1): 18-28, 2000
  4. Tight bounds for searching a sorted array of strings
    Arne Andersson, Torben Hagerup, Johan Hastad, and Ola Petersson
    SIAM Journal on Computing 30 (5): 1552-1578, 2000
  5. An Implementation of the Binary Blocking Flow Algorithm
    Torben Hagerup, Peter Sanders, and Jesper Larsson Träff
    In: Proceedings of the 2nd Workshop on Algorithm Engineering (WAE-98), Saarbrücken, Germany, August 20-22, 1998, 143-154
  6. More general parallel tree contraction: Register allocation and broadcasting in a tree
    Krzysztof Diks and Torben Hagerup
    Theoretical Computer Science 203 (1): 3-29, 1998
  7. Parallel Algorithms with Optimal Speedup for Bounded Treewidth
    Hans L. Bodlaender and Torben Hagerup
    SIAM Journal on Computing 27 (6): 1725-1746, 1998
  8. Simpler and Faster Dictionaries on the AC° RAM
    Torben Hagerup
    In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), Aalborg, Denmark, July, 13-17, 1998, 79-90
  9. Sorting and Searching on the Word RAM
    Torben Hagerup
    In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), Paris, France, February, 25-27, 1998, 1998, 366-398
  10. A reliable randomized algorithm for the closest-pair problem
    Martin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen, and Martti Penttonen
    Journal of Algorithms 25 (1): 19-51, 1997
  11. Allocating Independent Tasks to Parallel Processors: An Experimental Study
    Torben Hagerup
    Journal of Parallel and Distributed Computing 47 (2): 185-197, 1997
  12. Dynamic algorithms for graphs of bounded treewidth
    Torben Hagerup
    In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), Bologna, Italy, July, 7 - 11, 1997, 292-302
  13. Fast integer merging on the EREW PRAM
    Torben Hagerup and Miroslaw Kutylowski
    Algorithmica 17: 55-66, 1997
  14. Improved Parallel Integer Sorting without Concurrent Writing
    Susanne Albers and Torben Hagerup
    Information and Computation 136 (1): 25-51, 1997
  15. Allocating Independent Tasks to Parallel Processors: An Experimental Study
    Torben Hagerup
    In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), Santa Barbara, August, 19th-21st, 1996, 1-33
  16. An o(n³)-Time Maximum-Flow-Algorithm: Can a Maximum Flow be Computed in o(nm) Time?
    Joseph Cheriyan, Torben Hagerup, and Kurt Mehlhorn
    SIAM Journal on Computing 25 (6): 1144-1170, 1996
  17. More general parallel tree contraction: Register allocation and broadcasting in a tree
    Krzysztof Diks and Torben Hagerup
    In: Graph-theoretic concepts in computer science (WG-96) : 22nd international workshop, Cadenabbia, Italy,Graph-theoretic concepts in computer science (WG-96) : 22nd international workshop, Cadenabbia, Italy, 1996, 126-140
  18. A Lower Bound for the Emulation of PRAM Memories on Processor Networks
    Torben Hagerup
    Information and Computation 119 (1): 124-128, 1995
  19. A Randomized Maximum-Flow Algorithm
    Joseph Cheriyan and Torben Hagerup
    SIAM Journal on Computing 24 (2): 203-226, 1995
  20. Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees
    Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, and Prabhakar Ragde
    In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), San Francisco, California, USA, January, 22nd - 24th, 1995, 641-649
  21. Fast Deterministic Processor Allocation
    Torben Hagerup
    Journal of Algorithms 18 (3): 629-649, 1995
  22. Fast Parallel Permutation Algorithms
    Torben Hagerup and Jörg Keller
    Parallel Processing Letters 5 (2): 139-148, 1995
  23. Fast Parallel Space Allocation, Estimation, and Integer Sorting
    Hannah Bast and Torben Hagerup
    Information and Computation 123 (1): 72-110, 1995
  24. More Efficient Parallel Flow Algorithms
    Jürgen Dedorath, Jordan Gergov, and Torben Hagerup
    In: Algorithms and Computation: 6th International Symposium (ISAAC95), Cairns, Australia, December, 4th - 6th, 1995, 234-243
  25. Parallel Algorithms with Optimal Speedup for Bounded Treewidth
    Hans L. Bodlaender and Torben Hagerup
    In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), Szeged, Hungary, July, 10th - 14th, 1995, 268-279
  26. Prefix Graphs and their Applications
    Shiva Chaudhuri and Torben Hagerup
    In: Graph-theoretic Concepts in Computer Science: 20th International Workshop (WG94), Hersching, Germany, June, 16th - 18th, 1994, 1995, 206-218
  27. 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
  28. Sorting in Linear Time?
    Arne Andersson, Torben Hagerup, Stefan Nilsson, and Rajeev Raman
    In: 27th Annual ACM Symposium on Theory of Computing (STOC95), Las Vegas, Nevada, USA, May, 29th - June, 1st, 1995, 427-436
  29. The Parallel Complexity of Integer Prefix Summation
    Torben Hagerup
    Information Processing Letters 56 (1): 59-64, 1995
  30. Maintaining Discrete Probability Distributions Optimally
    Torben Hagerup, Kurt Mehlhorn, and I. Munro
    In: Automata, languages and programming (ICALP-93) : 20th international colloquium, Lund, Sweden, 1993, 253-264

  31. A Perfect Parallel Dictionary
    Holger Bast, Martin Dietzfelbinger, and Torben Hagerup
    In: 17th International Symposium on Mathematical Foundations of Computer Science (MFCS'92), Prague, Czechoslovakia, 1992, 133-141
  32. Fast and Reliable Parallel Hashing
    Holger Bast and Torben Hagerup
    In: 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'91), Hilton Head Island, South Carolina, USA, 1991, 50-61
  33. Can a maximum flow be computed in $o(nm)$ time?
    Joseph Cheriyan, Torben Hagerup, and Kurt Mehlhorn
    Universität des Saarlandes, Saarbrücken, 90/07
    [PDF: Download: MaxFlowICALP90.pdf]
  34. Can A Maximum Flow be Computed in o(nm) Time?
    Joseph Cheriyan, Torben Hagerup, and Kurt Mehlhorn
    In: Automata, languages and programming (ICALP-90) : 17th international colloquium, Warwick University, England, 1990, 235-248
  35. 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]
  36. 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
  37. 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
  38. 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