The following pages link to Mikkel Thorup (Q247166):
Displaying 50 items.
- (Q4829020) (← links)
- (Q4829021) (← links)
- Shortcutting Planar Digraphs (Q4862749) (← links)
- (Q4875169) (← links)
- (Q4875208) (← links)
- Efficient Preprocessing of Simple Binary Pattern Forests (Q4881410) (← links)
- Decremental Dynamic Connectivity (Q4935307) (← links)
- (Q4952657) (← links)
- (Q4952658) (← links)
- Union-Find with Constant Time Deletions (Q4962164) (← links)
- On the <i>k</i> -Independence Required by Linear Probing and Minwise Independence (Q4962205) (← links)
- Roundtrip spanners and roundtrip routing in directed graphs (Q4962734) (← links)
- Compact name-independent routing with minimum stretch (Q4962742) (← links)
- Power of \(d\) choices with simple tabulation (Q5002669) (← links)
- Generalized dominators for structured programs (Q5030185) (← links)
- Efficient preprocessing of simple binary pattern forests (Q5054774) (← links)
- Optimal pointer algorithms for finding nearest common ancestors in dynamic trees (Q5054814) (← links)
- (Q5075822) (← links)
- (Q5091256) (← links)
- Finding cores of limited length (Q5096925) (← links)
- Fast hashing with strong concentration bounds (Q5145010) (← links)
- Three-in-a-tree in near linear time (Q5145012) (← links)
- Faster Algorithms for Edge Connectivity via Random 2-Out Contractions (Q5146849) (← links)
- Approximate distance oracles (Q5175966) (← links)
- Fully-dynamic min-cut (Q5175972) (← links)
- Fast fencing (Q5230320) (← links)
- Tabulation Based 5-Universal Hashing and Linear Probing (Q5233597) (← links)
- Non-empty Bins with Simple Tabulation Hashing (Q5236342) (← links)
- Algorithm Theory - SWAT 2004 (Q5315375) (← links)
- Algorithm Theory - SWAT 2004 (Q5315390) (← links)
- A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing (Q5318276) (← links)
- The Power of Simple Tabulation Hashing (Q5395685) (← links)
- (Q5417708) (← links)
- Don't rush into a union (Q5419126) (← links)
- Compact oracles for reachability and approximate distances in planar digraphs (Q5435672) (← links)
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity (Q5441357) (← links)
- Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? (Q5449576) (← links)
- An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms (Q5463421) (← links)
- Algorithms – ESA 2004 (Q5464614) (← links)
- The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable (Q5494963) (← links)
- Bottom-k and priority sampling, set similarity and subset sums with minimal independence (Q5495807) (← links)
- (Q5501240) (← links)
- (Q5501316) (← links)
- (Q5501808) (← links)
- (Q5501813) (← links)
- Automata, Languages and Programming (Q5716780) (← links)
- Automata, Languages and Programming (Q5716834) (← links)
- Twisted Tabulation Hashing (Q5741724) (← links)
- More Compact Oracles for Approximate Distances in Undirected Planar Graphs (Q5741748) (← links)
- Intra-domain traffic engineering with shortest path routing protocols (Q5900973) (← links)
