The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Theis Rauhe: [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. Jakob Pagter, Theis Rauhe
    Optimal Time-Space Trade-Offs for Sorting. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:264-268 [Conf]
  5. Morten Biehl, Nils Klarlund, Theis Rauhe
    Mona: Decidable Arithmetic in Practice. [Citation Graph (0, 0)][DBLP]
    FTRTFT, 1996, pp:459-462 [Conf]
  6. 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]
  7. Thore Husfeldt, Theis Rauhe
    Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:67-78 [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, 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]
  11. Stephen Alstrup, Theis Rauhe
    Improved labeling scheme for ancestor queries. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:947-953 [Conf]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. Thore Husfeldt, Theis Rauhe, Søren Skyum
    Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:198-211 [Conf]
  17. 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. [Citation Graph (0, 0)][DBLP]
    TACAS, 1995, pp:89-110 [Conf]
  18. Gudmund Skovbjerg Frandsen, Thore Husfeldt, Peter Bro Miltersen, Theis Rauhe, Søren Skyum
    Dynamic Algorithms for the Dyck Languages. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:98-108 [Conf]
  19. Morten Biehl, Nils Klarlund, Theis Rauhe
    Algorithms for Guided Tree Automata. [Citation Graph (0, 0)][DBLP]
    Workshop on Implementing Automata, 1996, pp:6-25 [Conf]
  20. 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]
  21. 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]
  22. Thore Husfeldt, Theis Rauhe, Søren Skyum
    Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parantheses Matching. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1996, v:3, n:4, pp:323-336 [Journal]
  23. 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]
  24. Thore Husfeldt, Theis Rauhe
    New Lower Bound Techniques for Dynamic Partial Sums and Related Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:3, pp:736-753 [Journal]
  25. 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]
  26. 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.002secs, Finished in 0.003secs
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