The following pages link to Mikkel Thorup (Q247166):
Displaying 50 items.
- Increasing internet capacity using local search (Q702469) (← links)
- On conservative extensions of syntax in system development (Q811131) (← links)
- All structured programs have small tree width and good register allocation (Q1271620) (← links)
- Fusion trees can be implemented with \(AC^0\) instructions only (Q1287094) (← links)
- On the agreement of many trees (Q1352115) (← links)
- (Q1386348) (redirect page) (← links)
- String matching in Lempel-Ziv compressed strings (Q1386349) (← links)
- Generalized dominators for structured programs (Q1578407) (← links)
- Disambiguating grammars by exclusion of sub-parse trees (Q1901714) (← links)
- Compact cactus representations of all non-trivial min-cuts (Q1983141) (← links)
- Algorithms and estimators for summarization of unaggregated data streams (Q2453543) (← links)
- Fast comparison of evolutionary trees (Q2508335) (← links)
- On sums of monotone random integer variables (Q2679641) (← links)
- An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees (Q2706115) (← links)
- (Q2721962) (← links)
- (Q2721967) (← links)
- Dynamic string searching (Q2768310) (← links)
- Construction and impromptu repair of an MST in a distributed network with \(o(m)\) communication (Q2796243) (← links)
- Rounding algorithms for a geometric embedding of minimum multiway cut (Q2819596) (← links)
- RAM-Efficient External Memory Sorting (Q2872113) (← links)
- Changing base without losing space (Q2875186) (← links)
- Speeding up dynamic shortest-path algorithms (Q2901004) (← links)
- Tabulation-based 5-independent hashing with applications to linear probing and second moment estimation (Q2903519) (← links)
- Discounted deterministic Markov decision processes and discounted all-pairs shortest paths (Q2930309) (← links)
- Time-space trade-offs for predecessor search (Q2931388) (← links)
- (Q2934638) (← links)
- Adjacency Labeling Schemes and Induced-Universal Graphs (Q2941558) (← links)
- Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time (Q2941562) (← links)
- From Independence to Expansion and Back Again (Q2941578) (← links)
- Black box for constant-time insertion in priority queues (note) (Q2944491) (← links)
- Maintaining information in fully dynamic trees with top trees (Q2944498) (← links)
- Melding priority queues (Q2944529) (← links)
- Coloring 3-colorable graphs with o(n 1/5 ) colors (Q2965508) (← links)
- Maximum Overhang (Q3107108) (← links)
- Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums (Q3115872) (← links)
- (Q3128909) (← links)
- Parallel Shortcutting of Rooted Trees (Q3128990) (← links)
- Finding the Maximum Subset with Bounded Convex Curvature (Q3132835) (← links)
- Undirected single-source shortest paths with positive integer weights in linear time (Q3158540) (← links)
- Coloring 3-Colorable Graphs with Less than <i>n</i> <sup>1/5</sup> Colors (Q3177885) (← links)
- Approximately Minwise Independence with Twisted Tabulation (Q3188889) (← links)
- Tight(er) worst-case bounds on dynamic searching and priority queues (Q3192001) (← links)
- Near-optimal fully-dynamic graph connectivity (Q3192002) (← links)
- Disks in Curves of Bounded Convex Curvature (Q3304736) (← links)
- Survivable IP network design with OSPF routing (Q3418122) (← links)
- On the Variance of Subset Sum Estimation (Q3527201) (← links)
- Compact Oracles for Approximate Distances Around Obstacles in the Plane (Q3527228) (← links)
- Oracles for Distances Avoiding a Failed Node or Link (Q3532564) (← links)
- Approximate distance oracles (Q3546311) (← links)
- Dynamic ordered sets with exponential search trees (Q3546335) (← links)
