A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Cost-sensitive analysis of communication protocols
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Coding theory, hypercube embeddings, and fault tolerance
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Concurrent online tracking of mobile users
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Adapting to asynchronous dynamic networks (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
New sparseness results on graph spanners
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Time optimal self-stabilizing synchronization
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Online tracking of mobile users
Journal of the ACM (JACM)
On Bufferless Routing of Variable Length Messages in Leveled Networks
IEEE Transactions on Computers
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Generating low-degree 2-spanners
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Static and kinetic geometric spanners with applications
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
(1 + &egr;&Bgr;)-spanner constructions for general graphs
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Computing almost shortest paths
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Synchronizing Hypercube Networks in the Presence of Faults
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Local majorities, coalitions and monopolies in graphs: a review
Theoretical Computer Science
Sparse distance preservers and additive spanners
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating k-Spanner Problems for k2
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Constructing the Spanners of Graphs in Parallel
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Approximation Algorithms for Edge-Dilation k-Center Problems
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
The Hardness of Approximating Spanner Problems
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A PTAS for the sparsest 2-spanner of 4-connected planar triangulations
Journal of Discrete Algorithms
Approximating Minimum Max-Stretch spanning Trees on unweighted graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
New constructions of (α, β)-spanners and purely additive spanners
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating k-spanner problems for k 2
Theoretical Computer Science
Computing almost shortest paths
ACM Transactions on Algorithms (TALG)
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
Random Structures & Algorithms
Dynamic algorithms for graph spanners
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Spanners for bounded tree-length graphs
Theoretical Computer Science
t-Spanners for metric space searching
Data & Knowledge Engineering
A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock
IEEE Transactions on Dependable and Secure Computing
Fast deterministic distributed algorithms for sparse spanners
Theoretical Computer Science
On the locality of distributed sparse spanner construction
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Combinatorial network abstraction by trees and distances
Theoretical Computer Science
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Fault-tolerant spanners for general graphs
Proceedings of the forty-first annual ACM symposium on Theory of computing
Small stretch (α,β)-spanners in the streaming model
Theoretical Computer Science
ACM Transactions on Algorithms (TALG)
As Good as It Gets: Competitive Fault Tolerance in Network Structures
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Small stretch spanners in the streaming model: new algorithms and experiments
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Local computation of nearly additive spanners
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Additive spanners and (α, β)-spanners
ACM Transactions on Algorithms (TALG)
Additive spanners in nearly quadratic time
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Sparse reliable graph backbones
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Lower bounds for local monotonicity reconstruction from transitive-closure spanners
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
f-sensitivity distance Oracles and routing schemes
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Spanners of bounded degree graphs
Information Processing Letters
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
ACM Transactions on Algorithms (TALG)
Approximation of minimum weight spanners for sparse graphs
Theoretical Computer Science
Connections between theta-graphs, delaunay triangulations, and orthogonal surfaces
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Fault Tolerant Spanners for General Graphs
SIAM Journal on Computing
Transitive-closure spanners: a survey
Property testing
Transitive-closure spanners: a survey
Property testing
Fault-tolerant spanners: better and simpler
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Journal of Computer and System Sciences
Improved approximation for the directed spanner problem
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Sparse reliable graph backbones
Information and Computation
Fast deterministic distributed algorithms for sparse spanners
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Small stretch spanners on dynamic graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Combinatorial network abstraction by trees and distances
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Fast information spreading in graphs with large weak conductance
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
An approximation algorithm for the edge-dilation k-center problem
Operations Research Letters
Label cover instances with large girth and the hardness of approximating basic k-spanner
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Deterministic distributed construction of linear stretch spanners in polylogarithmic time
DISC'07 Proceedings of the 21st international conference on Distributed Computing
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Improved distance oracles and spanners for vertex-labeled graphs
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Approximation algorithms for spanner problems and Directed Steiner Forest
Information and Computation
Fault tolerant additive spanners
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Multipath spanners via fault-tolerant spanners
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Spectral sparsification of graphs: theory and algorithms
Communications of the ACM
Small stretch pairwise spanners
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.03 |