Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta  Home/Search
Context Related
| yale.edu/homes/aspne...podc04passive.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: yale.edu/homes/aspnes...directory (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state agents in populations of finite but unbounded size. With a fairness condition on interactions, we define the concept of stable computation of a function or predicate, and give protocols that stably compute functions in a class including Boolean combinations of threshold-k, parity, majority, and simple arithmetic. We prove... (Update)
Cited by: More
Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, - Hong Jiang And (Correct)
Self-stabilizing Population Protocols - Dana Angluin James (2005) (Correct)
Active bibliography (related documents): More All
1.1: Computation in Networks of Passively Mobile Finite-State.. - Angluin, Aspnes.. (2004) (Correct)
0.9: Urn Automata - Angluin, Aspnes, Diamadi, Fischer.. (2003) (Correct)
0.3: Malicious Omissions and Errors in Answers to Membership.. - Martins, Sloan.. (1997) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.5: Fault-tolerant Routing in Peer-to-peer Systems - Aspnes, Diamadi, Shah (2002) (Correct)
0.2: On the Computational Complexity of Sensor Network.. - Aspnes, Goldenberg, Yang (2004) (Correct)
0.2: Towards Understanding the Predictability of Stock.. - Aspnes, Fischer.. (2000) (Correct)
Related documents from co-citation: More All
2: Fast and Lean Self-Stabilizing Asynchronous Protocols STOC (context) - Itkis, Levin
BibTeX entry: (Update)
Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: Twenty-Third ACM Symposium on Principles of Distributed Computing. (2004) 290--299 http://citeseer.ist.psu.edu/article/angluin04computation.html More
@misc{ angluin04computation,
author = "D. Angluin and J. Aspnes and Z. Diamadi and M. Fischer and R. Peralta",
title = "Computation in networks of passively mobile finite-state sensors",
text = "Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation
in networks of passively mobile finite-state sensors. In: Twenty-Third ACM
Symposium on Principles of Distributed Computing. (2004) 290--299",
year = "2004",
url = "citeseer.ist.psu.edu/article/angluin04computation.html" }
Citations (may not include all citations):254 Theoretical Computer Science (context) - Berry, Boudol et al. - 1992
211 TAG: a Tiny AGgregation service for ad-hoc sensor networks - Madden, Franklin et al. - 2002
170 Nondeterministic space is closed under complementation - Immerman - 1988
118 Mobility increases the capacity of ad hoc wireless networks - Grossglauser, Tse - 2002
103 On communicating finite-state machines (context) - Brand, Zafiropulo - 1983
85 usion: a scalable and robust communication paradigm for sens.. (context) - Intanagonwiwat, Govindan et al. - 2000
28 Decidability and complexity of Petri net problems-an introdu.. - Esparza - 1998
19 Bigraphical reactive systems: basic theory (context) - Milner - 2001
18 Collaborative signal and information processing: An informat.. - Zhao, Liu et al. - 2003
13 Decibility issues for Petri nets - a survey (context) - Esparza, Nielsen - 1994
7 Randomized non-sequential processes (context) - Volzer - 2001
5 Lightweight sensing and communication protocols for target e.. - Fang, Zhao et al. - 2003
4 A simple game for the study of trust in distributed systems (context) - Diamadi, Fischer - 2001
3 Prentice-Hall Series in Automatic Computation (context) - Minsky, Finite et al. - 1967
3 Technical Report YALEUDCTR (context) - Diamadi, Peralta et al. - 2003
3 Pacific Journal of Mathematics (context) - Ginsburg, Spanier et al. - 1966
2 and vector addition systems (context) - Ibarra, Dang et al. - 2004
Documents on the same site (http://cs-www.cs.yale.edu/homes/aspnes/directory.html): More
Fault-tolerant Routing in Peer-to-peer Systems - Aspnes, Diamadi, Shah (2003) (Correct)
A Theory of Competitive Analysis for Distributed Algorithms - Ajtai, Aspnes, Dwork, Waarts (2003) (Correct)
Load Balancing and Locality in Range-Queriable Data - Aspnes, Kirsch, Krishnamurthy (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC