Остановите войну!
for scientists:
default search action
Mikkel Thorup
- > Home > Persons > Mikkel Thorup
Publications
- 2019
- [j72]Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick:
Adjacency Labeling Schemes and Induced-Universal Graphs. SIAM J. Discret. Math. 33(1): 116-137 (2019) - 2015
- [c108]Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick:
Adjacency Labeling Schemes and Induced-Universal Graphs. STOC 2015: 625-634 - 2014
- [j64]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) - [i24]Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick:
Adjacency labeling schemes and induced-universal graphs. CoRR abs/1404.3391 (2014) - 2005
- [j39]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) - [j38]Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup:
Maintaining information in fully dynamic trees with top trees. ACM Trans. Algorithms 1(2): 243-264 (2005) - [c68]Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Uri Zwick:
Union-Find with Constant Time Deletions. ICALP 2005: 78-89 - 2003
- [i4]Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup:
Maintaining Information in Fully-Dynamic Trees with Top Trees. CoRR cs.DS/0310065 (2003) - 2002
- [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) - 2000
- [j22]Stephen Alstrup, Peter W. Lauridsen, Mikkel Thorup:
Generalized Dominators for Structured Programs. Algorithmica 27(3): 244-253 (2000) - [j21]Stephen Alstrup, Mikkel Thorup:
Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. J. Algorithms 35(2): 169-188 (2000) - [c30]Stephen Alstrup, Jens P. Secher, Mikkel Thorup:
Word encoding tree connectivity works. SODA 2000: 498-499 - [c26]Stephen Alstrup, Jacob Holm, Mikkel Thorup:
Maintaining Center and Median in Dynamic Trees. SWAT 2000: 46-56 - 1999
- [j14]Stephen Alstrup, Dov Harel, Peter W. Lauridsen, Mikkel Thorup:
Dominators in Linear Time. SIAM J. Comput. 28(6): 2117-2132 (1999) - 1998
- [c23]Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup:
Direct Routing on Trees (Extended Abstract). SODA 1998: 342-349 - 1997
- [c18]Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup:
Minimizing Diameters of Dynamic Trees. ICALP 1997: 270-280 - [c15]Stephen Alstrup, Peter W. Lauridsen, Peer Sommerlund, Mikkel Thorup:
Finding Cores of Limited Length. WADS 1997: 45-54 - 1996
- [c11]Stephen Alstrup, Peter W. Lauridsen, Mikkel Thorup:
Generalized Dominators for Structured Programs. SAS 1996: 42-51 - [c8]Stephen Alstrup, Mikkel Thorup:
Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. SWAT 1996: 212-222
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-25 01:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint