Searching for authors named "Mikkel Thorup" – sorted by Relevance.
-
Decremental Dynamic Connectivity
- Decremental dynamic connectivity Mikkel Thorup May 20, 1996 Abstract We consider Las Vegas
- Cited by 12 (0 self) – Add To MetaCart
-
Controlled Grammatic Ambiguity
- Controlled Grammatic Ambiguity MIKKEL THORUP University of Copenhagen A new approach to ambiguity
- Cited by 8 (0 self) – Add To MetaCart
-
Randomized sorting in O(n log log n) time and linear space using addition, shift, and bit-wise boolean operations
- using addition, shift, and bit-wise boolean operations by Mikkel Thorup 1 Department of Computer
- Cited by 9 (2 self) – Add To MetaCart
-
Firing Games
- Firing Games Mikkel Thorup y University of Copenhagen September 11, 1996 Abstract This is a
- Cited by 1 (0 self) – Add To MetaCart
-
Floats, Integers, and Single Source Shortest Paths
- Floats, Integers, and Single Source Shortest Paths Mikkel Thorup Department of Computer Science
- Cited by 16 (2 self) – Add To MetaCart
-
On RAM priority queues
- Chapter 1 On RAM priority queues Mikkel Thorup y Abstract Priority queues are some of the most
- Cited by 67 (9 self) – Add To MetaCart
-
Integer Priority Queues with Decrease Key in . . .
- . Copyright 2003 ACM 1-58113-674-9/03/0006 ...$5.00. Mikkel Thorup AT&T Labs— Research, Shannon Laboratory
- Cited by 10 (1 self) – Add To MetaCart
-
Time-space trade-offs for predecessor search
- ¸scu mip@(email omitted); Mikkel Thorup mthorup@(email omitted); February 1, 2008 Abstract We develop a new
- Cited by 10 (1 self) – Add To MetaCart
-
Higher lower bounds for near-neighbor and further rich problems
- Higher Lower Bounds for Near-Neighbor and Further Rich Problems Mihai Pǎtra¸scu mip@(email omitted); Mikkel
- Cited by 6 (0 self) – Add To MetaCart
-
Undirected Single Source Shortest Paths in Linear Time
- Undirected Single Source Shortest Paths in Linear Time Mikkel Thorup Department of Computer
- Cited by 38 (2 self) – Add To MetaCart

