Torben Hagerup

ORCID

Publication Activity (10 Years)

Years Active: 1986-2020
Publications (10 Years): 17

Top Venues

CoRR

MFCS

WADS

Saarland University, Saarbrücken, Germany (PHD)

Education History

Saarland University, Saarbrücken, Germany

PHD

Publications

Torben Hagerup
Still Simpler Static Level Ancestors. CoRR (2020)
Torben Hagerup
Space-Efficient DFS and Applications to Connectivity Problems: Simpler, Leaner, Faster. Algorithmica 82 (4) (2020)
Torben Hagerup
A Constant-Time Colored Choice Dictionary with Almost Robust Iteration. MFCS (2019)
Torben Hagerup
Highly Succinct Dynamic Data Structures. FCT (2019)
Torben Hagerup
Fast Breadth-First Search in Still Less Space. WG (2019)
Torben Hagerup, Frank Kammer, Moritz Laudahn
Space-efficient Euler partition and bipartite edge coloring. Theor. Comput. Sci. 754 (2019)
Tim Baumann, Torben Hagerup
Rank-Select Indices Without Tears. WADS (2019)
Torben Hagerup
Guidesort: Simpler Optimal Deterministic Sorting for the Parallel Disk Model. CoRR (2018)
Torben Hagerup
Space-Efficient DFS and Applications: Simpler, Leaner, Faster. CoRR (2018)
Torben Hagerup
Fast Breadth-First Search in Still Less Space. CoRR (2018)
Torben Hagerup
Small Uncolored and Colored Choice Dictionaries. CoRR (2018)
Tim Baumann, Torben Hagerup
Rank-Select Indices Without Tears. CoRR (2017)
Torben Hagerup
An Optimal Choice Dictionary. CoRR (2017)
Torben Hagerup, Frank Kammer, Moritz Laudahn
Space-Efficient Euler Partition and Bipartite Edge Coloring. CIAC (2017)
Torben Hagerup, Frank Kammer
On-the-Fly Array Initialization in Less Space. CoRR (2017)
Torben Hagerup, Frank Kammer
On-the-Fly Array Initialization in Less Space. ISAAC (2017)
Torben Hagerup, Frank Kammer
Succinct Choice Dictionaries. CoRR (2016)
Amr Elmasry, Torben Hagerup, Frank Kammer
Space-efficient Basic Graph Algorithms. STACS (2015)
Torben Hagerup
Easy Multiple-Precision Divisors and Word-RAM Constants. MFCS (2) (2015)
Torben Hagerup
Kernels for Edge Dominating Set: Simpler or Smaller. MFCS (2012)
Torben Hagerup
A strengthened analysis of an algorithm for Dominating Set in planar graphs. Discret. Appl. Math. 160 (6) (2012)
Gianni Franceschini, Torben Hagerup
Finding the maximum suffix with fewer comparisons. J. Discrete Algorithms 9 (3) (2011)
Torben Hagerup
Simpler Linear-Time Kernelization for Planar Dominating Set. IPEC (2011)
Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff
Trimming of Graphs, with Application to Point Labeling. Theory Comput. Syst. 47 (3) (2010)
Gianni Franceschini, Torben Hagerup
Finding the Maximum Suffix with Fewer Comparisons. CIAC (2010)
Torben Hagerup
A Pictorial Description of Cole's Parallel Merge Sort. Efficient Algorithms (2009)
Torben Hagerup
An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees. WG (2009)
Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff
Trimming of Graphs, with Application to Point Labeling CoRR (2008)
Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff
Trimming of Graphs, with Application to Point Labeling. STACS (2008)
Torben Hagerup
A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs. WG (2007)
Torben Hagerup
Online and Offline Access to Short Lists. MFCS (2007)
Torben Hagerup
Simpler Computation of Single-Source Shortest Paths in Linear Average Time. Theory Comput. Syst. 39 (1) (2006)
Torben Hagerup
Simpler Computation of Single-Source Shortest Paths in Linear Average Time. STACS (2004)
Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, Klaus Reinhardt
On the parameterized complexity of the generalized rush hour puzzle. CCCG (2003)
Torben Hagerup, Rajeev Raman
An Efficient Quasidictionary. SWAT (2002)
Pankaj K. Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel H. M. Smid, Emo Welzl
Translating a Planar Object to Maximize Point Containment. ESA (2002)
Thomas Erlebach, Torben Hagerup
Routing Flow Through a Strongly Connected Graph. Algorithmica 32 (3) (2002)
Torben Hagerup, Torsten Tholey
Efficient Minimal Perfect Hashing in Nearly Minimal Space. STACS (2001)
Martin Dietzfelbinger, Torben Hagerup
Simple Minimal Perfect Hashing in Less Space. ESA (2001)
Torben Hagerup, Peter Bro Miltersen, Rasmus Pagh
Deterministic Dictionaries. J. Algorithms 41 (1) (2001)
Pascal Berthomé, Torben Hagerup, Ilan Newman, Assaf Schuster
Self-Simulation for the Passive Optical Star. J. Algorithms 34 (1) (2000)
Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson
Tight Bounds for Searching a Sorted Array of Strings. SIAM J. Comput. 30 (5) (2000)
Torben Hagerup
Parallel Preprocessing for Path Queries without Concurrent Reading. Inf. Comput. 158 (1) (2000)
Torben Hagerup
Improved Shortest Paths on the Word RAM. ICALP (2000)
Torben Hagerup
Dynamic Algorithms for Graphs of Bounded Treewidth. Algorithmica 27 (3) (2000)
Torben Hagerup
Fast Deterministic Construction of Static Dictionaries. SODA (1999)
Torben Hagerup
Sorting and Searching on the Word RAM. STACS (1998)
Hans L. Bodlaender, Torben Hagerup
Parallel Algorithms with Optimal Speedup for Bounded Treewidth. SIAM J. Comput. 27 (6) (1998)
Krzysztof Diks, Torben Hagerup
More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. Theor. Comput. Sci. 203 (1) (1998)
Torben Hagerup, Peter Sanders, Jesper Larsson Träff
An Implementation of the Binary Blocking Flow Algorithm. WAE (1998)
Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde
Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth. J. Comput. Syst. Sci. 57 (3) (1998)
Hans L. Bodlaender, Torben Hagerup
Tree Decompositions of Small Diameter. MFCS (1998)
Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman
Sorting in Linear Time? J. Comput. Syst. Sci. 57 (1) (1998)
Torben Hagerup
RAM. ICALP (1998)
Susanne Albers, Torben Hagerup
Improved Parallel Integer Sorting without Concurrent Writing. Inf. Comput. 136 (1) (1997)
Martin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen, Martti Penttonen
A Reliable Randomized Algorithm for the Closest-Pair Problem. J. Algorithms 25 (1) (1997)
Torben Hagerup
Allocating Independent Tasks to Parallel Processors: An Experimental Study. J. Parallel Distributed Comput. 47 (2) (1997)
Torben Hagerup
Dynamic Algorithms for Graphs of Bounded Treewidth. ICALP (1997)
Torben Hagerup, Miroslaw Kutylowski
Fast Integer Merging on the EREW PRAM. Algorithmica 17 (1) (1997)
Torben Hagerup
Allocating Independent Tasks to Parallel Processors: An Experimental Study. IRREGULAR (1996)
Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn
An o(n³)-Time Algorithm Maximum-Flow Algorithm. SIAM J. Comput. 25 (6) (1996)
Krzysztof Diks, Torben Hagerup
More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. WG (1996)
Jürgen Dedorath, Jordan Gergov, Torben Hagerup
More Efficient Parallel Flow Algorithms. ISAAC (1995)
Torben Hagerup
Fast Deterministic Processor Allocation. J. Algorithms 18 (3) (1995)
Torben Hagerup
The Parallel Complexity of Integer Prefix Summation. Inf. Process. Lett. 56 (1) (1995)
Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman
Sorting in linear time? STOC (1995)
Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde
Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees. SODA (1995)
Pascal Berthomé, Th. Duboux, Torben Hagerup, Ilan Newman, Assaf Schuster
Self-Simulation for the Passive Optical Star Model. ESA (1995)
Joseph Cheriyan, Torben Hagerup
A Randomized Maximum-Flow Algorithm. SIAM J. Comput. 24 (2) (1995)
Hans L. Bodlaender, Torben Hagerup
Parallel Algorithms with Optimal Speedup for Bounded Treewidth. ICALP (1995)
Torben Hagerup, Jörg Keller
Fast Parallel Permutation Algorithms. Parallel Process. Lett. 5 (1995)
Hannah Bast, Torben Hagerup
Fast Parallel Space Allocation, Estimation and Integer Sorting. Inf. Comput. 123 (1) (1995)
Torben Hagerup
A Lower Bound for the Emulation of PRAM Memories on Processor Networks Inf. Comput. 119 (1) (1995)
Torben Hagerup, Martin Maas
Generalized Topological Sorting in Linear Time. Nord. J. Comput. 1 (1) (1994)
Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson
The complexity of searching a sorted array of strings. STOC (1994)
Shiva Chaudhuri, Torben Hagerup
Prefix Graphs and Their Applications. WG (1994)
Torben Hagerup
Optimal parallel string algorithms: sorting, merging and computing the minimum. STOC (1994)
Torben Hagerup
Fast Deterministic Processor Allocation. SODA (1993)
Shiva Chaudhuri, Torben Hagerup, Rajeev Raman
Approximate and Exact Deterministic Parallel Selection. MFCS (1993)
Torben Hagerup, Martin Maas
Generalized Topological Sorting in Linear Time. FCT (1993)
Torben Hagerup, Rajeev Raman
Fast Deterministic Approximate and Exact Parallel Sorting. SPAA (1993)
Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger
Drawing Graphs in the Plane with High Resolution. SIAM J. Comput. 22 (5) (1993)
Torben Hagerup, Kurt Mehlhorn, J. Ian Munro
Maintaining Discrete Probability Distributions Optimally. ICALP (1993)
Torben Hagerup
Fast and Optimal Simulations between CRCW PRAMs. STACS (1992)
Susanne Albers, Torben Hagerup
Improved Parallel Integer Sorting Without Concurrent Writing. SODA (1992)
Torben Hagerup
The Log-Star Revolution. STACS (1992)
Torben Hagerup, Arno Schmitt, Helmut Seidl
FORK: A high-level language for PRAMs. Future Gener. Comput. Syst. 8 (4) (1992)
Hannah Bast, Martin Dietzfelbinger, Torben Hagerup
A Perfect Parallel Dictionary. MFCS (1992)
Torben Hagerup, Rajeev Raman
Waste Makes Haste: Tight Bounds for Loose Parallel Sorting FOCS (1992)
Torben Hagerup
On a Compaction Theorem of Ragde. Inf. Process. Lett. 43 (6) (1992)
Torben Hagerup
Fast Integer Merging on the EREW PRAM. ICALP (1992)
Torben Hagerup, Ola Petersson
Merging and Sorting Strings in Parallel. MFCS (1992)
Torben Hagerup
Constant-Time Parallel Integer Sorting (Extended Abstract) STOC (1991)
P. C. P. Bhatt, Krzysztof Diks, Torben Hagerup, V. C. Prasad, Tomasz Radzik, Sanjeev Saxena
Improved Deterministic Parallel Integer Sorting Inf. Comput. 94 (1) (1991)
Torben Hagerup, Arno Schmitt, Helmut Seidl
FORK: A High-Level Language for PRAMs. PARLE (1) (1991)
Hannah Bast, Torben Hagerup
Fast and Reliable Parallel Hashing. SPAA (1991)
Torben Hagerup
Fast Parallel Generation of Random Permutations. ICALP (1991)
Torben Hagerup, Tomasz Radzik
Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAM. SPAA (1990)
Torben Hagerup, Christine Rüb
A Guided Tour of Chernoff Bounds. Inf. Process. Lett. 33 (6) (1990)
Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger
Drawing Graphs in the Plane with High Resolution FOCS (1990)

Torben Hagerup.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Torben Hagerup