Complexity of network synchronization
Journal of the ACM (JACM)
Matrix multiplication via arithmetic progressions
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Constructing a maximal independent set in parallel
SIAM Journal on Discrete Mathematics
A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
An optimal synchronizer for the hypercube
SIAM Journal on Computing
Compact distributed data structures for adaptive routing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Routing with polynomial communication-space trade-off
SIAM Journal on Discrete Mathematics
New sparseness results on graph spanners
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
On sparse spanners of weighted graphs
Discrete & Computational Geometry
A fast algorithm for constructing sparse Euclidean spanners
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Fast algorithms for constructing t-spanners and paths with stretch t
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
| Hi-index | 0.00 |
Given a connected graph G=(V,E) with n vertices, a subgraph G' is an approximate t-spanner of G if, for every u, vV, the distance between u and v in G' is at most f(t) times longer than the distance in G, where f(t) is a polynomial function of t and t = f(t)