Thore Husfeldt and Theis Rauhe,
New Lower Bound Techniques for Dynamic Partial Sums and Related Problems
Siam J. Comput., Vol. 32, pp. 736-753, 2003.
Stephen Alstrup, Philip Bille, and Theis Rauhe,
Labeling Schemes for Small Distances in Trees
To appear in Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA'03), 2003.
Stephen Alstrup and Theis Rauhe,
Small Induced-Universal Graphs and Compact Implicit Graph Representations
2002 IEEE Symposium on Foundations of Computer Science (FOCS '02).
[ps,pdf]
Stephen Alstrup, Cyril Gavoille, Haim Kaplan, and Theis Rauhe,
Nearest Common Ancestors: A Survey and a new Distributed Algorithm
(SPAA'02), 2002.
Stephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz and Theis Rauhe,
Time and Space Efficient Multi-Method Dispatching
(SWAT'02), 2002.
Stephen Alstrup and Theis Rauhe,
Improved Labeling Scheme for Ancestor Queries
Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA'02), 2002.
Stephen Alstrup,
Gerth Stølting Brodal,
and Theis Rauhe,
Optimal Static Range Reporting in One Dimension
In Proc. 33rd Annual ACM Symposium on Theory of
Computing (STOC'01), 2001.
[ps,pdf]
Stephen Alstrup,
Thore Husfeldt, and Theis Rauhe,
A Cell Probe Lower Bound for Dynamic Nearest-Neighbour Searching
Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA'01), pages 779-780, 2001.
[ps,pdf]
Stephen Alstrup,
Gerth Stølting Brodal,
and Theis Rauhe,
New Data Structures for Orthogonal Range Searching
Proc. 41st Annual Symposium on Foundations of Computer
Science (FOCS'00), pages 198-207, 2000.
[ps,pdf]
Stephen Alstrup,
Gerth Stølting Brodal,
and Theis Rauhe,
Pattern Matching in Dynamic Texts
Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'00),
pages 819-828, 2000.
[ps,pdf]
Stephen Alstrup,
Amir M. Ben-Amram,
and Theis Rauhe,
Worst-case and Amortised Optimality in Union-Find
The Thirty-First Annual ACM Symposium on Theory of Computing (STOC
'99), 1999.
[ps,pdf]
Jakob Pagter and Theis Rauhe,
Optimal Time-Space Trade-Offs for Sorting
1998 IEEE Symposium on Foundations of Computer Science (FOCS '98).
[dvi,ps,pdf]
Stephen Alstrup,
Thore Husfeldt,
and Theis Rauhe,
Marked Ancestor Problems
1998 IEEE Symposium on
Foundations of Computer Science (FOCS '98).
[ps,pdf]
Thore Husfeldt,
and Theis Rauhe,
Hardness Results for Dynamic Problems by Extensions of Fredman and
Saks' Chronogram Method
Proc. 25th International Colloquium on
Automata, Languages, and Programming
(ICALP '98), 1998, Springer LNCS 1443, pp. 67-78.
[ps,pdf]
J.G. Henrisken, J. Jensen, M. Jørgensen, N. Klarlund,
B. Paige, T. Rauhe, and A. Sandholm
Mona: Monadic Second-Order Logic in Practice
Proc. Tools and Algorithms for the Constrcution and Analysis
of Systems (TACAS'95), LNCS vol. 1019, Springer-Verlag, 1996.
[ps,pdf]