Complexity of network synchronization
Journal of the ACM (JACM)
A fast and simple randomized parallel algorithm for maximal matching
Information Processing Letters
A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
Deterministic coin tossing with applications to optimal parallel list ranking
Information and Control
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Adapting to asynchronous dynamic networks (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Locality in distributed graph algorithms
SIAM Journal on Computing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
SIAM Journal on Computing
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Communications of the ACM
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
A new kind of science
Distributed Algorithms
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
Computation in networks of passively mobile finite-state sensors
Distributed Computing - Special issue: PODC 04
Network synchronization with polylogarithmic overhead
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
The Dynamics of Probabilistic Population Protocols
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Distributed (δ+1)-coloring in linear (in δ) time
Proceedings of the forty-first annual ACM symposium on Theory of computing
Weak graph colorings: distributed algorithms and applications
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Slotted programming for sensor networks
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
About randomised distributed graph colouring and graph partition algorithms
Information and Computation
Deploying wireless networks with beeps
DISC'10 Proceedings of the 24th international conference on Distributed computing
Distributed coloring in Õ (√log n) Bit Rounds
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Nanonetworks: a new frontier in communications
Communications of the ACM
Deterministic Distributed Vertex Coloring in Polylogarithmic Time
Journal of the ACM (JACM)
Distributed coloring depending on the chromatic number or the neighborhood growth
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Beeping a maximal independent set
DISC'11 Proceedings of the 25th international conference on Distributed computing
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
A new model that depicts a network of randomized finite state machines operating in an asynchronous environment is introduced. This model, that can be viewed as a hybrid of the message passing model and cellular automata is suitable for applying the distributed computing lens to the study of networks of sub-microprocessor devices, e.g., biological cellular networks and man-made nano-networks. Although the computation and communication capabilities of each individual device in the new model are, by design, much weaker than those of an abstract computer, we show that some of the most important and extensively studied distributed computing problems can still be solved efficiently.