default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheis Rauhe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j8]Stephen Alstrup, Mikkel Thorup
, Inge Li Gørtz, Theis Rauhe, Uri Zwick:
Union-Find with Constant Time Deletions. ACM Trans. Algorithms 11(1): 6:1-6:28 (2014)
2000 – 2009
- 2006
- [j7]Serge Abiteboul, Stephen Alstrup, Haim Kaplan, Tova Milo, Theis Rauhe:
Compact Labeling Scheme for Ancestor Queries. SIAM J. Comput. 35(6): 1295-1309 (2006) - 2005
- [j6]Stephen Alstrup, Philip Bille, Theis Rauhe:
Labeling Schemes for Small Distances in Trees. SIAM J. Discret. Math. 19(2): 448-462 (2005) - [j5]Stephen Alstrup, Thore Husfeldt, Theis Rauhe, Mikkel Thorup:
Black box for constant-time insertion in priority queues (note). ACM Trans. Algorithms 1(1): 102-106 (2005) - [c19]Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Uri Zwick:
Union-Find with Constant Time Deletions. ICALP 2005: 78-89 - 2004
- [j4]Stephen Alstrup, Thore Husfeldt, Theis Rauhe:
Dynamic nested brackets. Inf. Comput. 193(2): 75-83 (2004) - [j3]Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe:
Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment. Theory Comput. Syst. 37(3): 441-456 (2004) - 2003
- [j2]Thore Husfeldt, Theis Rauhe:
New Lower Bound Techniques for Dynamic Partial Sums and Related Problems. SIAM J. Comput. 32(3): 736-753 (2003) - [c18]Stephen Alstrup, Philip Bille, Theis Rauhe:
Labeling schemes for small distances in trees. SODA 2003: 689-698 - 2002
- [c17]Stephen Alstrup, Theis Rauhe:
Small Induced-Universal Graphs and Compact Implicit Graph Representations. FOCS 2002: 53-62 - [c16]Stephen Alstrup, Theis Rauhe:
Improved labeling scheme for ancestor queries. SODA 2002: 947-953 - [c15]Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe:
Nearest common ancestors: a survey and a new distributed algorithm. SPAA 2002: 258-264 - [c14]Stephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, Theis Rauhe:
Time and Space Efficient Multi-method Dispatching. SWAT 2002: 20-29 - [i1]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) - 2001
- [c13]Stephen Alstrup, Thore Husfeldt, Theis Rauhe:
A cell probe lower bound for dynamic nearest-neighbor searching. SODA 2001: 779-780 - [c12]Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe:
Optimal static range reporting in one dimension. STOC 2001: 476-482 - 2000
- [c11]Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe:
New Data Structures for Orthogonal Range Searching. FOCS 2000: 198-207 - [c10]Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe:
Pattern matching in dynamic texts. SODA 2000: 819-828
1990 – 1999
- 1999
- [c9]Stephen Alstrup, Amir M. Ben-Amram, Theis Rauhe:
Worst-Case and Amortised Optimality in Union-Find (Extended Abstract). STOC 1999: 499-506 - 1998
- [c8]Jakob Pagter, Theis Rauhe:
Optimal Time-Space Trade-Offs for Sorting. FOCS 1998: 264-268 - [c7]Stephen Alstrup, Thore Husfeldt, Theis Rauhe:
Marked Ancestor Problems. FOCS 1998: 534-544 - [c6]Thore Husfeldt, Theis Rauhe:
Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method. ICALP 1998: 67-78 - 1996
- [j1]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) - [c5]Morten Biehl, Nils Klarlund, Theis Rauhe:
Mona: Decidable Arithmetic in Practice. FTRTFT 1996: 459-462 - [c4]Thore Husfeldt, Theis Rauhe, Søren Skyum:
Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching. SWAT 1996: 198-211 - [c3]Morten Biehl, Nils Klarlund, Theis Rauhe:
Algorithms for Guided Tree Automata. Workshop on Implementing Automata 1996: 6-25 - 1995
- [c2]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 - [c1]Gudmund Skovbjerg Frandsen, Thore Husfeldt, Peter Bro Miltersen, Theis Rauhe, Søren Skyum:
Dynamic Algorithms for the Dyck Languages. WADS 1995: 98-108
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
