Data structures and network algorithms
Data structures and network algorithms
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Data networks (2nd ed.)
Analysis of Backoff Protocols for Mulitiple AccessChannels
SIAM Journal on Computing
Fast distributed construction of small k-dominating sets and applications
Journal of Algorithms
Stochastic Contention Resolution With Short Delays
SIAM Journal on Computing
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Contention resolution with constant expected delay
Journal of the ACM (JACM)
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Journal of the ACM (JACM)
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Approximation algorithms
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
Distributed Algorithms
Regular Article: The Diameter of Sparse Random Graphs
Advances in Applied Mathematics
Universal Routing Strategies for Interconnection Networks
Universal Routing Strategies for Interconnection Networks
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Introduction to Algorithms
A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Building Low-Diameter P2P Networks
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
The Internet As a Large-Scale Complex System
The Internet As a Large-Scale Complex System
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
(Almost) tight bounds and existence theorems for confluent flows
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Sampling regular graphs and a peer-to-peer network
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Meet and merge: Approximation algorithms for confluent flows
Journal of Computer and System Sciences - Special issue on network algorithms 2005
The Confluent Capacity of the Internet: Congestion vs. Dilation
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Computer Networking: A Top-Down Approach (4th Edition)
Computer Networking: A Top-Down Approach (4th Edition)
Network synchronization with polylogarithmic overhead
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
A simple local-control approximation algorithm for multicommodity flow
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Simple distributed algorithms for approximating minimum steiner trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
A fast distributed approximation algorithm for minimum spanning trees
DISC'06 Proceedings of the 20th international conference on Distributed Computing
A survey and comparison of peer-to-peer overlay network schemes
IEEE Communications Surveys & Tutorials
Journal of the ACM (JACM)
| Hi-index | 0.00 |