default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTorben Hagerup
Person information
- affiliation: University of Augsburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j42]Torben Hagerup
:
Space-Efficient DFS and Applications to Connectivity Problems: Simpler, Leaner, Faster. Algorithmica 82(4): 1033-1056 (2020)- [i10]Torben Hagerup:
Still Simpler Static Level Ancestors. CoRR abs/2005.11188 (2020)
2010 – 2019
- 2019
- [j41]Torben Hagerup, Frank Kammer, Moritz Laudahn:
Space-efficient Euler partition and bipartite edge coloring. Theor. Comput. Sci. 754: 16-34 (2019) - [c70]Torben Hagerup:
Highly Succinct Dynamic Data Structures. FCT 2019: 29-45 - [c69]Torben Hagerup:
A Constant-Time Colored Choice Dictionary with Almost Robust Iteration. MFCS 2019: 64:1-64:14 - [c68]Tim Baumann, Torben Hagerup:
Rank-Select Indices Without Tears. WADS 2019: 85-98 - [c67]Torben Hagerup:
Fast Breadth-First Search in Still Less Space. WG 2019: 93-105 - 2018
- [i9]Torben Hagerup:
Space-Efficient DFS and Applications: Simpler, Leaner, Faster. CoRR abs/1805.11864 (2018) - [i8]Torben Hagerup:
Guidesort: Simpler Optimal Deterministic Sorting for the Parallel Disk Model. CoRR abs/1807.11328 (2018) - [i7]Torben Hagerup:
Small Uncolored and Colored Choice Dictionaries. CoRR abs/1809.07661 (2018) - [i6]Torben Hagerup:
Fast Breadth-First Search in Still Less Space. CoRR abs/1812.10950 (2018) - 2017
- [c66]Torben Hagerup, Frank Kammer, Moritz Laudahn:
Space-Efficient Euler Partition and Bipartite Edge Coloring. CIAC 2017: 322-333 - [c65]Torben Hagerup, Frank Kammer:
On-the-Fly Array Initialization in Less Space. ISAAC 2017: 44:1-44:12 - [i5]Tim Baumann, Torben Hagerup:
Rank-Select Indices Without Tears. CoRR abs/1709.02377 (2017) - [i4]Torben Hagerup, Frank Kammer:
On-the-Fly Array Initialization in Less Space. CoRR abs/1709.10477 (2017) - [i3]Torben Hagerup:
An Optimal Choice Dictionary. CoRR abs/1711.00808 (2017) - 2016
- [i2]Torben Hagerup, Frank Kammer:
Succinct Choice Dictionaries. CoRR abs/1604.06058 (2016) - 2015
- [c64]Torben Hagerup:
Easy Multiple-Precision Divisors and Word-RAM Constants. MFCS (2) 2015: 372-383 - [c63]Amr Elmasry, Torben Hagerup, Frank Kammer:
Space-efficient Basic Graph Algorithms. STACS 2015: 288-301 - 2012
- [j40]Torben Hagerup:
A strengthened analysis of an algorithm for Dominating Set in planar graphs. Discret. Appl. Math. 160(6): 793-798 (2012) - [c62]Torben Hagerup:
Kernels for Edge Dominating Set: Simpler or Smaller. MFCS 2012: 491-502 - 2011
- [j39]Gianni Franceschini, Torben Hagerup:
Finding the maximum suffix with fewer comparisons. J. Discrete Algorithms 9(3): 279-286 (2011) - [c61]Torben Hagerup:
Simpler Linear-Time Kernelization for Planar Dominating Set. IPEC 2011: 181-193 - 2010
- [j38]Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff:
Trimming of Graphs, with Application to Point Labeling. Theory Comput. Syst. 47(3): 613-636 (2010) - [c60]Gianni Franceschini, Torben Hagerup:
Finding the Maximum Suffix with Fewer Comparisons. CIAC 2010: 323-334
2000 – 2009
- 2009
- [c59]Torben Hagerup:
A Pictorial Description of Cole's Parallel Merge Sort. Efficient Algorithms 2009: 143-157 - [c58]Torben Hagerup:
An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees. WG 2009: 178-189 - 2008
- [c57]Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff:
Trimming of Graphs, with Application to Point Labeling. STACS 2008: 265-276 - [i1]Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff:
Trimming of Graphs, with Application to Point Labeling. CoRR abs/0802.2854 (2008) - 2007
- [c56]Torben Hagerup:
Online and Offline Access to Short Lists. MFCS 2007: 691-702 - [c55]Torben Hagerup:
A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs. WG 2007: 145-150 - 2006
- [j37]Torben Hagerup:
Simpler Computation of Single-Source Shortest Paths in Linear Average Time. Theory Comput. Syst. 39(1): 113-120 (2006) - 2004
- [c54]Torben Hagerup:
Simpler Computation of Single-Source Shortest Paths in Linear Average Time. STACS 2004: 362-369 - [e1]Torben Hagerup, Jyrki Katajainen:
Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings. Lecture Notes in Computer Science 3111, Springer 2004, ISBN 3-540-22339-8 [contents] - 2003
- [c53]Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, Klaus Reinhardt:
On the parameterized complexity of the generalized rush hour puzzle. CCCG 2003: 6-9 - 2002
- [j36]Thomas Erlebach, Torben Hagerup:
Routing Flow Through a Strongly Connected Graph. Algorithmica 32(3): 467-473 (2002) - [c52]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: 42-53 - [c51]Torben Hagerup, Rajeev Raman:
An Efficient Quasidictionary. SWAT 2002: 1-18 - 2001
- [j35]Torben Hagerup, Peter Bro Miltersen, Rasmus Pagh:
Deterministic Dictionaries. J. Algorithms 41(1): 69-85 (2001) - [c50]Martin Dietzfelbinger, Torben Hagerup:
Simple Minimal Perfect Hashing in Less Space. ESA 2001: 109-120 - [c49]Torben Hagerup, Torsten Tholey:
Efficient Minimal Perfect Hashing in Nearly Minimal Space. STACS 2001: 317-326 - 2000
- [j34]Torben Hagerup:
Dynamic Algorithms for Graphs of Bounded Treewidth. Algorithmica 27(3): 292-315 (2000) - [j33]Torben Hagerup:
Parallel Preprocessing for Path Queries without Concurrent Reading. Inf. Comput. 158(1): 18-28 (2000) - [j32]Pascal Berthomé, Torben Hagerup, Ilan Newman, Assaf Schuster:
Self-Simulation for the Passive Optical Star. J. Algorithms 34(1): 128-147 (2000) - [j31]Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson:
Tight Bounds for Searching a Sorted Array of Strings. SIAM J. Comput. 30(5): 1552-1578 (2000) - [c48]Torben Hagerup:
Improved Shortest Paths on the Word RAM. ICALP 2000: 61-72
1990 – 1999
- 1999
- [c47]Torben Hagerup:
Fast Deterministic Construction of Static Dictionaries. SODA 1999: 414-418 - 1998
- [j30]Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman:
Sorting in Linear Time? J. Comput. Syst. Sci. 57(1): 74-93 (1998) - [j29]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): 366-375 (1998) - [j28]Hans L. Bodlaender, Torben Hagerup:
Parallel Algorithms with Optimal Speedup for Bounded Treewidth. SIAM J. Comput. 27(6): 1725-1746 (1998) - [j27]Krzysztof Diks, Torben Hagerup:
More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. Theor. Comput. Sci. 203(1): 3-29 (1998) - [c46]Torben Hagerup:
Simpler and Faster Dictionaries on the AC0 RAM. ICALP 1998: 79-90 - [c45]Hans L. Bodlaender, Torben Hagerup:
Tree Decompositions of Small Diameter. MFCS 1998: 702-712 - [c44]Torben Hagerup:
Sorting and Searching on the Word RAM. STACS 1998: 366-398 - [c43]Torben Hagerup, Peter Sanders, Jesper Larsson Träff:
An Implementation of the Binary Blocking Flow Algorithm. WAE 1998: 143-154 - 1997
- [j26]Torben Hagerup, Miroslaw Kutylowski:
Fast Integer Merging on the EREW PRAM. Algorithmica 17(1): 55-66 (1997) - [j25]Susanne Albers, Torben Hagerup:
Improved Parallel Integer Sorting without Concurrent Writing. Inf. Comput. 136(1): 25-51 (1997) - [j24]Martin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen, Martti Penttonen:
A Reliable Randomized Algorithm for the Closest-Pair Problem. J. Algorithms 25(1): 19-51 (1997) - [j23]Torben Hagerup:
Allocating Independent Tasks to Parallel Processors: An Experimental Study. J. Parallel Distributed Comput. 47(2): 185-197 (1997) - [c42]Torben Hagerup:
Dynamic Algorithms for Graphs of Bounded Treewidth. ICALP 1997: 292-302 - 1996
- [j22]Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn:
An o(n³)-Time Algorithm Maximum-Flow Algorithm. SIAM J. Comput. 25(6): 1144-1170 (1996) - [c41]Torben Hagerup:
Allocating Independent Tasks to Parallel Processors: An Experimental Study. IRREGULAR 1996: 1-33 - [c40]Krzysztof Diks, Torben Hagerup:
More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. WG 1996: 126-140 - 1995
- [j21]Torben Hagerup:
A Lower Bound for the Emulation of PRAM Memories on Processor Networks. Inf. Comput. 119(1): 124-128 (1995) - [j20]Hannah Bast, Torben Hagerup:
Fast Parallel Space Allocation, Estimation and Integer Sorting. Inf. Comput. 123(1): 72-110 (1995) - [j19]Torben Hagerup:
The Parallel Complexity of Integer Prefix Summation. Inf. Process. Lett. 56(1): 59-64 (1995) - [j18]Torben Hagerup:
Fast Deterministic Processor Allocation. J. Algorithms 18(3): 629-649 (1995) - [j17]Torben Hagerup, Jörg Keller:
Fast Parallel Permutation Algorithms. Parallel Process. Lett. 5: 139-148 (1995) - [j16]Joseph Cheriyan, Torben Hagerup:
A Randomized Maximum-Flow Algorithm. SIAM J. Comput. 24(2): 203-226 (1995) - [c39]Pascal Berthomé, Th. Duboux, Torben Hagerup, Ilan Newman, Assaf Schuster:
Self-Simulation for the Passive Optical Star Model. ESA 1995: 369-380 - [c38]Hans L. Bodlaender, Torben Hagerup:
Parallel Algorithms with Optimal Speedup for Bounded Treewidth. ICALP 1995: 268-279 - [c37]Jürgen Dedorath, Jordan Gergov, Torben Hagerup:
More Efficient Parallel Flow Algorithms. ISAAC 1995: 234-243 - [c36]Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde:
Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees. SODA 1995: 641-649 - [c35]Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman:
Sorting in linear time? STOC 1995: 427-436 - 1994
- [j15]Torben Hagerup, Martin Maas:
Generalized Topological Sorting in Linear Time. Nord. J. Comput. 1(1): 38-49 (1994) - [c34]Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson:
The complexity of searching a sorted array of strings. STOC 1994: 317-325 - [c33]Torben Hagerup:
Optimal parallel string algorithms: sorting, merging and computing the minimum. STOC 1994: 382-391 - [c32]Shiva Chaudhuri, Torben Hagerup:
Prefix Graphs and Their Applications. WG 1994: 206-218 - 1993
- [j14]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): 1035-1052 (1993) - [c31]Torben Hagerup, Martin Maas:
Generalized Topological Sorting in Linear Time. FCT 1993: 279-288 - [c30]Torben Hagerup, Kurt Mehlhorn, J. Ian Munro:
Maintaining Discrete Probability Distributions Optimally. ICALP 1993: 253-264 - [c29]Shiva Chaudhuri, Torben Hagerup, Rajeev Raman:
Approximate and Exact Deterministic Parallel Selection. MFCS 1993: 352-361 - [c28]Torben Hagerup:
Fast Deterministic Processor Allocation. SODA 1993: 1-10 - [c27]Torben Hagerup, Rajeev Raman:
Fast Deterministic Approximate and Exact Parallel Sorting. SPAA 1993: 346-355 - 1992
- [j13]Torben Hagerup, Arno Schmitt, Helmut Seidl:
FORK: A high-level language for PRAMs. Future Gener. Comput. Syst. 8(4): 379-393 (1992) - [j12]Torben Hagerup:
On a Compaction Theorem of Ragde. Inf. Process. Lett. 43(6): 335-340 (1992) - [c26]Torben Hagerup, Rajeev Raman:
Waste Makes Haste: Tight Bounds for Loose Parallel Sorting. FOCS 1992: 628-637 - [c25]Torben Hagerup:
Fast Integer Merging on the EREW PRAM. ICALP 1992: 318-329 - [c24]Hannah Bast, Martin Dietzfelbinger, Torben Hagerup:
A Perfect Parallel Dictionary. MFCS 1992: 133-141 - [c23]Torben Hagerup, Ola Petersson:
Merging and Sorting Strings in Parallel. MFCS 1992: 298-306 - [c22]Susanne Albers, Torben Hagerup:
Improved Parallel Integer Sorting Without Concurrent Writing. SODA 1992: 463-472 - [c21]Torben Hagerup:
Fast and Optimal Simulations between CRCW PRAMs. STACS 1992: 45-56 - [c20]Torben Hagerup:
The Log-Star Revolution. STACS 1992: 259-278 - 1991
- [j11]P. C. P. Bhatt, Krzysztof Diks, Torben Hagerup, V. C. Prasad, Tomasz Radzik, Sanjeev Saxena:
Improved Deterministic Parallel Integer Sorting. Inf. Comput. 94(1): 29-47 (1991) - [c19]Torben Hagerup:
Fast Parallel Generation of Random Permutations. ICALP 1991: 405-416 - [c18]Torben Hagerup, Arno Schmitt, Helmut Seidl:
FORK: A High-Level Language for PRAMs. PARLE (1) 1991: 304-320 - [c17]Hannah Bast, Torben Hagerup:
Fast and Reliable Parallel Hashing. SPAA 1991: 50-61 - [c16]Torben Hagerup:
Constant-Time Parallel Integer Sorting (Extended Abstract). STOC 1991: 299-306 - 1990
- [j10]Torben Hagerup:
Optimal Parallel Algorithms on Planar Graphs. Inf. Comput. 84(1): 71-96 (1990) - [j9]Torben Hagerup, Christine Rüb:
A Guided Tour of Chernoff Bounds. Inf. Process. Lett. 33(6): 305-308 (1990) - [j8]Torben Hagerup, Hong Shen:
Improved Nonconservative Sequential and Parallel Integer Sorting. Inf. Process. Lett. 36(2): 57-63 (1990) - [j7]Torben Hagerup:
Planar Depth-First Search in O(log n) Parallel Time. SIAM J. Comput. 19(4): 678-704 (1990) - [c15]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: 86-95 - [c14]Torben Hagerup:
Neue Algorithmen für das Maximum-Flow-Problem. GI Jahrestagung (2) 1990: 507-516 - [c13]Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn:
Can A Maximum Flow be Computed on o(nm) Time? ICALP 1990: 235-248 - [c12]Torben Hagerup, Tomasz Radzik:
Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAM. SPAA 1990: 117-124 - [c11]Torben Hagerup, H. Jung, Emo Welzl:
Efficient Parallel Computation of Arrangements of Hyperplanes in d Dimensions. SPAA 1990: 290-297
1980 – 1989
- 1989
- [j6]Torben Hagerup:
Hybridsort Revisited and Parallelized. Inf. Process. Lett. 32(1): 35-39 (1989) - [j5]Torben Hagerup, Christine Rüb:
Optimal Merging and Sorting on the Erew Pram. Inf. Process. Lett. 33(4): 181-185 (1989) - [j4]Torben Hagerup, Marek Chrobak, Krzysztof Diks:
Optimal Parallel 5-Colouring of Planar Graphs. SIAM J. Comput. 18(2): 288-300 (1989) - [c10]Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik:
New Simulations between CRCW PRAMs. FCT 1989: 95-104 - [c9]Joseph Cheriyan, Torben Hagerup:
A Randomized Maximum-Flow Algorithm. FOCS 1989: 118-123 - [c8]Torben Hagerup, Manfred Nowak:
Parallel Retrieval of Scattered Information. ICALP 1989: 439-450 - [c7]Krzysztof Diks, Torben Hagerup, Wojciech Rytter:
Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract). MFCS 1989: 207-217 - 1988
- [b1]Torben Hagerup:
Parallel algorithms on planar graphs. Saarland University, Saarbrücken, Germany, 1988, pp. 1-82 - [j3]Torben Hagerup:
On Saving Space in Parallel Computation (Note). Inf. Process. Lett. 29(6): 327-329 (1988) - [c6]Torben Hagerup:
Optimal Parallel Algorithms on Planar Graphs. AWOC 1988: 24-32 - [c5]Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik:
Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models. MFCS 1988: 231-239 - 1987
- [j2]Torben Hagerup:
Towards Optimal Parallel Bucket Sorting. Inf. Comput. 75(1): 39-51 (1987) - [j1]Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata:
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. SIAM J. Comput. 16(5): 808-835 (1987) - [c4]Torben Hagerup, Marek Chrobak, Krzysztof Diks:
Parallel 5-Colouring of Planar Graphs. ICALP 1987: 304-313 - [c3]Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata:
Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones. Parallel Algorithms and Architectures 1987: 11-15 - 1986
- [c2]Torben Hagerup, Wolfgang Rülling:
A Generalized Topological Sorting Problem. Aegean Workshop on Computing 1986: 261-270 - [c1]Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata:
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. MFCS 1986: 199-208
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
