Showing 5 publications
- 📄 Journal Article 🔒 Closed
Linear-time approximation schemes for clustering problems in any dimensions
Journal of the ACM , Vol. 57 (2) - 📄 Journal Article 🔒 Closed
Approximate distance oracles for unweighted graphs in expected O ( n 2 ) time
ACM Transactions on Algorithms , Vol. 2 (4) - 📄 Journal Article 🔒 Closed
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
Random Structures and Algorithms , Vol. 30 (4) - 📄 Conference Paper 🔓 Bronze
A Simple Linear Time Algorithm for Computing a (2k — 1)-Spanner of O(n 1+1/k ) Size in Weighted Graphs
Lecture notes in computer science - 📄 Journal Article 🔒 Closed
Towards a theory of cache-efficient algorithms
Journal of the ACM , Vol. 49 (6)