dblp.uni-trier.dewww.uni-trier.de

Torben Hagerup Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
96EETorben Hagerup: A Pictorial Description of Cole's Parallel Merge Sort. Efficient Algorithms 2009: 143-157
2008
95EEThomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff: Trimming of Graphs, with Application to Point Labeling. STACS 2008: 265-276
94EEThomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff: Trimming of Graphs, with Application to Point Labeling CoRR abs/0802.2854: (2008)
2007
93EETorben Hagerup: Online and Offline Access to Short Lists. MFCS 2007: 691-702
92EETorben Hagerup: A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs. WG 2007: 145-150
2006
91EETorben Hagerup: Simpler Computation of Single-Source Shortest Paths in Linear Average Time. Theory Comput. Syst. 39(1): 113-120 (2006)
2004
90 Torben Hagerup, Jyrki Katajainen: Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings Springer 2004
89EETorben Hagerup: Simpler Computation of Single-Source Shortest Paths in Linear Average Time. STACS 2004: 362-369
2003
88 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
87EEPankaj 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
86EETorben Hagerup, Rajeev Raman: An Efficient Quasidictionary. SWAT 2002: 1-18
85EEThomas Erlebach, Torben Hagerup: Routing Flow Through a Strongly Connected Graph. Algorithmica 32(3): 467-473 (2002)
2001
84EEMartin Dietzfelbinger, Torben Hagerup: Simple Minimal Perfect Hashing in Less Space. ESA 2001: 109-120
83EETorben Hagerup, Torsten Tholey: Efficient Minimal Perfect Hashing in Nearly Minimal Space. STACS 2001: 317-326
82 Torben Hagerup, Peter Bro Miltersen, Rasmus Pagh: Deterministic Dictionaries. J. Algorithms 41(1): 69-85 (2001)
2000
81EETorben Hagerup: Improved Shortest Paths on the Word RAM. ICALP 2000: 61-72
80EETorben Hagerup: Dynamic Algorithms for Graphs of Bounded Treewidth. Algorithmica 27(3): 292-315 (2000)
79 Torben Hagerup: Parallel Preprocessing for Path Queries without Concurrent Reading. Inf. Comput. 158(1): 18-28 (2000)
78 Pascal Berthomé, Torben Hagerup, Ilan Newman, Assaf Schuster: Self-Simulation for the Passive Optical Star. J. Algorithms 34(1): 128-147 (2000)
77EEArne 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)
1999
76EETorben Hagerup: Fast Deterministic Construction of Static Dictionaries. SODA 1999: 414-418
1998
75 Torben Hagerup, Peter Sanders, Jesper Larsson Träff: An Implementation of the Binary Blocking Flow Algorithm. Algorithm Engineering 1998: 143-154
74EETorben Hagerup: Simpler and Faster Dictionaries on the AC0 RAM. ICALP 1998: 79-90
73EEHans L. Bodlaender, Torben Hagerup: Tree Decompositions of Small Diameter. MFCS 1998: 702-712
72EETorben Hagerup: Sorting and Searching on the Word RAM. STACS 1998: 366-398
71 Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman: Sorting in Linear Time? J. Comput. Syst. Sci. 57(1): 74-93 (1998)
70 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)
69EEHans L. Bodlaender, Torben Hagerup: Parallel Algorithms with Optimal Speedup for Bounded Treewidth. SIAM J. Comput. 27(6): 1725-1746 (1998)
68EEKrzysztof Diks, Torben Hagerup: More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. Theor. Comput. Sci. 203(1): 3-29 (1998)
1997
67EETorben Hagerup: Dynamic Algorithms for Graphs of Bounded Treewidth. ICALP 1997: 292-302
66 Torben Hagerup, Miroslaw Kutylowski: Fast Integer Merging on the EREW PRAM. Algorithmica 17(1): 55-66 (1997)
65 Susanne Albers, Torben Hagerup: Improved Parallel Integer Sorting without Concurrent Writing. Inf. Comput. 136(1): 25-51 (1997)
64 Martin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen, Martti Penttonen: A Reliable Randomized Algorithm for the Closest-Pair Problem. J. Algorithms 25(1): 19-51 (1997)
63 Torben Hagerup: Allocating Independent Tasks to Parallel Processors: An Experimental Study. J. Parallel Distrib. Comput. 47(2): 185-197 (1997)
1996
62 Torben Hagerup: Allocating Independent Tasks to Parallel Processors: An Experimental Study. IRREGULAR 1996: 1-33
61EEKrzysztof Diks, Torben Hagerup: More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. WG 1996: 126-140
60 Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn: An o(n³)-Time Algorithm Maximum-Flow Algorithm. SIAM J. Comput. 25(6): 1144-1170 (1996)
1995
59EEPascal Berthomé, Th. Duboux, Torben Hagerup, Ilan Newman, Assaf Schuster: Self-Simulation for the Passive Optical Star Model. ESA 1995: 369-380
58EEHans L. Bodlaender, Torben Hagerup: Parallel Algorithms with Optimal Speedup for Bounded Treewidth. ICALP 1995: 268-279
57EEJürgen Dedorath, Jordan Gergov, Torben Hagerup: More Efficient Parallel Flow Algorithms. ISAAC 1995: 234-243
56 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
55EEArne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman: Sorting in linear time? STOC 1995: 427-436
54 Torben Hagerup: A Lower Bound for the Emulation of PRAM Memories on Processor Networks Inf. Comput. 119(1): 124-128 (1995)
53 Hannah Bast, Torben Hagerup: Fast Parallel Space Allocation, Estimation and Integer Sorting. Inf. Comput. 123(1): 72-110 (1995)
52EETorben Hagerup: The Parallel Complexity of Integer Prefix Summation. Inf. Process. Lett. 56(1): 59-64 (1995)
51 Torben Hagerup: Fast Deterministic Processor Allocation. J. Algorithms 18(3): 629-649 (1995)
50 Torben Hagerup, Jörg Keller: Fast Parallel Permutation Algorithms. Parallel Processing Letters 5: 139-148 (1995)
49 Joseph Cheriyan, Torben Hagerup: A Randomized Maximum-Flow Algorithm. SIAM J. Comput. 24(2): 203-226 (1995)
1994
48EEArne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson: The complexity of searching a sorted array of strings. STOC 1994: 317-325
47EETorben Hagerup: Optimal parallel string algorithms: sorting, merging and computing the minimum. STOC 1994: 382-391
46EEShiva Chaudhuri, Torben Hagerup: Prefix Graphs and Their Applications. WG 1994: 206-218
45 Torben Hagerup, Margin Maas: Generalized Topological Sorting in Linear Time. Nord. J. Comput. 1(1): 38-49 (1994)
1993
44 Torben Hagerup, Martin Maas: Generalized Topological Sorting in Linear Time. FCT 1993: 279-288
43EETorben Hagerup, Kurt Mehlhorn, J. Ian Munro: Maintaining Discrete Probability Distributions Optimally. ICALP 1993: 253-264
42EEShiva Chaudhuri, Torben Hagerup, Rajeev Raman: Approximate and Exact Deterministic Parallel Selection. MFCS 1993: 352-361
41 Torben Hagerup: Fast Deterministic Processor Allocation. SODA 1993: 1-10
40EETorben Hagerup, Rajeev Raman: Fast Deterministic Approximate and Exact Parallel Sorting. SPAA 1993: 346-355
39 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)
1992
38 Torben Hagerup, Rajeev Raman: Waste Makes Haste: Tight Bounds for Loose Parallel Sorting FOCS 1992: 628-637
37EETorben Hagerup: Fast Integer Merging on the EREW PRAM. ICALP 1992: 318-329
36EEHolger Bast, Martin Dietzfelbinger, Torben Hagerup: A Perfect Parallel Dictionary. MFCS 1992: 133-141
35EETorben Hagerup, Ola Petersson: Merging and Sorting Strings in Parallel. MFCS 1992: 298-306
34EESusanne Albers, Torben Hagerup: Improved Parallel Integer Sorting Without Concurrent Writing. SODA 1992: 463-472
33EETorben Hagerup: The Log-Star Revolution. STACS 1992: 259-278
32EETorben Hagerup: Fast and Optimal Simulations between CRCW PRAMs. STACS 1992: 45-56
31 Torben Hagerup: On a Compaction Theorem of Ragde. Inf. Process. Lett. 43(6): 335-340 (1992)
1991
30EETorben Hagerup: Fast Parallel Generation of Random Permutations. ICALP 1991: 405-416
29EETorben Hagerup, Arno Schmitt, Helmut Seidl: FORK: A High-Level Language for PRAMs. PARLE (1) 1991: 304-320
28EEHolger Bast, Torben Hagerup: Fast and Reliable Parallel Hashing. SPAA 1991: 50-61
27 Torben Hagerup: Constant-Time Parallel Integer Sorting (Extended Abstract) STOC 1991: 299-306
26 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)
1990
25 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
24 Torben Hagerup: Neue Algorithmen für das Maximum-Flow-Problem. GI Jahrestagung (2) 1990: 507-516
23EEJoseph Cheriyan, Torben Hagerup, Kurt Mehlhorn: Can A Maximum Flow be Computed on o(nm) Time? ICALP 1990: 235-248
22EETorben Hagerup, Tomasz Radzik: Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAM. SPAA 1990: 117-124
21EETorben Hagerup, H. Jung, Emo Welzl: Efficient Parallel Computation of Arrangements of Hyperplanes in d Dimensions. SPAA 1990: 290-297
20 Torben Hagerup: Optimal Parallel Algorithms on Planar Graphs Inf. Comput. 84(1): 71-96 (1990)
19 Torben Hagerup, Christine Rüb: A Guided Tour of Chernoff Bounds. Inf. Process. Lett. 33(6): 305-308 (1990)
18 Torben Hagerup, Hong Shen: Improved Nonconservative Sequential and Parallel Integer Sorting. Inf. Process. Lett. 36(2): 57-63 (1990)
17 Torben Hagerup: Planar Depth-First Search in O(log n) Parallel Time. SIAM J. Comput. 19(4): 678-704 (1990)
1989
16 Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik: New Simulations between CRCW PRAMs. FCT 1989: 95-104
15 Joseph Cheriyan, Torben Hagerup: A Randomized Maximum-Flow Algorithm FOCS 1989: 118-123
14EETorben Hagerup, Manfred Nowak: Parallel Retrieval of Scattered Information. ICALP 1989: 439-450
13EEKrzysztof Diks, Torben Hagerup, Wojciech Rytter: Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract). MFCS 1989: 207-217
12 Torben Hagerup: Hybridsort Revisited and Parallelized. Inf. Process. Lett. 32(1): 35-39 (1989)
11 Torben Hagerup, Christine Rüb: Optimal Merging and Sorting on the Erew Pram. Inf. Process. Lett. 33(4): 181-185 (1989)
10 Torben Hagerup, Marek Chrobak, Krzysztof Diks: Optimal Parallel 5-Colouring of Planar Graphs. SIAM J. Comput. 18(2): 288-300 (1989)
1988
9 Torben Hagerup: Optimal Parallel Algorithms on Planar Graphs. AWOC 1988: 24-32
8EEBogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik: Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models. MFCS 1988: 231-239
7 Torben Hagerup: On Saving Space in Parallel Computation (Note). Inf. Process. Lett. 29(6): 327-329 (1988)
1987
6EETorben Hagerup, Marek Chrobak, Krzysztof Diks: Parallel 5-Colouring of Planar Graphs. ICALP 1987: 304-313
5 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
4 Torben Hagerup: Towards Optimal Parallel Bucket Sorting Inf. Comput. 75(1): 39-51 (1987)
3 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)
1986
2 Torben Hagerup, Wolfgang Rülling: A Generalized Topological Sorting Problem. Aegean Workshop on Computing 1986: 261-270
1EEHelmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata: Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. MFCS 1986: 199-208

Coauthor Index

1Pankaj K. Agarwal [87]
2Susanne Albers [34] [65]
3Helmut Alt [1] [3] [5]
4Arne Andersson [48] [55] [71] [77]
5Hannah Bast (Holger Bast) [28] [36] [53]
6Pascal Berthomé [59] [78]
7P. C. P. Bhatt [26]
8Hans L. Bodlaender [58] [69] [73]
9Shiva Chaudhuri [42] [46]
10Joseph Cheriyan [15] [23] [49] [60]
11Bogdan S. Chlebus [8] [16]
12Marek Chrobak [6] [10]
13Jürgen Dedorath [57]
14Martin Dietzfelbinger [36] [64] [84]
15Krzysztof Diks [6] [8] [10] [13] [16] [26] [61] [68]
16Th. Duboux [59]
17Thomas Erlebach [85] [94] [95]
18Henning Fernau [88]
19Michael Formann [25] [39]
20Jordan Gergov [57]
21James Haralambides [25] [39]
22Johan Håstad [48] [77]
23Klaus Jansen [94] [95]
24H. Jung [21]
25Jyrki Katajainen [56] [64] [70] [90]
26Michael Kaufmann [25] [39]
27Jörg Keller [50]
28Miroslaw Kutylowski [66]
29Frank Thomson Leighton (Tom Leighton) [25] [39]
30Margin Maas [45]
31Martin Maas [44]
32Kurt Mehlhorn [1] [3] [5] [23] [43] [60]
33Peter Bro Miltersen [82]
34Moritz Minzlaff [94] [95]
35J. Ian Munro [43]
36Ilan Newman [59] [78]
37Stefan Nilsson [55] [71]
38Naomi Nishimura [56] [70] [88]
39Manfred Nowak [14]
40Rasmus Pagh [82]
41Martti Penttonen [64]
42Ola Petersson [35] [48] [77]
43V. C. Prasad [26]
44Franco P. Preparata [1] [3] [5]
45Tomasz Radzik [8] [16] [22] [26]
46Prabhakar Ragde [56] [70] [88]
47Rajeev Raman [38] [40] [42] [55] [71] [86]
48Rahul Ray [87]
49Klaus Reinhardt [88]
50Christine Rüb [11] [19]
51Wolfgang Rülling [2]
52Wojciech Rytter [13]
53Peter Sanders [75]
54Sanjeev Saxena [26]
55Arno Schmitt [29]
56Assaf Schuster [59] [78]
57Helmut Seidl [29]
58Micha Sharir [87]
59Hong Shen [18]
60Michiel H. M. Smid [87]
61Antonios Symvonis [25] [39]
62Torsten Tholey [83]
63Jesper Larsson Träff [75]
64Emo Welzl [21] [25] [39] [87]
65Gerhard J. Woeginger [25] [39]
66Alexander Wolff [94] [95]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)