Space-Efficient DFS and Applications to Connectivity Problems: Simpler, Leaner, Faster.

Torben Hagerup University of Augsburg, Germany https://www.uni-augsburg.de/de/fakultaet/fai/informatik/prof/thi/ https://dl.acm.org/profile/81100421234 https://zbmath.org/authors/?q=ai:hagerup.torben https://mathscinet.ams.org/mathscinet/MRAuthorID/79460 https://mathgenealogy.org/id.php?id=185556 https://orcid.org/0000-0001-6974-2473 https://www.wikidata.org/entity/Q102424249

Torben Hagerup Space-Efficient DFS and Applications to Connectivity Problems: Simpler, Leaner, Faster. 1033-1056 2020 82 Algorithmica 4 https://doi.org/10.1007/s00453-019-00629-x https://www.wikidata.org/entity/Q127205061 db/journals/algorithmica/algorithmica82.html#Hagerup20

Torben Hagerup Still Simpler Static Level Ancestors. 2020 abs/2005.11188 CoRR https://arxiv.org/abs/2005.11188 db/journals/corr/corr2005.html#abs-2005-11188

Torben Hagerup Frank Kammer Moritz Laudahn Space-efficient Euler partition and bipartite edge coloring. 16-34 2019 754 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2018.01.008 db/journals/tcs/tcs754.html#HagerupKL19

Torben Hagerup Highly Succinct Dynamic Data Structures. 29-45 2019 FCT https://doi.org/10.1007/978-3-030-25027-0_3 conf/fct/2019 db/conf/fct/fct2019.html#Hagerup19 Torben Hagerup A Constant-Time Colored Choice Dictionary with Almost Robust Iteration. 64:1-64:14 2019 MFCS https://doi.org/10.4230/LIPIcs.MFCS.2019.64 conf/mfcs/2019 db/conf/mfcs/mfcs2019.html#Hagerup19 Tim Baumann Torben Hagerup Rank-Select Indices Without Tears. 85-98 2019 WADS https://doi.org/10.1007/978-3-030-24766-9_7 conf/wads/2019 db/conf/wads/wads2019.html#BaumannH19 Torben Hagerup Fast Breadth-First Search in Still Less Space. 93-105 2019 WG https://doi.org/10.1007/978-3-030-30786-8_8 conf/wg/2019 db/conf/wg/wg2019.html#Hagerup19

Torben Hagerup Space-Efficient DFS and Applications: Simpler, Leaner, Faster. 2018 abs/1805.11864 CoRR http://arxiv.org/abs/1805.11864 db/journals/corr/corr1805.html#abs-1805-11864

Torben Hagerup Guidesort: Simpler Optimal Deterministic Sorting for the Parallel Disk Model. 2018 abs/1807.11328 CoRR http://arxiv.org/abs/1807.11328 db/journals/corr/corr1807.html#abs-1807-11328

Torben Hagerup Small Uncolored and Colored Choice Dictionaries. 2018 abs/1809.07661 CoRR http://arxiv.org/abs/1809.07661 db/journals/corr/corr1809.html#abs-1809-07661

Torben Hagerup Fast Breadth-First Search in Still Less Space. 2018 abs/1812.10950 CoRR http://arxiv.org/abs/1812.10950 db/journals/corr/corr1812.html#abs-1812-10950

Torben Hagerup Frank Kammer Moritz Laudahn Space-Efficient Euler Partition and Bipartite Edge Coloring. 322-333 2017 CIAC https://doi.org/10.1007/978-3-319-57586-5_27 conf/ciac/2017 db/conf/ciac/ciac2017.html#HagerupKL17 Torben Hagerup Frank Kammer On-the-Fly Array Initialization in Less Space. 44:1-44:12 2017 ISAAC https://doi.org/10.4230/LIPIcs.ISAAC.2017.44 conf/isaac/2017 db/conf/isaac/isaac2017.html#HagerupK17

Tim Baumann Torben Hagerup Rank-Select Indices Without Tears. 2017 abs/1709.02377 CoRR http://arxiv.org/abs/1709.02377 db/journals/corr/corr1709.html#abs-1709-02377

Torben Hagerup Frank Kammer On-the-Fly Array Initialization in Less Space. 2017 abs/1709.10477 CoRR http://arxiv.org/abs/1709.10477 db/journals/corr/corr1709.html#abs-1709-10477

Torben Hagerup An Optimal Choice Dictionary. 2017 abs/1711.00808 CoRR http://arxiv.org/abs/1711.00808 db/journals/corr/corr1711.html#abs-1711-00808

Torben Hagerup Frank Kammer Succinct Choice Dictionaries. 2016 abs/1604.06058 CoRR http://arxiv.org/abs/1604.06058 db/journals/corr/corr1604.html#HagerupK16

Torben Hagerup Easy Multiple-Precision Divisors and Word-RAM Constants. 372-383 2015 MFCS (2) https://doi.org/10.1007/978-3-662-48054-0_31 conf/mfcs/2015-2 db/conf/mfcs/mfcs2015-2.html#Hagerup15 Amr Elmasry Torben Hagerup Frank Kammer Space-efficient Basic Graph Algorithms. 288-301 2015 STACS https://doi.org/10.4230/LIPIcs.STACS.2015.288 conf/stacs/2015 db/conf/stacs/stacs2015.html#ElmasryHK15

Torben Hagerup A strengthened analysis of an algorithm for Dominating Set in planar graphs. 793-798 2012 160 Discret. Appl. Math. 6 https://doi.org/10.1016/j.dam.2010.10.004 db/journals/dam/dam160.html#Hagerup12

Torben Hagerup Kernels for Edge Dominating Set: Simpler or Smaller. 491-502 2012 MFCS https://doi.org/10.1007/978-3-642-32589-2_44 conf/mfcs/2012 db/conf/mfcs/mfcs2012.html#Hagerup12

Gianni Franceschini Torben Hagerup Finding the maximum suffix with fewer comparisons. 279-286 2011 9 J. Discrete Algorithms 3 https://doi.org/10.1016/j.jda.2011.03.008 db/journals/jda/jda9.html#FranceschiniH11

Torben Hagerup Simpler Linear-Time Kernelization for Planar Dominating Set. 181-193 2011 IPEC https://doi.org/10.1007/978-3-642-28050-4_15 conf/iwpec/2011 db/conf/iwpec/ipec2011.html#Hagerup11

Thomas Erlebach Torben Hagerup Klaus Jansen Moritz Minzlaff Alexander Wolff 0001 Trimming of Graphs, with Application to Point Labeling. 613-636 2010 47 Theory Comput. Syst. 3 https://doi.org/10.1007/s00224-009-9184-8 db/journals/mst/mst47.html#ErlebachHJMW10

Gianni Franceschini Torben Hagerup Finding the Maximum Suffix with Fewer Comparisons. 323-334 2010 CIAC https://doi.org/10.1007/978-3-642-13073-1_29 conf/ciac/2010 db/conf/ciac/ciac2010.html#FranceschiniH10 Torben Hagerup A Pictorial Description of Cole's Parallel Merge Sort. 143-157 2009 Efficient Algorithms https://doi.org/10.1007/978-3-642-03456-5_10 conf/birthday/2009mehlhorn db/conf/birthday/mehlhorn2009.html#Hagerup09 Torben Hagerup An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees. 178-189 2009 WG https://doi.org/10.1007/978-3-642-11409-0_16 conf/wg/2009 db/conf/wg/wg2009.html#Hagerup09 Thomas Erlebach Torben Hagerup Klaus Jansen Moritz Minzlaff Alexander Wolff 0001 Trimming of Graphs, with Application to Point Labeling. 2008 STACS 265-276 https://doi.org/10.4230/LIPIcs.STACS.2008.1350 conf/stacs/2008 db/conf/stacs/stacs2008.html#ErlebachHJMW08

Thomas Erlebach Torben Hagerup Klaus Jansen Moritz Minzlaff Alexander Wolff 0001 Trimming of Graphs, with Application to Point Labeling http://arxiv.org/abs/0802.2854 2008 CoRR abs/0802.2854 db/journals/corr/corr0802.html#abs-0802-2854

Torben Hagerup Online and Offline Access to Short Lists. 691-702 2007 conf/mfcs/2007 MFCS https://doi.org/10.1007/978-3-540-74456-6_61 db/conf/mfcs/mfcs2007.html#Hagerup07 Torben Hagerup A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs. 145-150 2007 conf/wg/2007 WG https://doi.org/10.1007/978-3-540-74839-7_14 db/conf/wg/wg2007.html#Hagerup07

Torben Hagerup Simpler Computation of Single-Source Shortest Paths in Linear Average Time. 113-120 2006 39 Theory Comput. Syst. 1 https://doi.org/10.1007/s00224-005-1260-0 db/journals/mst/mst39.html#Hagerup06

Torben Hagerup Simpler Computation of Single-Source Shortest Paths in Linear Average Time. 362-369 https://doi.org/10.1007/978-3-540-24749-4_32 2004 conf/stacs/2004 STACS db/conf/stacs/stacs2004.html#Hagerup04 Torben Hagerup Jyrki Katajainen Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings SWAT Lecture Notes in Computer Science 3111 Springer 2004 3-540-22339-8 https://doi.org/10.1007/b98413 db/conf/swat/swat2004.html Henning Fernau Torben Hagerup Naomi Nishimura Prabhakar Ragde Klaus Reinhardt On the parameterized complexity of the generalized rush hour puzzle. 6-9 2003 conf/cccg/2003 CCCG db/conf/cccg/cccg2003.html#FernauHNRR03 http://www.cccg.ca/proceedings/2003/22.pdf

Thomas Erlebach Torben Hagerup Routing Flow Through a Strongly Connected Graph. 467-473 2002 32 Algorithmica 3 https://doi.org/10.1007/s00453-001-0082-y db/journals/algorithmica/algorithmica32.html#ErlebachH02

Pankaj K. Agarwal Torben Hagerup Rahul Ray Micha Sharir Michiel H. M. Smid Emo Welzl Translating a Planar Object to Maximize Point Containment. 42-53 2002 conf/esa/2002 ESA https://doi.org/10.1007/3-540-45749-6_8 db/conf/esa/esa2002.html#AgarwalHRSSW02 Torben Hagerup Rajeev Raman An Efficient Quasidictionary. 1-18 2002 conf/swat/2002 SWAT https://doi.org/10.1007/3-540-45471-3_1 db/conf/swat/swat2002.html#HagerupR02

Torben Hagerup Peter Bro Miltersen Rasmus Pagh Deterministic Dictionaries. 69-85 2001 41 J. Algorithms 1 db/journals/jal/jal41.html#HagerupMP01 https://doi.org/10.1006/jagm.2001.1171

Martin Dietzfelbinger Torben Hagerup Simple Minimal Perfect Hashing in Less Space. 109-120 2001 conf/esa/2001 ESA https://doi.org/10.1007/3-540-44676-1_9 db/conf/esa/esa2001.html#DietzfelbingerH01 Torben Hagerup Torsten Tholey Efficient Minimal Perfect Hashing in Nearly Minimal Space. 317-326 2001 conf/stacs/2001 STACS https://doi.org/10.1007/3-540-44693-1_28 db/conf/stacs/stacs2001.html#HagerupT01

Torben Hagerup Dynamic Algorithms for Graphs of Bounded Treewidth. 292-315 2000 27 Algorithmica 3 https://doi.org/10.1007/s004530010021 db/journals/algorithmica/algorithmica27.html#Hagerup00

Torben Hagerup Parallel Preprocessing for Path Queries without Concurrent Reading. 18-28 2000 158 Inf. Comput. 1 db/journals/iandc/iandc158.html#Hagerup00 https://doi.org/10.1006/inco.1999.2814

Pascal Berthomé Torben Hagerup Ilan Newman Assaf Schuster Self-Simulation for the Passive Optical Star. 128-147 2000 34 J. Algorithms 1 db/journals/jal/jal34.html#BerthomeHNS00 https://doi.org/10.1006/jagm.1999.1036

Arne Andersson Torben Hagerup Johan Håstad Ola Petersson Tight Bounds for Searching a Sorted Array of Strings. 1552-1578 2000 30 SIAM J. Comput. 5 https://doi.org/10.1137/S0097539797329889 https://www.wikidata.org/entity/Q56959054 db/journals/siamcomp/siamcomp30.html#AnderssonHHP00

Torben Hagerup Improved Shortest Paths on the Word RAM. 61-72 https://doi.org/10.1007/3-540-45022-X_7 2000 conf/icalp/2000 ICALP db/conf/icalp/icalp2000.html#Hagerup00 Torben Hagerup Fast Deterministic Construction of Static Dictionaries. 414-418 1999 conf/soda/1999 SODA http://dl.acm.org/citation.cfm?id=314500.314594 db/conf/soda/soda99.html#Hagerup99

Arne Andersson Torben Hagerup Stefan Nilsson Rajeev Raman Sorting in Linear Time? 74-93 1998 57 J. Comput. Syst. Sci. 1 db/journals/jcss/jcss57.html#AnderssonHNR98 https://doi.org/10.1006/jcss.1998.1580 https://www.wikidata.org/entity/Q61051134

Torben Hagerup Jyrki Katajainen Naomi Nishimura Prabhakar Ragde Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth. 366-375 1998 57 J. Comput. Syst. Sci. 3 db/journals/jcss/jcss57.html#HagerupKNR98 https://doi.org/10.1006/jcss.1998.1592

Hans L. Bodlaender Torben Hagerup Parallel Algorithms with Optimal Speedup for Bounded Treewidth. 1725-1746 1998 27 SIAM J. Comput. 6 https://doi.org/10.1137/S0097539795289859 db/journals/siamcomp/siamcomp27.html#BodlaenderH98

Krzysztof Diks Torben Hagerup More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. 3-29 1998 203 Theor. Comput. Sci. 1 db/journals/tcs/tcs203.html#DiksH98 https://doi.org/10.1016/S0304-3975(97)00285-5

Torben Hagerup Simpler and Faster Dictionaries on the AC<sup>0</sup> RAM. 79-90 https://doi.org/10.1007/BFb0055042 1998 conf/icalp/1998 ICALP db/conf/icalp/icalp98.html#Hagerup98 Hans L. Bodlaender Torben Hagerup Tree Decompositions of Small Diameter. 702-712 1998 conf/mfcs/1998 MFCS https://doi.org/10.1007/BFb0055821 db/conf/mfcs/mfcs98.html#BodlaenderH98 Torben Hagerup Sorting and Searching on the Word RAM. 366-398 1998 conf/stacs/1998 STACS db/conf/stacs/stacs98.html#Hagerup98 https://doi.org/10.1007/BFb0028575 Torben Hagerup Peter Sanders 0001 Jesper Larsson Träff An Implementation of the Binary Blocking Flow Algorithm. 143-154 1998 conf/wae/1998 WAE db/conf/wae/wae1998.html#HagerupST98

Torben Hagerup Miroslaw Kutylowski Fast Integer Merging on the EREW PRAM. 55-66 1997 17 Algorithmica 1 db/journals/algorithmica/algorithmica17.html#HagerupK97 https://doi.org/10.1007/BF02523238

Susanne Albers Torben Hagerup Improved Parallel Integer Sorting without Concurrent Writing. 25-51 1997 136 Inf. Comput. 1 db/journals/iandc/iandc136.html#AlbersH97 https://doi.org/10.1006/inco.1997.2632 https://www.wikidata.org/entity/Q61051135

Martin Dietzfelbinger Torben Hagerup Jyrki Katajainen Martti Penttonen A Reliable Randomized Algorithm for the Closest-Pair Problem. 19-51 1997 25 J. Algorithms 1 db/journals/jal/jal25.html#DietzfelbingerHKP97 https://doi.org/10.1006/jagm.1997.0873

Torben Hagerup Allocating Independent Tasks to Parallel Processors: An Experimental Study. 185-197 1997 47 J. Parallel Distributed Comput. 2 db/journals/jpdc/jpdc47.html#Hagerup97 https://doi.org/10.1006/jpdc.1997.1411

Torben Hagerup Dynamic Algorithms for Graphs of Bounded Treewidth. 292-302 1997 conf/icalp/1997 ICALP db/conf/icalp/icalp97.html#Hagerup97 https://doi.org/10.1007/3-540-63165-8_186

Joseph Cheriyan Torben Hagerup Kurt Mehlhorn An o(n³)-Time Algorithm Maximum-Flow Algorithm. 1144-1170 1996 25 SIAM J. Comput. 6 db/journals/siamcomp/siamcomp25.html#CheriyanHM96 https://doi.org/10.1137/S0097539791278376

Torben Hagerup Allocating Independent Tasks to Parallel Processors: An Experimental Study. 1-33 1996 conf/irregular/1996 IRREGULAR db/conf/irregular/irregular96.html#Hagerup96 https://doi.org/10.1007/BFb0030094 Krzysztof Diks Torben Hagerup More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. 126-140 1996 conf/wg/1996 WG db/conf/wg/wg96.html#DiksH96 https://doi.org/10.1007/3-540-62559-3_12

A Lower Bound for the Emulation of PRAM Memories on Processor Networks Torben Hagerup 124-128 Inf. Comput. May 1995 119 1 db/journals/iandc/iandc119.html#Hagerup95 https://doi.org/10.1006/inco.1995.1080

Hannah Bast Torben Hagerup Fast Parallel Space Allocation, Estimation and Integer Sorting. 72-110 1995 123 Inf. Comput. 1 db/journals/iandc/iandc123.html#BastH95 https://doi.org/10.1006/inco.1995.1159

Torben Hagerup The Parallel Complexity of Integer Prefix Summation. 59-64 1995 56 Inf. Process. Lett. 1 db/journals/ipl/ipl56.html#Hagerup95 https://doi.org/10.1016/0020-0190(95)00119-W https://www.wikidata.org/entity/Q126408249

Torben Hagerup Fast Deterministic Processor Allocation. 629-649 1995 18 J. Algorithms 3 db/journals/jal/jal18.html#Hagerup95 https://doi.org/10.1006/jagm.1995.1023

Torben Hagerup Jörg Keller 0001 Fast Parallel Permutation Algorithms. 139-148 1995 5 Parallel Process. Lett. db/journals/ppl/ppl5.html#HagerupK95 https://doi.org/10.1142/S0129626495000126

Joseph Cheriyan Torben Hagerup A Randomized Maximum-Flow Algorithm. 203-226 1995 24 SIAM J. Comput. 2 db/journals/siamcomp/siamcomp24.html#CheriyanH95 https://doi.org/10.1137/S0097539791221529

Pascal Berthomé Th. Duboux Torben Hagerup Ilan Newman Assaf Schuster Self-Simulation for the Passive Optical Star Model. 369-380 1995 conf/esa/1995 ESA db/conf/esa/esa95.html#BerthomeDHNS95 https://doi.org/10.1007/3-540-60313-1_156 Hans L. Bodlaender Torben Hagerup Parallel Algorithms with Optimal Speedup for Bounded Treewidth. 268-279 1995 conf/icalp/1995 ICALP db/conf/icalp/icalp95.html#BodlaenderH95 https://doi.org/10.1007/3-540-60084-1_80 https://www.wikidata.org/entity/Q59567987 Jürgen Dedorath Jordan Gergov Torben Hagerup More Efficient Parallel Flow Algorithms. 234-243 1995 conf/isaac/1995 ISAAC db/conf/isaac/isaac95.html#DedorathGH95 https://doi.org/10.1007/BFb0015428 Torben Hagerup Jyrki Katajainen Naomi Nishimura Prabhakar Ragde Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees. 641-649 1995 conf/soda/1995 SODA db/conf/soda/soda95.html#HagerupKNR95 http://dl.acm.org/citation.cfm?id=313651.313832 Arne Andersson Torben Hagerup Stefan Nilsson Rajeev Raman Sorting in linear time? 427-436 1995 conf/stoc/STOC27 STOC https://doi.org/10.1145/225058.225173 db/conf/stoc/stoc1995.html#AnderssonHNR95

Torben Hagerup Martin Maas 0003 Generalized Topological Sorting in Linear Time. 38-49 1994 1 Nord. J. Comput. 1 db/journals/njc/njc1.html#HagerupM94

Arne Andersson Torben Hagerup Johan Håstad Ola Petersson The complexity of searching a sorted array of strings. 317-325 1994 conf/stoc/STOC26 STOC https://doi.org/10.1145/195058.195175 db/conf/stoc/stoc1994.html#AnderssonHHP94 Torben Hagerup Optimal parallel string algorithms: sorting, merging and computing the minimum. 382-391 1994 conf/stoc/STOC26 STOC https://doi.org/10.1145/195058.195202 db/conf/stoc/stoc1994.html#Hagerup94 Shiva Chaudhuri Torben Hagerup Prefix Graphs and Their Applications. 206-218 1994 conf/wg/1994 WG db/conf/wg/wg94.html#ChaudhuriH94 https://doi.org/10.1007/3-540-59071-4_49

Michael Formann Torben Hagerup James Haralambides Michael Kaufmann 0001 Frank Thomson Leighton Antonios Symvonis Emo Welzl Gerhard J. Woeginger Drawing Graphs in the Plane with High Resolution. 1035-1052 1993 22 SIAM J. Comput. 5 db/journals/siamcomp/siamcomp22.html#FormannHHKLSWW93 https://doi.org/10.1137/0222063 https://www.wikidata.org/entity/Q54309553

Torben Hagerup Martin Maas 0003 Generalized Topological Sorting in Linear Time. 279-288 1993 conf/fct/1993 FCT db/conf/fct/fct93.html#HagerupM93 https://doi.org/10.1007/3-540-57163-9_23 Torben Hagerup Kurt Mehlhorn J. Ian Munro Maintaining Discrete Probability Distributions Optimally. 253-264 1993 conf/icalp/1993 ICALP db/conf/icalp/icalp93.html#HagerupMM93 https://doi.org/10.1007/3-540-56939-1_77 Shiva Chaudhuri Torben Hagerup Rajeev Raman Approximate and Exact Deterministic Parallel Selection. 352-361 1993 conf/mfcs/1993 MFCS db/conf/mfcs/mfcs93.html#ChaudhuriHR93 https://doi.org/10.1007/3-540-57182-5_27 Torben Hagerup Fast Deterministic Processor Allocation. 1-10 1993 conf/soda/1993 SODA db/conf/soda/soda93.html#Hagerup93 http://dl.acm.org/citation.cfm?id=313559.313574 Torben Hagerup Rajeev Raman Fast Deterministic Approximate and Exact Parallel Sorting. 346-355 1993 conf/spaa/1993 SPAA https://doi.org/10.1145/165231.157380 db/conf/spaa/spaa93.html#HagerupR93

Torben Hagerup Arno Schmitt Helmut Seidl FORK: A high-level language for PRAMs. 379-393 1992 8 Future Gener. Comput. Syst. 4 https://doi.org/10.1016/0167-739X(92)90070-R db/journals/fgcs/fgcs8.html#HagerupSS92

Torben Hagerup On a Compaction Theorem of Ragde. 335-340 1992 43 Inf. Process. Lett. 6 db/journals/ipl/ipl43.html#Hagerup92 https://doi.org/10.1016/0020-0190(92)90121-B

Waste Makes Haste: Tight Bounds for Loose Parallel Sorting Torben Hagerup Rajeev Raman 628-637 conf/focs/FOCS33 1992 FOCS db/conf/focs/focs92.html#HagerupR92 https://doi.org/10.1109/SFCS.1992.267788 https://doi.ieeecomputersociety.org/10.1109/SFCS.1992.267788 Torben Hagerup Fast Integer Merging on the EREW PRAM. 318-329 1992 conf/icalp/1992 ICALP db/conf/icalp/icalp92.html#Hagerup92 https://doi.org/10.1007/3-540-55719-9_84 Hannah Bast Martin Dietzfelbinger Torben Hagerup A Perfect Parallel Dictionary. 133-141 1992 conf/mfcs/1992 MFCS db/conf/mfcs/mfcs92.html#BastDH92 https://doi.org/10.1007/3-540-55808-X_11 Torben Hagerup Ola Petersson Merging and Sorting Strings in Parallel. 298-306 1992 conf/mfcs/1992 MFCS db/conf/mfcs/mfcs92.html#HagerupP92 https://doi.org/10.1007/3-540-55808-X_28 Susanne Albers Torben Hagerup Improved Parallel Integer Sorting Without Concurrent Writing. 463-472 1992 conf/soda/1992 SODA http://dl.acm.org/citation.cfm?id=139404.139491 db/conf/soda/soda92.html#AlbersH92 Torben Hagerup Fast and Optimal Simulations between CRCW PRAMs. 45-56 1992 conf/stacs/1992 STACS db/conf/stacs/stacs92.html#Hagerup92 https://doi.org/10.1007/3-540-55210-3_172 Torben Hagerup The Log-Star Revolution. 259-278 1992 conf/stacs/1992 STACS db/conf/stacs/stacs92.html#Hagerup92a https://doi.org/10.1007/3-540-55210-3_189

Improved Deterministic Parallel Integer Sorting P. C. P. Bhatt Krzysztof Diks Torben Hagerup V. C. Prasad Tomasz Radzik Sanjeev Saxena 29-47 Inf. Comput. September 1991 94 1 db/journals/iandc/iandc94.html#BhattDHPRS91 https://doi.org/10.1016/0890-5401(91)90031-V https://www.wikidata.org/entity/Q61051142

Torben Hagerup Fast Parallel Generation of Random Permutations. 405-416 1991 conf/icalp/1991 ICALP db/conf/icalp/icalp91.html#Hagerup91 https://doi.org/10.1007/3-540-54233-7_151 Torben Hagerup Arno Schmitt Helmut Seidl FORK: A High-Level Language for PRAMs. 304-320 1991 conf/parle/1991-1 PARLE (1) db/conf/parle/parle91-1.html#HargerupSS91 https://doi.org/10.1007/BFb0035112 Hannah Bast Torben Hagerup Fast and Reliable Parallel Hashing. 50-61 1991 conf/spaa/1991 SPAA https://doi.org/10.1145/113379.113384 db/conf/spaa/spaa91.html#BastH91 Constant-Time Parallel Integer Sorting (Extended Abstract) Torben Hagerup 299-306 conf/stoc/STOC23 1991 STOC db/conf/stoc/stoc91.html#Hagerup91 https://doi.org/10.1145/103418.103452

Torben Hagerup Optimal Parallel Algorithms on Planar Graphs 71-96 Inf. Comput. January 1990 84 1 db/journals/iandc/iandc84.html#Hagerup90 https://doi.org/10.1016/0890-5401(90)90034-F

Torben Hagerup Christine Rüb A Guided Tour of Chernoff Bounds. 305-308 1990 33 Inf. Process. Lett. 6 db/journals/ipl/ipl33.html#HagerupR90 https://doi.org/10.1016/0020-0190(90)90214-I https://www.wikidata.org/entity/Q56430039

Torben Hagerup Hong Shen 0001 Improved Nonconservative Sequential and Parallel Integer Sorting. 57-63 1990 36 Inf. Process. Lett. 2 db/journals/ipl/ipl36.html#HagerupS90 https://doi.org/10.1016/0020-0190(90)90097-H

Torben Hagerup Planar Depth-First Search in O(log n) Parallel Time. 678-704 1990 19 SIAM J. Comput. 4 db/journals/siamcomp/siamcomp19.html#Hagerup90 https://doi.org/10.1137/0219047

Drawing Graphs in the Plane with High Resolution Michael Formann Torben Hagerup James Haralambides Michael Kaufmann 0001 Frank Thomson Leighton Antonios Symvonis Emo Welzl Gerhard J. Woeginger 86-95 conf/focs/FOCS31a 1990 FOCS db/conf/focs/focs90.html#FormannHHKLSWW90 https://doi.org/10.1109/FSCS.1990.89527 https://doi.ieeecomputersociety.org/10.1109/FSCS.1990.89527 Torben Hagerup Neue Algorithmen für das Maximum-Flow-Problem. 507-516 1990 conf/gi/1990-2 GI Jahrestagung (2) db/conf/gi/gi90-2.html#Hagerup90 https://doi.org/10.1007/978-3-642-76119-5_54 Joseph Cheriyan Torben Hagerup Kurt Mehlhorn Can A Maximum Flow be Computed on o(nm) Time? 235-248 1990 conf/icalp/1990 ICALP db/conf/icalp/icalp90.html#CheriyanHM90 https://doi.org/10.1007/BFb0032035 Torben Hagerup Tomasz Radzik Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAM. 117-124 1990 conf/spaa/1990 SPAA https://doi.org/10.1145/97444.97677 db/conf/spaa/spaa90.html#HagerupR90 Torben Hagerup H. Jung Emo Welzl Efficient Parallel Computation of Arrangements of Hyperplanes in d Dimensions. 290-297 1990 conf/spaa/1990 SPAA https://doi.org/10.1145/97444.97696 db/conf/spaa/spaa90.html#HagerupJW90

Torben Hagerup Hybridsort Revisited and Parallelized. 35-39 1989 32 Inf. Process. Lett. 1 db/journals/ipl/ipl32.html#Hagerup89 https://doi.org/10.1016/0020-0190(89)90066-5

Torben Hagerup Christine Rüb Optimal Merging and Sorting on the Erew Pram. 181-185 1989 33 Inf. Process. Lett. 4 db/journals/ipl/ipl33.html#HagerupR89 https://doi.org/10.1016/0020-0190(89)90138-5

Torben Hagerup Marek Chrobak Krzysztof Diks Optimal Parallel 5-Colouring of Planar Graphs. 288-300 1989 18 SIAM J. Comput. 2 db/journals/siamcomp/siamcomp18.html#HagerupCD89 https://doi.org/10.1137/0218020

Bogdan S. Chlebus Krzysztof Diks Torben Hagerup Tomasz Radzik New Simulations between CRCW PRAMs. 95-104 1989 conf/fct/1989 FCT db/conf/fct/fct89.html#ChlebusDHR89 https://doi.org/10.1007/3-540-51498-8_9 A Randomized Maximum-Flow Algorithm Joseph Cheriyan Torben Hagerup 118-123 conf/focs/FOCS30 1989 FOCS db/conf/focs/focs89.html#CheriyanH89 https://doi.org/10.1109/SFCS.1989.63465 https://doi.ieeecomputersociety.org/10.1109/SFCS.1989.63465 Torben Hagerup Manfred Nowak Parallel Retrieval of Scattered Information. 439-450 1989 conf/icalp/1989 ICALP db/conf/icalp/icalp89.html#HagerupN89 https://doi.org/10.1007/BFb0035775 Krzysztof Diks Torben Hagerup Wojciech Rytter Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract). 207-217 1989 conf/mfcs/1989 MFCS db/conf/mfcs/mfcs89.html#DiksHR89 https://doi.org/10.1007/3-540-51486-4_68 Torben Hagerup Parallel algorithms on planar graphs. 1988 1-82 Saarland University, Saarbrücken, Germany https://d-nb.info/890891133

Torben Hagerup On Saving Space in Parallel Computation (Note). 327-329 1988 29 Inf. Process. Lett. 6 db/journals/ipl/ipl29.html#Hagerup88 https://doi.org/10.1016/0020-0190(88)90233-5

Torben Hagerup Optimal Parallel Algorithms on Planar Graphs. 24-32 1988 conf/awoc/1988 AWOC db/conf/awoc/awoc88.html#Hagerup88 https://doi.org/10.1007/BFb0040370 Bogdan S. Chlebus Krzysztof Diks Torben Hagerup Tomasz Radzik Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models. 231-239 1988 conf/mfcs/1988 MFCS db/conf/mfcs/mfcs88.html#ChlebusDHR88 https://doi.org/10.1007/BFb0017146

Towards Optimal Parallel Bucket Sorting Torben Hagerup 39-51 Inf. Comput. October 1987 75 1 db/journals/iandc/iandc75.html#Hagerup87 https://doi.org/10.1016/0890-5401(87)90062-9 https://www.wikidata.org/entity/Q61051153

Helmut Alt Torben Hagerup Kurt Mehlhorn Franco P. Preparata Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. 808-835 1987 16 SIAM J. Comput. 5 db/journals/siamcomp/siamcomp16.html#AltHMP87 https://doi.org/10.1137/0216053

Torben Hagerup Marek Chrobak Krzysztof Diks Parallel 5-Colouring of Planar Graphs. 304-313 1987 conf/icalp/1987 ICALP db/conf/icalp/icalp87.html#HagerupCD87 https://doi.org/10.1007/3-540-18088-5_25 Helmut Alt Torben Hagerup Kurt Mehlhorn Franco P. Preparata Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones. 11-15 1987 conf/paa/1987 Parallel Algorithms and Architectures db/conf/paa/paa1987.html#AltHMP87 https://doi.org/10.1007/3-540-18099-0_24 Torben Hagerup Wolfgang Rülling A Generalized Topological Sorting Problem. 261-270 1986 conf/awoc/1986 Aegean Workshop on Computing db/conf/awoc/awoc86.html#HagerupR86 https://doi.org/10.1007/3-540-16766-8_24 Helmut Alt Torben Hagerup Kurt Mehlhorn Franco P. Preparata Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. 199-208 1986 conf/mfcs/1986 MFCS db/conf/mfcs/mfcs86.html#AltHMP86 https://doi.org/10.1007/BFb0016243 Pankaj K. Agarwal Susanne Albers Helmut Alt Arne Andersson Hannah Bast Tim Baumann Pascal Berthomé Pramod Chandra P. BhattP. C. P. Bhatt Hans L. Bodlaender Shiva Chaudhuri Joseph Cheriyan Bogdan S. Chlebus Marek Chrobak Jürgen Dedorath Martin Dietzfelbinger Krzysztof Diks Th. Duboux Amr Elmasry Thomas Erlebach Henning Fernau Michael Formann Gianni Franceschini Jordan Gergov James Haralambides Johan Håstad Klaus Jansen H. Jung Frank Kammer Jyrki Katajainen Michael Kaufmann 0001 Jörg Keller 0001 Miroslaw Kutylowski Moritz Laudahn Frank Thomson Leighton Martin Maas 0003 Kurt Mehlhorn Peter Bro Miltersen Moritz Minzlaff J. Ian Munro Ilan Newman Stefan Nilsson Naomi Nishimura Manfred Nowak Rasmus Pagh Martti Penttonen Ola Petersson V. C. Prasad Franco P. Preparata Tomasz Radzik Prabhakar Ragde Rajeev Raman Rahul Ray Klaus Reinhardt Christine Rüb Wolfgang Rülling Wojciech Rytter Peter Sanders 0001 Sanjeev Saxena Arno Schmitt Assaf Schuster Helmut Seidl Micha Sharir Hong Shen 0001 Michiel H. M. Smid Antonios Symvonis Torsten Tholey Jesper Larsson Träff Emo Welzl Gerhard J. Woeginger Alexander Wolff 0001