An O(n2 log n) parallel max-flow algorithm
Journal of Algorithms
Efficiency of Synchronous Versus Asynchronous Distributed Systems
Journal of the ACM (JACM)
Synchronization in Distributed Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Graph Algorithms
Parallel graph processing using depth-first search and breadth-first search.
Parallel graph processing using depth-first search and breadth-first search.
A resilient distributed protocol for network synchronization
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
Solving minimum-cost flow problems by successive approximation
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Parallel symmetry-breaking in sparse graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
An optimal synchronizer for the hypercube
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Substituting for real time and common knowledge in asynchronous distributed systems
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
A tradeoff between space and efficiency for routing tables
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A lattice-structured proof of a minimum spanning
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
The power of multimedia: combining point-to point and multi-access networks
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
An Efficient Distributed Protocol for Finding Shortest Paths in Networks with Negative Weights
IEEE Transactions on Software Engineering
A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Simple constant-time consensus protocols in realistic failure models
Journal of the ACM (JACM)
Concurrency in heavily loaded neighborhood-constrained systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
The APRAM: incorporating asynchrony into the PRAM model
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Calling names in nameless networks
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Randomized distributed shortest paths algorithms
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A trade-off between information and communication in broadcast protocols
Journal of the ACM (JACM)
The inhibition spectrum and the achievement of causal consistency
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Cost-sensitive analysis of communication protocols
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Strategies for the Prevention of Communication Deadlocks in Distributed Parallel Programs
IEEE Transactions on Software Engineering
Shortest paths and loop-free routing in dynamic networks
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
The use of a synchronizer yields maximum computation rate in distributed networks
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Concurrent online tracking of mobile users
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Decomposing graphs into regions of small diameter
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Adapting to asynchronous dynamic networks (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Improved distributed algorithms for coloring and network decomposition problems
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
About logical clocks for distributed systems
ACM SIGOPS Operating Systems Review
The slide mechanism with applications in dynamic networks
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Fast randomized algorithms for distributed edge coloring
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
New sparseness results on graph spanners
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Asynchronous secure computation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Time optimal self-stabilizing synchronization
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
IEEE/ACM Transactions on Networking (TON)
Efficient asynchronous distributed symmetry breaking
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the average communication complexity of asynchronous distributed algorithms
Journal of the ACM (JACM)
Online tracking of mobile users
Journal of the ACM (JACM)
Topology aggregation for hierarchical routing in ATM networks
ACM SIGCOMM Computer Communication Review
Fast distributed construction of k-dominating sets and applications
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Bubbles: adaptive routing scheme for high-speed dynamic networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Local management of a global resource in a communication network
Journal of the ACM (JACM)
Fault-containing self-stabilizing algorithms
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
IEEE Transactions on Parallel and Distributed Systems
Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
The unified structure of consensus: a layered analysis approach
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Unifying synchronous and asynchronous message-passing models
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Comparison of initial conditions for distributed algorithms on anonymous networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Compact routing with minimum stretch
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Computing Global Functions in Asynchronous Distributed Systems with Perfect Failure Detectors
IEEE Transactions on Parallel and Distributed Systems
Phase Clocks for Transient Fault Repair
IEEE Transactions on Parallel and Distributed Systems
Static and kinetic geometric spanners with applications
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
An efficient algorithm for causal messages ordering
Proceedings of the 2001 ACM symposium on Applied computing
Computing almost shortest paths
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Testing the diameter of graphs
Random Structures & Algorithms
IEEE Transactions on Parallel and Distributed Systems
On the communication complexity of strong time-optimal distributed algorithms
Nordic Journal of Computing
Constructing the Spanners of Graphs in Parallel
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
New Perspectives in Distributed Computing
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Towards Formally Refining BSP Barrier s into Explicit Two-Sided Communications
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
MST construction in O(log log n) communication rounds
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
An efficient distributed algorithm for constructing small dominating sets
Distributed Computing - Special issue: Selected papers from PODC '01
Efficient Parallel and Distributed Topological Sort Algorithms
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
Real-Time Fault-Tolerant Atomic Broadcast
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Asynchronous Phase Synchronization in Uniform Unidirectional Rings
IEEE Transactions on Parallel and Distributed Systems
A faster distributed protocol for constructing a minimum spanning tree
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
When graph theory helps self-stabilization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
A better wake-up in radio networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
A distributed algorithm for constructing a minimum diameter spanning tree
Journal of Parallel and Distributed Computing
A self-stabilizing algorithm for the maximum flow problem
Distributed Computing
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the locality of bounded growth
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Facility location: distributed approximation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
A framework for time indexing in sensor networks
ACM Transactions on Sensor Networks (TOSN)
A new distributed QoS routing algorithm based on Fano's method
Computer Networks and ISDN Systems
Local approximation schemes for ad hoc and sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
The inhibition spectrum and the achievement of causal consistency
Distributed Computing
Distributed shortest-path protocols for time-dependent networks
Distributed Computing
Computing almost shortest paths
ACM Transactions on Algorithms (TALG)
Spanners and emulators with sublinear distance errors
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Cell-centric heuristics for the classification of cellular automata
Parallel Computing
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Scalable algorithms for global snapshots in distributed systems
Proceedings of the 20th annual international conference on Supercomputing
A faster distributed protocol for constructing a minimum spanning tree
Journal of Computer and System Sciences
Research note: From ♢W to Ω: A simple bounded quiescent reliable broadcast-based transformation
Journal of Parallel and Distributed Computing
Distributed approximation of capacitated dominating sets
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
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 randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Improved sparse covers for graphs excluding a fixed minor
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Distributed network monitoring and multicommodity flows: a primal-dual approach
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Bringing order to BGP: decreasing time and message complexity
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock
IEEE Transactions on Dependable and Secure Computing
Ultra-low-dimensional embeddings for doubling metrics
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Streaming algorithm for graph spanners---single pass and constant processing time per edge
Information Processing Letters
Fast deterministic distributed algorithms for sparse spanners
Theoretical Computer Science
Applying static network protocols to dynamic networks
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Optimal maintenance of a spanning tree
Journal of the ACM (JACM)
Ad hoc networks beyond unit disk graphs
Wireless Networks
On the locality of distributed sparse spanner construction
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Space efficient and time optimal distributed BFS tree construction
Information Processing Letters
The Iterated Restricted Immediate Snapshot Model
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
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
r3: Resilient Random Regular Graphs
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Combinatorial network abstraction by trees and distances
Theoretical Computer Science
Approximating Shortest Paths in Graphs
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
An Efficient Index Dissemination in Unstructured Peer-to-Peer Networks
IEICE - Transactions on Information and Systems
Bringing order to BGP: Decreasing time and message complexity
Computer Networks: The International Journal of Computer and Telecommunications Networking
Small stretch (α,β)-spanners in the streaming model
Theoretical Computer Science
Tight bounds for clock synchronization
Proceedings of the 28th ACM symposium on Principles of distributed computing
Weak graph colorings: distributed algorithms and applications
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
ACM Transactions on Algorithms (TALG)
Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound
Theoretical Computer Science
A new distributed QoS routing algorithm based on Fano's method
Computer Networks: The International Journal of Computer and Telecommunications Networking
A cluster-tree protocol for reliable multicasting
Computer Networks: The International Journal of Computer and Telecommunications Networking
Tight bounds for clock synchronization
Journal of the ACM (JACM)
Local Algorithms: Self-stabilization on Speed
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Ultra-low-dimensional embeddings for doubling metrics
Journal of the ACM (JACM)
A simple linear time algorithm for computing a (2k - 1)-spanner of o(n1+1/k) size in weighted graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A method for evaluating efficiency of protocols on the asynchronous shared-state model
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
The Journal of Supercomputing
Small stretch spanners in the streaming model: new algorithms and experiments
ESA'07 Proceedings of the 15th annual European conference on Algorithms
O(log n)-time overlay network construction from graphs with out-degree 1
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Separability to help parallel simulation of distributed computations
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Data aggregation in sensor networks: no more a slave to routing
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
ACM Transactions on Algorithms (TALG)
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Local computation of nearly additive spanners
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Distributed discovery of large near-cliques
DISC'09 Proceedings of the 23rd international conference on Distributed computing
On distributed time-dependent shortest paths over duty-cycled wireless sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Brief announcement: asynchronous bounded expected delay networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Algorithms and theory of computation handbook
Fast distributed graph partition and application
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
ACM Transactions on Algorithms (TALG)
A fault-resistant asynchronous clock function
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Approximation of minimum weight spanners for sparse graphs
Theoretical Computer Science
Formalization and correctness of the PALS architectural pattern for distributed real-time systems
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Self-stabilizing Byzantine asynchronous unison
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
An efficient decentralized algorithm for the distributed trigger counting problem
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Toward more localized local algorithms: removing assumptions concerning global knowledge
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
On the performance of a retransmission-based synchronizer
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
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
Simple distributed algorithms for approximating minimum steiner trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Distributed spatial clustering in sensor networks
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Combinatorial network abstraction by trees and distances
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Self-stabilizing synchronization in mobile sensor networks with covering
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Research note: Self-stabilizing byzantine asynchronous unison
Journal of Parallel and Distributed Computing
Formalization and correctness of the PALS architectural pattern for distributed real-time systems
Theoretical Computer Science
Scalable load-distance balancing
DISC'07 Proceedings of the 21st international conference on Distributed Computing
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
Brief announcement: the degrading effect of forgetting on a synchronizer
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems
Universally composable synchronous computation
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Stone age distributed computing
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Parallel graph decompositions using random shifts
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Transience bounds for distributed algorithms
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
On the performance of a retransmission-based synchronizer
Theoretical Computer Science
Symmetry breaking depending on the chromatic number or the neighborhood growth
Theoretical Computer Science
| Hi-index | 0.01 |
The problem of simulating a synchronous network by an asynchronous network is investigated. A new simulation technique, referred to as a synchronizer, which is a new, simple methodology for designing efficient distributed algorithms in asynchronous networks, is proposed. The synchronizer exhibits a trade-off between its communication and time complexities, which is proved to be within a constant factor of the lower bound.