Online tracking of mobile users
Journal of the ACM (JACM)
A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock
IEEE Transactions on Dependable and Secure Computing
Space efficient and time optimal distributed BFS tree construction
Information Processing Letters
Theory of communication networks
Algorithms and theory of computation handbook
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
ACM Transactions on Algorithms (TALG)
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
A simple randomized k-local election algorithm for local computations
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Distributed computing of efficient routing schemes in generalized chordal graphs
Theoretical Computer Science
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
Stone age distributed computing
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
The synchronizer is a simulation methodology for simulating a synchronous network by an asynchronous one, thus enabling the execution of a synchronous algorithm on an asynchronous network. Previously known synchronizers require each processor in the network to participate in each pulse of the synchronization process. The resulting communication overhead depends linearly on the number n of network nodes. A synchronizer with overhead only polylogarithmically dependent on n is introduced. This synchronizer can also be realized with polylog(n) space. The polylog-overhead synchronizer is based on involving only the relevant portions of the network in the synchronization process.