Theis Rauhe

According to our database, Theis Rauhe authored at least 26 papers between 1995 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2014

Union-Find with Constant Time Deletions.

Stephen Alstrup, Mikkel Thorup, Inge Li Gørtz, Theis Rauhe, Uri Zwick

ACM Trans. Algorithms, 2014

2006

Compact Labeling Scheme for Ancestor Queries.

Serge Abiteboul, Stephen Alstrup, Haim Kaplan, Tova Milo, Theis Rauhe

SIAM J. Comput., 2006

2005

Black box for constant-time insertion in priority queues (note).

Stephen Alstrup, Thore Husfeldt, Theis Rauhe, Mikkel Thorup

ACM Trans. Algorithms, 2005

Labeling Schemes for Small Distances in Trees.

Stephen Alstrup, Philip Bille, Theis Rauhe

SIAM J. Discret. Math., 2005

2004

Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment.

Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe

Theory Comput. Syst., 2004

Dynamic nested brackets.

Stephen Alstrup, Thore Husfeldt, Theis Rauhe

Inf. Comput., 2004

2003

New Lower Bound Techniques for Dynamic Partial Sums and Related Problems.

Thore Husfeldt, Theis Rauhe

SIAM J. Comput., 2003

2002

Efficient Tree Layout in a Multilevel Memory Hierarchy

Stephen Alstrup, Michael A. Bender, Erik D. Demaine, Martin Farach-Colton, J. Ian Munro, Theis Rauhe, Mikkel Thorup

CoRR, 2002

Time and Space Efficient Multi-method Dispatching.

Stephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, Theis Rauhe

Proceedings of the Algorithm Theory, 2002

Nearest common ancestors: a survey and a new distributed algorithm.

Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe

Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002

Improved labeling scheme for ancestor queries.

Stephen Alstrup, Theis Rauhe

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Small Induced-Universal Graphs and Compact Implicit Graph Representations.

Stephen Alstrup, Theis Rauhe

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001

Optimal static range reporting in one dimension.

Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

A cell probe lower bound for dynamic nearest-neighbor searching.

Stephen Alstrup, Thore Husfeldt, Theis Rauhe

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000

Pattern matching in dynamic texts.

Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

New Data Structures for Orthogonal Range Searching.

Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999

Worst-Case and Amortised Optimality in Union-Find (Extended Abstract).

Stephen Alstrup, Amir M. Ben-Amram, Theis Rauhe

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

1998

Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method.

Thore Husfeldt, Theis Rauhe

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Optimal Time-Space Trade-Offs for Sorting.

Jakob Pagter, Theis Rauhe

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

Marked Ancestor Problems.

Stephen Alstrup, Thore Husfeldt, Theis Rauhe

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1996

Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parantheses Matching.

Thore Husfeldt, Theis Rauhe, Søren Skyum

Nord. J. Comput., 1996

Algorithms for Guided Tree Automata.

Morten Biehl, Nils Klarlund, Theis Rauhe

Proceedings of the Automata Implementation, 1996

Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching.

Thore Husfeldt, Theis Rauhe, Søren Skyum

Proceedings of the Algorithm Theory, 1996

Mona: Decidable Arithmetic in Practice.

Morten Biehl, Nils Klarlund, Theis Rauhe

Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1996

1995

Dynamic Algorithms for the Dyck Languages.

Gudmund Skovbjerg Frandsen, Thore Husfeldt, Peter Bro Miltersen, Theis Rauhe, Søren Skyum

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

Mona: Monadic Second-Order Logic in Practice.

Jesper G. Henriksen, Jakob L. Jensen, Michael E. Jørgensen, Nils Klarlund, Robert Paige, Theis Rauhe, Anders Sandholm

Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1995