Mikkel Thorup

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Theis Rauhe

> Home > Persons > Mikkel Thorup

Publications

2014
[j64]
- view
  authority control:
- export record
  dblp key:
  - journals/talg/AlstrupTGRZ14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/AlstrupTGRZ14
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)
2005
[j39]
- view
  authority control:
- export record
  dblp key:
  - journals/talg/AlstrupHRT05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/AlstrupHRT05
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)
[c68]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/AlstrupGRTZ05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/AlstrupGRTZ05
Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Uri Zwick:
Union-Find with Constant Time Deletions. ICALP 2005: 78-89
2002
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/cs-DS-0211010
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/cs-DS-0211010
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)

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.