Torben Hagerup

According to our database1, Torben Hagerup authored at least 120 papers between 1986 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Space-efficient Euler partition and bipartite edge coloring.
Theor. Comput. Sci., 2019

Fast Breadth-First Search in Still Less Space.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Rank-Select Indices Without Tears.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

A Constant-Time Colored Choice Dictionary with Almost Robust Iteration.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Highly Succinct Dynamic Data Structures.
Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

2018
Fast Breadth-First Search in Still Less Space.
CoRR, 2018

Small Uncolored and Colored Choice Dictionaries.
CoRR, 2018

Guidesort: Simpler Optimal Deterministic Sorting for the Parallel Disk Model.
CoRR, 2018

Space-Efficient DFS and Applications: Simpler, Leaner, Faster.
CoRR, 2018

2017
An Optimal Choice Dictionary.
CoRR, 2017

On-the-Fly Array Initialization in Less Space.
CoRR, 2017

Rank-Select Indices Without Tears.
CoRR, 2017

On-the-Fly Array Initialization in Less Space.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Space-Efficient Euler Partition and Bipartite Edge Coloring.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016
Succinct Choice Dictionaries.
CoRR, 2016

2015
Space-efficient Basic Graph Algorithms.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Easy Multiple-Precision Divisors and Word-RAM Constants.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2012
A strengthened analysis of an algorithm for Dominating Set in planar graphs.
Discrete Applied Mathematics, 2012

Kernels for Edge Dominating Set: Simpler or Smaller.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011
Finding the maximum suffix with fewer comparisons.
J. Discrete Algorithms, 2011

Simpler Linear-Time Kernelization for Planar Dominating Set.
Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

2010
Trimming of Graphs, with Application to Point Labeling.
Theory Comput. Syst., 2010

Finding the Maximum Suffix with Fewer Comparisons.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009
An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

A Pictorial Description of Cole's Parallel Merge Sort.
Proceedings of the Efficient Algorithms, 2009

2008
Trimming of Graphs, with Application to Point Labeling
CoRR, 2008

Trimming of Graphs, with Application to Point Labeling.
Proceedings of the STACS 2008, 2008

2007
A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

Online and Offline Access to Short Lists.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006
Simpler Computation of Single-Source Shortest Paths in Linear Average Time.
Theory Comput. Syst., 2006

2004
Simpler Computation of Single-Source Shortest Paths in Linear Average Time.
Proceedings of the STACS 2004, 2004

2003
On the parameterized complexity of the generalized rush hour puzzle.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
Routing Flow Through a Strongly Connected Graph.
Algorithmica, 2002

An Efficient Quasidictionary.
Proceedings of the Algorithm Theory, 2002

Translating a Planar Object to Maximize Point Containment.
Proceedings of the Algorithms, 2002

2001
Deterministic Dictionaries.
J. Algorithms, 2001

Efficient Minimal Perfect Hashing in Nearly Minimal Space.
Proceedings of the STACS 2001, 2001

Simple Minimal Perfect Hashing in Less Space.
Proceedings of the Algorithms, 2001

2000
Tight Bounds for Searching a Sorted Array of Strings.
SIAM J. Comput., 2000

Self-Simulation for the Passive Optical Star.
J. Algorithms, 2000

Parallel Preprocessing for Path Queries without Concurrent Reading.
Inf. Comput., 2000

Dynamic Algorithms for Graphs of Bounded Treewidth.
Algorithmica, 2000

Improved Shortest Paths on the Word RAM.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999
Fast Deterministic Construction of Static Dictionaries.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998
More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree.
Theor. Comput. Sci., 1998

Parallel Algorithms with Optimal Speedup for Bounded Treewidth.
SIAM J. Comput., 1998

Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth.
J. Comput. Syst. Sci., 1998

Sorting in Linear Time?
J. Comput. Syst. Sci., 1998

An Implementation of the Binary Blocking Flow Algorithm.
Proceedings of the Algorithm Engineering, 1998

Sorting and Searching on the Word RAM.
Proceedings of the STACS 98, 1998

Tree Decompositions of Small Diameter.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Simpler and Faster Dictionaries on the AC0 RAM.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997
Allocating Independent Tasks to Parallel Processors: An Experimental Study.
J. Parallel Distrib. Comput., 1997

A Reliable Randomized Algorithm for the Closest-Pair Problem.
J. Algorithms, 1997

Improved Parallel Integer Sorting without Concurrent Writing.
Inf. Comput., 1997

Fast Integer Merging on the EREW PRAM.
Algorithmica, 1997

Dynamic Algorithms for Graphs of Bounded Treewidth.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996
An o(n³)-Time Algorithm Maximum-Flow Algorithm.
SIAM J. Comput., 1996

More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

Allocating Independent Tasks to Parallel Processors: An Experimental Study.
Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1996

1995
A Lower Bound for the Emulation of PRAM Memories on Processor Networks
Inf. Comput., May, 1995

A Randomized Maximum-Flow Algorithm.
SIAM J. Comput., 1995

Fast Parallel Permutation Algorithms.
Parallel Processing Letters, 1995

Fast Deterministic Processor Allocation.
J. Algorithms, 1995

The Parallel Complexity of Integer Prefix Summation.
Inf. Process. Lett., 1995

Fast Parallel Space Allocation, Estimation and Integer Sorting.
Inf. Comput., 1995

Sorting in linear time?
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

More Efficient Parallel Flow Algorithms.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Parallel Algorithms with Optimal Speedup for Bounded Treewidth.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Self-Simulation for the Passive Optical Star Model.
Proceedings of the Algorithms, 1995

1994
Generalized Topological Sorting in Linear Time.
Nord. J. Comput., 1994

Prefix Graphs and Their Applications.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

Optimal parallel string algorithms: sorting, merging and computing the minimum.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

The complexity of searching a sorted array of strings.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

1993
Drawing Graphs in the Plane with High Resolution.
SIAM J. Comput., 1993

Fast Deterministic Approximate and Exact Parallel Sorting.
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

Fast Deterministic Processor Allocation.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

Approximate and Exact Deterministic Parallel Selection.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

Maintaining Discrete Probability Distributions Optimally.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

Generalized Topological Sorting in Linear Time.
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

1992
On a Compaction Theorem of Ragde.
Inf. Process. Lett., 1992

FORK: A high-level language for PRAMs.
Future Generation Comp. Syst., 1992

The Log-Star Revolution.
Proceedings of the STACS 92, 1992

Fast and Optimal Simulations between CRCW PRAMs.
Proceedings of the STACS 92, 1992

Improved Parallel Integer Sorting Without Concurrent Writing.
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

Merging and Sorting Strings in Parallel.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

A Perfect Parallel Dictionary.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

Fast Integer Merging on the EREW PRAM.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

Waste Makes Haste: Tight Bounds for Loose Parallel Sorting
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
Improved Deterministic Parallel Integer Sorting
Inf. Comput., September, 1991

Constant-Time Parallel Integer Sorting (Extended Abstract)
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Fast and Reliable Parallel Hashing.
Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991

FORK: A High-Level Language for PRAMs.
Proceedings of the PARLE '91: Parallel Architectures and Languages Europe, 1991

Fast Parallel Generation of Random Permutations.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990
Optimal Parallel Algorithms on Planar Graphs
Inf. Comput., January, 1990

Planar Depth-First Search in O(log n) Parallel Time.
SIAM J. Comput., 1990

Improved Nonconservative Sequential and Parallel Integer Sorting.
Inf. Process. Lett., 1990

A Guided Tour of Chernoff Bounds.
Inf. Process. Lett., 1990

Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAM.
Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990

Efficient Parallel Computation of Arrangements of Hyperplanes in d Dimensions.
Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990

Can A Maximum Flow be Computed on o(nm) Time?
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

Neue Algorithmen für das Maximum-Flow-Problem.
Proceedings of the GI, 1990

Drawing Graphs in the Plane with High Resolution
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989
Optimal Parallel 5-Colouring of Planar Graphs.
SIAM J. Comput., 1989

Optimal Merging and Sorting on the Erew Pram.
Inf. Process. Lett., 1989

Hybridsort Revisited and Parallelized.
Inf. Process. Lett., 1989

Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

Parallel Retrieval of Scattered Information.
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

A Randomized Maximum-Flow Algorithm
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

New Simulations between CRCW PRAMs.
Proceedings of the Fundamentals of Computation Theory, 1989

1988
Parallel algorithms on planar graphs.
PhD thesis, 1988

On Saving Space in Parallel Computation (Note).
Inf. Process. Lett., 1988

Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

Optimal Parallel Algorithms on Planar Graphs.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987
Towards Optimal Parallel Bucket Sorting
Inf. Comput., October, 1987

Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones.
SIAM J. Comput., 1987

Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones.
Proceedings of the Parallel Algorithms and Architectures, 1987

Parallel 5-Colouring of Planar Graphs.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986
A Generalized Topological Sorting Problem.
Proceedings of the VLSI Algorithms and Architectures, 1986


  Loading...