Complexity of network synchronization
Journal of the ACM (JACM)
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Randomized distributed shortest paths algorithms
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Knowledge and common knowledge in a byzantine environment: crash failures
Information and Computation
Decomposing graphs into regions of small diameter
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Locality in distributed graph algorithms
SIAM Journal on Computing
Routing with polynomial communication-space trade-off
SIAM Journal on Discrete Mathematics
Fast distributed network decompositions and covers
Journal of Parallel and Distributed Computing
A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
SIAM Journal on Computing
Fast distributed construction of small k-dominating sets and applications
Journal of Algorithms
Improvements in the time complexity of two message-optimal election algorithms
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computing almost shortest paths
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
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
Distributed vision with smart pixels
Proceedings of the twenty-fifth annual symposium on Computational geometry
Distributed verification and hardness of distributed approximation
Proceedings of the forty-third annual ACM symposium on Theory of computing
Fast computation of small cuts via cycle space sampling
ACM Transactions on Algorithms (TALG)
Navigating in a Graph by Aid of Its Spanning Tree Metric
SIAM Journal on Discrete Mathematics
Towards a complexity theory for local distributed computing
Journal of the ACM (JACM)
| Hi-index | 0.00 |
The article ''Replication and consistency in a distributed environment'' by Breitbart and Korth [Yuri Breitbart, Henry F. Korth, J. Comput. System Sci. 59 (1) (1999) 29-69] presents replication graphs as an efficient means to handle concurrency control ...