Theis Rauhe

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

Stephen Alstrup, Philip Bille, Theis Rauhe: Labeling Schemes for Small Distances in Trees. SIAM J. Discrete Math. 19(2): 448-462 (2005)

Stephen Alstrup, Thore Husfeldt, Theis Rauhe, Mikkel Thorup: Black box for constant-time insertion in priority queues (note). ACM Transactions on Algorithms 1(1): 102-106 (2005)

Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Uri Zwick: Union-Find with Constant Time Deletions. ICALP 2005: 78-89

Stephen Alstrup, Thore Husfeldt, Theis Rauhe: Dynamic nested brackets. Inf. Comput. 193(2): 75-83 (2004)

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

Stephen Alstrup, Philip Bille, Theis Rauhe: Labeling schemes for small distances in trees. SODA 2003: 689-698

Stephen Alstrup, Theis Rauhe: Small Induced-Universal Graphs and Compact Implicit Graph Representations. FOCS 2002: 53-62

Stephen Alstrup, Theis Rauhe: Improved labeling scheme for ancestor queries. SODA 2002: 947-953

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

Stephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, Theis Rauhe: Time and Space Efficient Multi-method Dispatching. SWAT 2002: 20-29

Stephen Alstrup, Michael A. Bender, Erik D. Demaine, Martin Farach-Colton, J. Ian Munro, Theis Rauhe, Mikkel Thorup: Efficient Tree Layout in a Multilevel Memory Hierarchy. CoRR cs.DS/0211010 (2002)

Stephen Alstrup, Thore Husfeldt, Theis Rauhe: A cell probe lower bound for dynamic nearest-neighbor searching. SODA 2001: 779-780

Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe: Optimal static range reporting in one dimension. STOC 2001: 476-482

Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe: New Data Structures for Orthogonal Range Searching. FOCS 2000: 198-207

Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe: Pattern matching in dynamic texts. SODA 2000: 819-828

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

Jakob Pagter, Theis Rauhe: Optimal Time-Space Trade-Offs for Sorting. FOCS 1998: 264-268

Stephen Alstrup, Thore Husfeldt, Theis Rauhe: Marked Ancestor Problems. FOCS 1998: 534-544

Thore Husfeldt, Theis Rauhe: Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method. ICALP 1998: 67-78

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

Morten Biehl, Nils Klarlund, Theis Rauhe: Mona: Decidable Arithmetic in Practice. FTRTFT 1996: 459-462

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

Morten Biehl, Nils Klarlund, Theis Rauhe: Algorithms for Guided Tree Automata. Workshop on Implementing Automata 1996: 6-25

Jesper G. Henriksen, Jakob L. Jensen, Michael E. Jørgensen, Nils Klarlund, Robert Paige, Theis Rauhe, Anders Sandholm: Mona: Monadic Second-Order Logic in Practice. TACAS 1995: 89-110

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