How hard is it to marry at random? (On the approximation of the permanent)
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A random polynomial time algorithm for approximating the volume of convex bodies
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Token management schemes and random walks yield self-stabilizing mutual exclusion
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Random walks on weighted graphs, and applications to on-line algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Self-stabilizing algorithms for synchronous unidirectional rings
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Two-State Self-Stabilizing Algorithms for Token Rings
IEEE Transactions on Software Engineering
A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
The survival of the weakest in networks
Computational & Mathematical Organization Theory
On the self-stabilization of mobile robots in graphs
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Expansion and the cover time of parallel random walks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Brief paper: Quantized consensus in Hamiltonian graphs
Automatica (Journal of IFAC)
Topological adaptability for the distributed token circulation paradigm in faulty environment
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
The survival of the weakest in networks
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Random walks in distributed computing: a survey
IICS'04 Proceedings of the 4th international conference on Innovative Internet Community Systems
Discrete Green's functions and random walks on graphs
Journal of Combinatorial Theory Series A
Universal adaptive self-stabilizing traversal scheme: Random walk and reloading wave
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |