Theis Rauhe

28 papers A* 12A 1B 2Journal 9Unranked 4
YearRankTypeTitle / Venue / Authors
2014 J jnl
Union-Find with Constant Time Deletions.
ACM Trans. Algorithms
Stephen Alstrup, Mikkel Thorup, Inge Li Gørtz, Theis Rauhe, Uri Zwick
2006 J jnl
Compact Labeling Scheme for Ancestor Queries.
SIAM J. Comput.
Serge Abiteboul, Stephen Alstrup, Haim Kaplan, Tova Milo, Theis Rauhe
2005 J jnl
Black box for constant-time insertion in priority queues (note).
ACM Trans. Algorithms
Stephen Alstrup, Thore Husfeldt, Theis Rauhe, Mikkel Thorup
2005 J jnl
Labeling Schemes for Small Distances in Trees.
SIAM J. Discret. Math.
Stephen Alstrup, Philip Bille, Theis Rauhe
2005 A* conf
Union-Find with Constant Time Deletions.
ICALP
Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Uri Zwick
2004 J jnl
Dynamic nested brackets.
Inf. Comput.
Stephen Alstrup, Thore Husfeldt, Theis Rauhe
2004 J jnl
Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment.
Theory Comput. Syst.
Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe
2003 A* conf
Labeling schemes for small distances in trees.
SODA
Stephen Alstrup, Philip Bille, Theis Rauhe
2003 J jnl
New Lower Bound Techniques for Dynamic Partial Sums and Related Problems.
SIAM J. Comput.
Thore Husfeldt, Theis Rauhe
2002 J jnl
Efficient Tree Layout in a Multilevel Memory Hierarchy
CoRR
Stephen Alstrup, Michael A. Bender, Erik D. Demaine, Martin Farach-Colton, J. Ian Munro, Theis Rauhe, Mikkel Thorup
2002 A* conf
Improved labeling scheme for ancestor queries.
SODA
Stephen Alstrup, Theis Rauhe
2002 B conf
Nearest common ancestors: a survey and a new distributed algorithm.
SPAA
Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe
2002 A* conf
Small Induced-Universal Graphs and Compact Implicit Graph Representations.
FOCS
Stephen Alstrup, Theis Rauhe
2002 — conf
Time and Space Efficient Multi-method Dispatching.
SWAT
Stephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, Theis Rauhe
2001 A* conf
A cell probe lower bound for dynamic nearest-neighbor searching.
SODA
Stephen Alstrup, Thore Husfeldt, Theis Rauhe
2001 A* conf
Optimal static range reporting in one dimension.
STOC
Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe
2000 A* conf
New Data Structures for Orthogonal Range Searching.
FOCS
Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe
2000 A* conf
Pattern matching in dynamic texts.
SODA
Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe
1999 A* conf
Worst-Case and Amortised Optimality in Union-Find (Extended Abstract).
STOC
Stephen Alstrup, Amir M. Ben-Amram, Theis Rauhe
1998 A* conf
Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method.
ICALP
Thore Husfeldt, Theis Rauhe
1998 A* conf
Marked Ancestor Problems.
FOCS
Stephen Alstrup, Thore Husfeldt, Theis Rauhe
1998 A* conf
Optimal Time-Space Trade-Offs for Sorting.
FOCS
Jakob Pagter, Theis Rauhe
1996 — conf
Algorithms for Guided Tree Automata.
Workshop on Implementing Automata
Morten Biehl, Nils Klarlund, Theis Rauhe
1996 J jnl
Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parantheses Matching.
Nord. J. Comput.
Thore Husfeldt, Theis Rauhe, Søren Skyum
1996 — conf
Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching.
SWAT
Thore Husfeldt, Theis Rauhe, Søren Skyum
1996 — conf
Mona: Decidable Arithmetic in Practice.
FTRTFT
Morten Biehl, Nils Klarlund, Theis Rauhe
1995 B conf
Dynamic Algorithms for the Dyck Languages.
WADS
Gudmund Skovbjerg Frandsen, Thore Husfeldt, Peter Bro Miltersen, Theis Rauhe, Søren Skyum
1995 A conf
Mona: Monadic Second-Order Logic in Practice.
TACAS
Jesper G. Henriksen, Jakob L. Jensen, Michael E. Jørgensen, Nils Klarlund, Robert Paige, Theis Rauhe, Anders Sandholm