| 2006 |
|---|
| 17 | 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 |
|---|
| 16 | 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 |
| 15 | Maintaining information in fully dynamic trees with top trees. Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup. ACM Transactions on Algorithms (1): 243-264 (2005). Web SearchBibTeXDownload |
| 14 | Union-Find with Constant Time Deletions. Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Uri Zwick. ICALP 2005, 78-89. Web SearchBibTeXDownload |
| 2003 |
|---|
| 13 | Maintaining Information in Fully-Dynamic Trees with Top Trees. Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup. CoRR (cs.DS/0310065) (2003). Web SearchBibTeXDownload |
| 2002 |
|---|
| 12 | 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 |
| 11 | Nearest common ancestors: a survey and a new distributed algorithm. Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe. SPAA 2002, 258-264. Web SearchBibTeXDownload |
| 2000 |
|---|
| 10 | Generalized Dominators for Structured Programs. Stephen Alstrup, Peter W. Lauridsen, Mikkel Thorup. Algorithmica (27): 244-253 (2000). Web SearchBibTeXDownload |
| 9 | Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. Stephen Alstrup, Mikkel Thorup. J. Algorithms (35): 169-188 (2000). Web SearchBibTeXDownload |
| 8 | Word encoding tree connectivity works. Stephen Alstrup, Jens P. Secher, Mikkel Thorup. SODA 2000, 498-499. Web SearchBibTeXDownload |
| 7 | Maintaining Center and Median in Dynamic Trees. Stephen Alstrup, Jacob Holm, Mikkel Thorup. SWAT 2000, 46-56. Web SearchBibTeXDownload |
| 1999 |
|---|
| 6 | Dominators in Linear Time. Stephen Alstrup, Dov Harel, Peter W. Lauridsen, Mikkel Thorup. SIAM J. Comput. (28): 2117-2132 (1999). Web SearchBibTeXDownload |
| 1998 |
|---|
| 5 | Direct Routing on Trees (Extended Abstract). Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup. SODA 1998, 342-349. Web SearchBibTeXDownload |
| 1997 |
|---|
| 4 | Minimizing Diameters of Dynamic Trees. Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup. ICALP 1997, 270-280. Web SearchBibTeXDownload |
| 3 | Finding Cores of Limited Length. Stephen Alstrup, Peter W. Lauridsen, Peer Sommerlund, Mikkel Thorup. WADS 1997, 45-54. Web SearchBibTeXDownload |
| 1996 |
|---|
| 2 | Generalized Dominators for Structured Programs. Stephen Alstrup, Peter W. Lauridsen, Mikkel Thorup. SAS 1996, 42-51. Web SearchBibTeXDownload |
| 1 | Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. Stephen Alstrup, Mikkel Thorup. SWAT 1996, 212-222. Web SearchBibTeXDownload |
