The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stephen Alstrup: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe
    New Data Structures for Orthogonal Range Searching. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:198-207 [Conf]
  2. Stephen Alstrup, Thore Husfeldt, Theis Rauhe
    Marked Ancestor Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:534-544 [Conf]
  3. Stephen Alstrup, Theis Rauhe
    Small Induced-Universal Graphs and Compact Implicit Graph Representations. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:53-62 [Conf]
  4. Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Uri Zwick
    Union-Find with Constant Time Deletions. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:78-89 [Conf]
  5. Stephen Alstrup, Jacob Holm
    Improved Algorithms for Finding Level Ancestors in Dynamic Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:73-84 [Conf]
  6. Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
    Minimizing Diameters of Dynamic Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:270-280 [Conf]
  7. Stephen Alstrup, Peter W. Lauridsen, Mikkel Thorup
    Generalized Dominators for Structured Programs. [Citation Graph (0, 0)][DBLP]
    SAS, 1996, pp:42-51 [Conf]
  8. Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe
    Pattern matching in dynamic texts. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:819-828 [Conf]
  9. Stephen Alstrup, Philip Bille, Theis Rauhe
    Labeling schemes for small distances in trees. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:689-698 [Conf]
  10. Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
    Direct Routing on Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:342-349 [Conf]
  11. Stephen Alstrup, Thore Husfeldt, Theis Rauhe
    A cell probe lower bound for dynamic nearest-neighbor searching. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:779-780 [Conf]
  12. Stephen Alstrup, Theis Rauhe
    Improved labeling scheme for ancestor queries. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:947-953 [Conf]
  13. Stephen Alstrup, Jens P. Secher, Mikkel Thorup
    Word encoding tree connectivity works. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:498-499 [Conf]
  14. Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe
    Nearest common ancestors: a survey and a new distributed algorithm. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:258-264 [Conf]
  15. Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe
    Optimal static range reporting in one dimension. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:476-482 [Conf]
  16. Stephen Alstrup, Amir M. Ben-Amram, Theis Rauhe
    Worst-Case and Amortised Optimality in Union-Find (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:499-506 [Conf]
  17. Stephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, Theis Rauhe
    Time and Space Efficient Multi-method Dispatching. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:20-29 [Conf]
  18. Stephen Alstrup, Jacob Holm, Mikkel Thorup
    Maintaining Center and Median in Dynamic Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:46-56 [Conf]
  19. Stephen Alstrup, Mikkel Thorup
    Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:212-222 [Conf]
  20. Stephen Alstrup, Peter W. Lauridsen, Peer Sommerlund, Mikkel Thorup
    Finding Cores of Limited Length. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:45-54 [Conf]
  21. Stephen Alstrup, Peter W. Lauridsen, Mikkel Thorup
    Generalized Dominators for Structured Programs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:3, pp:244-253 [Journal]
  22. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  23. Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
    Maintaining Information in Fully-Dynamic Trees with Top Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  24. Stephen Alstrup, Thore Husfeldt, Theis Rauhe
    Dynamic nested brackets. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:193, n:2, pp:75-83 [Journal]
  25. Stephen Alstrup, Jens Clausen, Kristian Jørgensen
    An O(|V|*|E|) Algorithm for Finding Immediate Multiple-Vertex Dominators. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:1, pp:9-11 [Journal]
  26. Stephen Alstrup, Jens P. Secher, Maz Spork
    Optimal On-Line Decremental Connectivity in Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:64, n:4, pp:161-164 [Journal]
  27. Stephen Alstrup, Mikkel Thorup
    Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:35, n:2, pp:169-188 [Journal]
  28. Serge Abiteboul, Stephen Alstrup, Haim Kaplan, Tova Milo, Theis Rauhe
    Compact Labeling Scheme for Ancestor Queries. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:6, pp:1295-1309 [Journal]
  29. Stephen Alstrup, Dov Harel, Peter W. Lauridsen, Mikkel Thorup
    Dominators in Linear Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:2117-2132 [Journal]
  30. Stephen Alstrup, Philip Bille, Theis Rauhe
    Labeling Schemes for Small Distances in Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:2, pp:448-462 [Journal]
  31. Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
    Maintaining information in fully dynamic trees with top trees. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2005, v:1, n:2, pp:243-264 [Journal]
  32. Stephen Alstrup, Thore Husfeldt, Theis Rauhe, Mikkel Thorup
    Black box for constant-time insertion in priority queues (note). [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2005, v:1, n:1, pp:102-106 [Journal]

Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002