The following pages link to Mikkel Thorup (Q247166):
Displaying 14 items.
- Integer priority queues with decrease key in constant time and the single source shortest paths problem (Q5901085) (← links)
- Integer priority queues with decrease key in constant time and the single source shortest paths problem (Q5917573) (← links)
- Intra-domain traffic engineering with shortest path routing protocols (Q5919993) (← links)
- How to cut corners and get bounded convex curvature (Q6045790) (← links)
- Fully dynamic exact edge connectivity in sublinear time (Q6538528) (← links)
- Reconstructing the tree of life (fitting distances by tree metrics) (invited paper) (Q6544058) (← links)
- Minimum-cost paths for electric cars (Q6545135) (← links)
- Understanding the moments of tabulation hashing via chaoses (Q6560870) (← links)
- Fully dynamic connectivity in \(O(\log n(\log\log n)^2)\) amortized expected time (Q6566592) (← links)
- Dijkstra's single source shortest path algorithm (Q6624624) (← links)
- Optimal decremental connectivity in non-sparse graphs (Q6637992) (← links)
- A sparse Johnson-Lindenstrauss transform using fast hashing (Q6638079) (← links)
- Fully dynamic min-cut of superconstant size in subpolynomial time (Q6645468) (← links)
- Better coloring of 3-colorable graphs (Q6731006) (← links)
