Theis Rauhe
Loading Google Thumbnails...
| 2006 |
|---|
| 6 | Compact Labeling Scheme for Ancestor Queries. Serge Abiteboul, Stephen Alstrup, Haim Kaplan, Tova Milo, Theis Rauhe. SIAM J. Comput. (35): 1295-1309 (2006). Web SearchBibTeXDownload |
| 2005 |
|---|
| 5 | Black box for constant-time insertion in priority queues (note). Stephen Alstrup, Thore Husfeldt, Theis Rauhe, Mikkel Thorup. ACM Transactions on Algorithms (1): 102-106 (2005). Web SearchBibTeXDownload |
| 4 | Union-Find with Constant Time Deletions. Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Uri Zwick. ICALP 2005, 78-89. Web SearchBibTeXDownload |
| 2002 |
|---|
| 3 | 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 (cs.DS/0211010) (2002). Web SearchBibTeXDownload |
| 2 | Nearest common ancestors: a survey and a new distributed algorithm. Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe. SPAA 2002, 258-264. Web SearchBibTeXDownload |
| 1995 |
|---|
| 1 | 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. TACAS 1995, 89-110. Web SearchBibTeXDownload |
from DBLP and Google Scholar
