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 001 (TACAS, 1995)

Dynamic Algorithms for the Dyck Languages. - Gudmund Skovbjerg Frandsen; Thore Husfeldt; Peter Bro Miltersen; Theis Rauhe; Søren Skyum (WADS, 1995)

Mona: Decidable Arithmetic in Practice. - Morten Biehl; Nils Klarlund; Theis Rauhe (FTRTFT, 1996)

Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching. - Thore Husfeldt; Theis Rauhe; Søren Skyum (SWAT, 1996)

Algorithms for Guided Tree Automata. - Morten Biehl; Nils Klarlund; Theis Rauhe (Workshop on Implementing Automata, 1996)

Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parantheses Matching. - Thore Husfeldt; Theis Rauhe; Søren Skyum (Nord. J. Comput., 1996)

Marked Ancestor Problems. - Stephen Alstrup; Thore Husfeldt; Theis Rauhe (FOCS, 1998)

Optimal Time-Space Trade-Offs for Sorting. - Jakob Pagter; Theis Rauhe (FOCS, 1998)

Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method. - Thore Husfeldt; Theis Rauhe (ICALP, 1998)

Worst-Case and Amortised Optimality in Union-Find (Extended Abstract). - Stephen Alstrup; Amir M. Ben-Amram; Theis Rauhe (STOC, 1999)

New Data Structures for Orthogonal Range Searching. - Stephen Alstrup; Gerth Stølting Brodal; Theis Rauhe (FOCS, 2000)

Pattern matching in dynamic texts. - Stephen Alstrup; Gerth Stølting Brodal; Theis Rauhe (SODA, 2000)

A cell probe lower bound for dynamic nearest-neighbor searching. - Stephen Alstrup; Thore Husfeldt; Theis Rauhe (SODA, 2001)

Optimal static range reporting in one dimension. - Stephen Alstrup; Gerth Stølting Brodal; Theis Rauhe (STOC, 2001)

Small Induced-Universal Graphs and Compact Implicit Graph Representations. - Stephen Alstrup; Theis Rauhe (FOCS, 2002)

Improved labeling scheme for ancestor queries. - Stephen Alstrup; Theis Rauhe (SODA, 2002)

Nearest common ancestors: a survey and a new distributed algorithm. - Stephen Alstrup; Cyril Gavoille; Haim Kaplan; Theis Rauhe (SPAA, 2002)

Time and Space Efficient Multi-method Dispatching. - Stephen Alstrup; Gerth Stølting Brodal; Inge Li Gørtz; Theis Rauhe (SWAT, 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)

New Lower Bound Techniques for Dynamic Partial Sums and Related Problems. - Thore Husfeldt; Theis Rauhe (SIAM J. Comput., 2003)

Dynamic nested brackets. - Stephen Alstrup; Thore Husfeldt; Theis Rauhe (Inf. Comput., 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)

Labeling Schemes for Small Distances in Trees. - Stephen Alstrup; Philip Bille; Theis Rauhe (SIAM J. Discret. Math., 2005)

Black box for constant-time insertion in priority queues (note). - Stephen Alstrup; Thore Husfeldt; Theis Rauhe; Mikkel Thorup (ACM Trans. Algorithms, 2005)

Compact Labeling Scheme for Ancestor Queries. - Serge Abiteboul; Stephen Alstrup; Haim Kaplan; Tova Milo; Theis Rauhe (SIAM J. Comput., 2006)

Union-Find with Constant Time Deletions. - Stephen Alstrup; Mikkel Thorup; Inge Li Gørtz; Theis Rauhe; Uri Zwick (ACM Trans. Algorithms, 2014)