Search the dblp DataBase
Torben Hagerup :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Torben Hagerup , Christine Rüb A Guided Tour of Chernoff Bounds. [Citation Graph (3, 0)][DBLP ] Inf. Process. Lett., 1990, v:33, n:6, pp:305-308 [Journal ] Martin Dietzfelbinger , Torben Hagerup , Jyrki Katajainen , Martti Penttonen A Reliable Randomized Algorithm for the Closest-Pair Problem. [Citation Graph (1, 0)][DBLP ] J. Algorithms, 1997, v:25, n:1, pp:19-51 [Journal ] Torben Hagerup Optimal Parallel Algorithms on Planar Graphs. [Citation Graph (0, 0)][DBLP ] AWOC, 1988, pp:24-32 [Conf ] Torben Hagerup , Wolfgang Rülling A Generalized Topological Sorting Problem. [Citation Graph (0, 0)][DBLP ] Aegean Workshop on Computing, 1986, pp:261-270 [Conf ] Henning Fernau , Torben Hagerup , Naomi Nishimura , Prabhakar Ragde , Klaus Reinhardt On the parameterized complexity of the generalized rush hour puzzle. [Citation Graph (0, 0)][DBLP ] CCCG, 2003, pp:6-9 [Conf ] Pankaj K. Agarwal , Torben Hagerup , Rahul Ray , Micha Sharir , Michiel H. M. Smid , Emo Welzl Translating a Planar Object to Maximize Point Containment. [Citation Graph (0, 0)][DBLP ] ESA, 2002, pp:42-53 [Conf ] Pascal Berthomé , Th. Duboux , Torben Hagerup , Ilan Newman , Assaf Schuster Self-Simulation for the Passive Optical Star Model. [Citation Graph (0, 0)][DBLP ] ESA, 1995, pp:369-380 [Conf ] Martin Dietzfelbinger , Torben Hagerup Simple Minimal Perfect Hashing in Less Space. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:109-120 [Conf ] Bogdan S. Chlebus , Krzysztof Diks , Torben Hagerup , Tomasz Radzik New Simulations between CRCW PRAMs. [Citation Graph (0, 0)][DBLP ] FCT, 1989, pp:95-104 [Conf ] Torben Hagerup , Martin Maas Generalized Topological Sorting in Linear Time. [Citation Graph (0, 0)][DBLP ] FCT, 1993, pp:279-288 [Conf ] Joseph Cheriyan , Torben Hagerup A Randomized Maximum-Flow Algorithm [Citation Graph (0, 0)][DBLP ] FOCS, 1989, pp:118-123 [Conf ] 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 [Citation Graph (0, 0)][DBLP ] FOCS, 1990, pp:86-95 [Conf ] Torben Hagerup , Rajeev Raman Waste Makes Haste: Tight Bounds for Loose Parallel Sorting [Citation Graph (0, 0)][DBLP ] FOCS, 1992, pp:628-637 [Conf ] Torben Hagerup Neue Algorithmen für das Maximum-Flow-Problem. [Citation Graph (0, 0)][DBLP ] GI Jahrestagung (2), 1990, pp:507-516 [Conf ] Hans L. Bodlaender , Torben Hagerup Parallel Algorithms with Optimal Speedup for Bounded Treewidth. [Citation Graph (0, 0)][DBLP ] ICALP, 1995, pp:268-279 [Conf ] Joseph Cheriyan , Torben Hagerup , Kurt Mehlhorn Can A Maximum Flow be Computed on o(nm) Time? [Citation Graph (0, 0)][DBLP ] ICALP, 1990, pp:235-248 [Conf ] Torben Hagerup Improved Shortest Paths on the Word RAM. [Citation Graph (0, 0)][DBLP ] ICALP, 2000, pp:61-72 [Conf ] Torben Hagerup Fast Parallel Generation of Random Permutations. [Citation Graph (0, 0)][DBLP ] ICALP, 1991, pp:405-416 [Conf ] Torben Hagerup Fast Integer Merging on the EREW PRAM. [Citation Graph (0, 0)][DBLP ] ICALP, 1992, pp:318-329 [Conf ] Torben Hagerup Dynamic Algorithms for Graphs of Bounded Treewidth. [Citation Graph (0, 0)][DBLP ] ICALP, 1997, pp:292-302 [Conf ] Torben Hagerup Simpler and Faster Dictionaries on the AC0 RAM. [Citation Graph (0, 0)][DBLP ] ICALP, 1998, pp:79-90 [Conf ] Torben Hagerup , Marek Chrobak , Krzysztof Diks Parallel 5-Colouring of Planar Graphs. [Citation Graph (0, 0)][DBLP ] ICALP, 1987, pp:304-313 [Conf ] Torben Hagerup , Kurt Mehlhorn , J. Ian Munro Maintaining Discrete Probability Distributions Optimally. [Citation Graph (0, 0)][DBLP ] ICALP, 1993, pp:253-264 [Conf ] Torben Hagerup , Manfred Nowak Parallel Retrieval of Scattered Information. [Citation Graph (0, 0)][DBLP ] ICALP, 1989, pp:439-450 [Conf ] Torben Hagerup Allocating Independent Tasks to Parallel Processors: An Experimental Study. [Citation Graph (0, 0)][DBLP ] IRREGULAR, 1996, pp:1-33 [Conf ] Jürgen Dedorath , Jordan Gergov , Torben Hagerup More Efficient Parallel Flow Algorithms. [Citation Graph (0, 0)][DBLP ] ISAAC, 1995, pp:234-243 [Conf ] Holger Bast , Martin Dietzfelbinger , Torben Hagerup A Perfect Parallel Dictionary. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:133-141 [Conf ] Helmut Alt , Torben Hagerup , Kurt Mehlhorn , Franco P. Preparata Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. [Citation Graph (0, 0)][DBLP ] MFCS, 1986, pp:199-208 [Conf ] Hans L. Bodlaender , Torben Hagerup Tree Decompositions of Small Diameter. [Citation Graph (0, 0)][DBLP ] MFCS, 1998, pp:702-712 [Conf ] Shiva Chaudhuri , Torben Hagerup , Rajeev Raman Approximate and Exact Deterministic Parallel Selection. [Citation Graph (0, 0)][DBLP ] MFCS, 1993, pp:352-361 [Conf ] Bogdan S. Chlebus , Krzysztof Diks , Torben Hagerup , Tomasz Radzik Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models. [Citation Graph (0, 0)][DBLP ] MFCS, 1988, pp:231-239 [Conf ] Krzysztof Diks , Torben Hagerup , Wojciech Rytter Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:207-217 [Conf ] Torben Hagerup , Ola Petersson Merging and Sorting Strings in Parallel. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:298-306 [Conf ] Helmut Alt , Torben Hagerup , Kurt Mehlhorn , Franco P. Preparata Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones. [Citation Graph (0, 0)][DBLP ] Parallel Algorithms and Architectures, 1987, pp:11-15 [Conf ] Torben Hagerup , Arno Schmitt , Helmut Seidl FORK: A High-Level Language for PRAMs. [Citation Graph (0, 0)][DBLP ] PARLE (1), 1991, pp:304-320 [Conf ] Susanne Albers , Torben Hagerup Improved Parallel Integer Sorting Without Concurrent Writing. [Citation Graph (0, 0)][DBLP ] SODA, 1992, pp:463-472 [Conf ] Torben Hagerup Fast Deterministic Processor Allocation. [Citation Graph (0, 0)][DBLP ] SODA, 1993, pp:1-10 [Conf ] Torben Hagerup Fast Deterministic Construction of Static Dictionaries. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:414-418 [Conf ] Torben Hagerup , Jyrki Katajainen , Naomi Nishimura , Prabhakar Ragde Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees. [Citation Graph (0, 0)][DBLP ] SODA, 1995, pp:641-649 [Conf ] Holger Bast , Torben Hagerup Fast and Reliable Parallel Hashing. [Citation Graph (0, 0)][DBLP ] SPAA, 1991, pp:50-61 [Conf ] Torben Hagerup , H. Jung , Emo Welzl Efficient Parallel Computation of Arrangements of Hyperplanes in d Dimensions. [Citation Graph (0, 0)][DBLP ] SPAA, 1990, pp:290-297 [Conf ] Torben Hagerup , Tomasz Radzik Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAM. [Citation Graph (0, 0)][DBLP ] SPAA, 1990, pp:117-124 [Conf ] Torben Hagerup , Rajeev Raman Fast Deterministic Approximate and Exact Parallel Sorting. [Citation Graph (0, 0)][DBLP ] SPAA, 1993, pp:346-355 [Conf ] Torben Hagerup Simpler Computation of Single-Source Shortest Paths in Linear Average Time. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:362-369 [Conf ] Torben Hagerup Fast and Optimal Simulations between CRCW PRAMs. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:45-56 [Conf ] Torben Hagerup The Log-Star Revolution. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:259-278 [Conf ] Torben Hagerup Sorting and Searching on the Word RAM. [Citation Graph (0, 0)][DBLP ] STACS, 1998, pp:366-398 [Conf ] Torben Hagerup , Torsten Tholey Efficient Minimal Perfect Hashing in Nearly Minimal Space. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:317-326 [Conf ] Arne Andersson , Torben Hagerup , Johan Håstad , Ola Petersson The complexity of searching a sorted array of strings. [Citation Graph (0, 0)][DBLP ] STOC, 1994, pp:317-325 [Conf ] Arne Andersson , Torben Hagerup , Stefan Nilsson , Rajeev Raman Sorting in linear time? [Citation Graph (0, 0)][DBLP ] STOC, 1995, pp:427-436 [Conf ] Torben Hagerup Constant-Time Parallel Integer Sorting (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1991, pp:299-306 [Conf ] Torben Hagerup Optimal parallel string algorithms: sorting, merging and computing the minimum. [Citation Graph (0, 0)][DBLP ] STOC, 1994, pp:382-391 [Conf ] Torben Hagerup , Rajeev Raman An Efficient Quasidictionary. [Citation Graph (0, 0)][DBLP ] SWAT, 2002, pp:1-18 [Conf ] Torben Hagerup , Peter Sanders , Jesper Larsson Träff An Implementation of the Binary Blocking Flow Algorithm. [Citation Graph (0, 0)][DBLP ] Algorithm Engineering, 1998, pp:143-154 [Conf ] Shiva Chaudhuri , Torben Hagerup Prefix Graphs and Their Applications. [Citation Graph (0, 0)][DBLP ] WG, 1994, pp:206-218 [Conf ] Krzysztof Diks , Torben Hagerup More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. [Citation Graph (0, 0)][DBLP ] WG, 1996, pp:126-140 [Conf ] Thomas Erlebach , Torben Hagerup Routing Flow Through a Strongly Connected Graph. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2002, v:32, n:3, pp:467-473 [Journal ] Torben Hagerup Dynamic Algorithms for Graphs of Bounded Treewidth. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2000, v:27, n:3, pp:292-315 [Journal ] Torben Hagerup , Miroslaw Kutylowski Fast Integer Merging on the EREW PRAM. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1997, v:17, n:1, pp:55-66 [Journal ] Susanne Albers , Torben Hagerup Improved Parallel Integer Sorting without Concurrent Writing. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1997, v:136, n:1, pp:25-51 [Journal ] Hannah Bast , Torben Hagerup Fast Parallel Space Allocation, Estimation and Integer Sorting. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1995, v:123, n:1, pp:72-110 [Journal ] P. C. P. Bhatt , Krzysztof Diks , Torben Hagerup , V. C. Prasad , Tomasz Radzik , Sanjeev Saxena Improved Deterministic Parallel Integer Sorting [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1991, v:94, n:1, pp:29-47 [Journal ] Torben Hagerup Parallel Preprocessing for Path Queries without Concurrent Reading. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2000, v:158, n:1, pp:18-28 [Journal ] Torben Hagerup Towards Optimal Parallel Bucket Sorting [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1987, v:75, n:1, pp:39-51 [Journal ] Torben Hagerup Optimal Parallel Algorithms on Planar Graphs [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1990, v:84, n:1, pp:71-96 [Journal ] Torben Hagerup A Lower Bound for the Emulation of PRAM Memories on Processor Networks [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1995, v:119, n:1, pp:124-128 [Journal ] Torben Hagerup On Saving Space in Parallel Computation (Note). [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1988, v:29, n:6, pp:327-329 [Journal ] Torben Hagerup Hybridsort Revisited and Parallelized. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:32, n:1, pp:35-39 [Journal ] Torben Hagerup On a Compaction Theorem of Ragde. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1992, v:43, n:6, pp:335-340 [Journal ] Torben Hagerup The Parallel Complexity of Integer Prefix Summation. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1995, v:56, n:1, pp:59-64 [Journal ] Torben Hagerup , Christine Rüb Optimal Merging and Sorting on the Erew Pram. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:33, n:4, pp:181-185 [Journal ] Torben Hagerup , Hong Shen Improved Nonconservative Sequential and Parallel Integer Sorting. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1990, v:36, n:2, pp:57-63 [Journal ] Pascal Berthomé , Torben Hagerup , Ilan Newman , Assaf Schuster Self-Simulation for the Passive Optical Star. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2000, v:34, n:1, pp:128-147 [Journal ] Torben Hagerup Fast Deterministic Processor Allocation. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1995, v:18, n:3, pp:629-649 [Journal ] Torben Hagerup , Peter Bro Miltersen , Rasmus Pagh Deterministic Dictionaries. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2001, v:41, n:1, pp:69-85 [Journal ] Arne Andersson , Torben Hagerup , Stefan Nilsson , Rajeev Raman Sorting in Linear Time? [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1998, v:57, n:1, pp:74-93 [Journal ] Torben Hagerup , Jyrki Katajainen , Naomi Nishimura , Prabhakar Ragde Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1998, v:57, n:3, pp:366-375 [Journal ] Torben Hagerup Allocating Independent Tasks to Parallel Processors: An Experimental Study. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 1997, v:47, n:2, pp:185-197 [Journal ] Torben Hagerup Simpler Computation of Single-Source Shortest Paths in Linear Average Time. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2006, v:39, n:1, pp:113-120 [Journal ] Torben Hagerup , Margin Maas Generalized Topological Sorting in Linear Time. [Citation Graph (0, 0)][DBLP ] Nord. J. Comput., 1994, v:1, n:1, pp:38-49 [Journal ] Torben Hagerup , Jörg Keller Fast Parallel Permutation Algorithms. [Citation Graph (0, 0)][DBLP ] Parallel Processing Letters, 1995, v:5, n:, pp:139-148 [Journal ] Helmut Alt , Torben Hagerup , Kurt Mehlhorn , Franco P. Preparata Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1987, v:16, n:5, pp:808-835 [Journal ] Arne Andersson , Torben Hagerup , Johan Håstad , Ola Petersson Tight Bounds for Searching a Sorted Array of Strings. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2000, v:30, n:5, pp:1552-1578 [Journal ] Hans L. Bodlaender , Torben Hagerup Parallel Algorithms with Optimal Speedup for Bounded Treewidth. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:27, n:6, pp:1725-1746 [Journal ] Joseph Cheriyan , Torben Hagerup A Randomized Maximum-Flow Algorithm. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:2, pp:203-226 [Journal ] Joseph Cheriyan , Torben Hagerup , Kurt Mehlhorn An o(n³)-Time Algorithm Maximum-Flow Algorithm. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1996, v:25, n:6, pp:1144-1170 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1993, v:22, n:5, pp:1035-1052 [Journal ] Torben Hagerup Planar Depth-First Search in O(log n) Parallel Time. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1990, v:19, n:4, pp:678-704 [Journal ] Torben Hagerup , Marek Chrobak , Krzysztof Diks Optimal Parallel 5-Colouring of Planar Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1989, v:18, n:2, pp:288-300 [Journal ] Krzysztof Diks , Torben Hagerup More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1998, v:203, n:1, pp:3-29 [Journal ] Torben Hagerup Online and Offline Access to Short Lists. [Citation Graph (0, 0)][DBLP ] MFCS, 2007, pp:691-702 [Conf ] A Pictorial Description of Cole's Parallel Merge Sort. [Citation Graph (, )][DBLP ] Finding the Maximum Suffix with Fewer Comparisons. [Citation Graph (, )][DBLP ] Trimming of Graphs, with Application to Point Labeling. [Citation Graph (, )][DBLP ] An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees. [Citation Graph (, )][DBLP ] A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs. [Citation Graph (, )][DBLP ] Trimming of Graphs, with Application to Point Labeling [Citation Graph (, )][DBLP ] Search in 0.005secs, Finished in 0.764secs