The following pages link to Mikkel Thorup (Q247166):
Displaying 50 items.
- Priority sampling for estimation of arbitrary subset sums (Q3546350) (← links)
- Equivalence between priority queues and sorting (Q3546352) (← links)
- Learn More, Sample Less: Control of Volume and Variance in Network Measurement (Q3546821) (← links)
- (Q3549696) (← links)
- Higher Lower Bounds for Near-Neighbor and Further Rich Problems (Q3558020) (← links)
- (Q3579383) (← links)
- Space efficient dynamic stabbing with fast queries (Q3581262) (← links)
- OPT versus LOAD in dynamic storage allocation (Q3581277) (← links)
- Worst-case update times for fully-dynamic all-pairs shortest paths (Q3581384) (← links)
- Spanners and emulators with sublinear distance errors (Q3581551) (← links)
- On the k-Independence Required by Linear Probing and Minwise Independence (Q3587421) (← links)
- Faster Regular Expression Matching (Q3638033) (← links)
- On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics) (Q4229424) (← links)
- (Q4234121) (← links)
- (Q4250200) (← links)
- (Q4250223) (← links)
- Dominators in Linear Time (Q4268860) (← links)
- (Q4281646) (← links)
- Sparse Dynamic Programming for Evolutionary-Tree Comparison (Q4337441) (← links)
- Sampling to provide or to bound: With applications to fully dynamic graph algorithms (Q4372787) (← links)
- (Q4373690) (← links)
- (Q4411340) (← links)
- (Q4471292) (← links)
- (Q4471360) (← links)
- Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees (Q4485190) (← links)
- Floats, Integers, and Single Source Shortest Paths (Q4485191) (← links)
- On RAM Priority Queues (Q4507340) (← links)
- (Q4535022) (← links)
- Randomized Sorting in O(nloglogn) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations (Q4538079) (← links)
- (Q4542523) (← links)
- (Q4553236) (← links)
- Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time (Q4554344) (← links)
- Sample(x)=(a*x<=t) Is a Distinguisher with Probability 1/8 (Q4562282) (← links)
- Minimizing diameters of dynamic trees (Q4571959) (← links)
- The Power of Two Choices with Simple Tabulation (Q4575695) (← links)
- (Q4584896) (← links)
- (Q4601879) (← links)
- (Q4606317) (← links)
- Faster worst case deterministic dynamic connectivity (Q4606324) (← links)
- (Q4607874) (← links)
- (Q4607920) (← links)
- (Q4607938) (← links)
- Adjacency Labeling Schemes and Induced-Universal Graphs (Q4610450) (← links)
- Deterministic Edge Connectivity in Near-Linear Time (Q4625670) (← links)
- (Q4633877) (← links)
- (Q4633909) (← links)
- (Q4633941) (← links)
- <i>OPT</i>Versus<i>LOAD</i>in Dynamic Storage Allocation (Q4651485) (← links)
- Quick <i>k</i>-Median, <i>k</i>-Center, and Facility Location for Sparse Graphs (Q4651542) (← links)
- (Q4818842) (← links)
