Sciweavers

254 search results - page 3 / 51
» Counting with Population Protocols
Sort
View
FCSC
2008
104views more  FCSC 2008»
13 years 11 months ago
On automatic verification of self-stabilizing population protocols
The population protocol model [2] has emerged as an elegant computation paradigm for describing mobile ad hoc networks, consisting of a number of mobile nodes that interact with e...
Jun Pang, Zhengqin Luo, Yuxin Deng
ICDCN
2009
Springer
14 years 5 months ago
Self-similar Functions and Population Protocols: A Characterization and a Comparison
Chandy et al. proposed the methodology of “self-similar algorithms” for distributed computation in dynamic environments. We further characterize the class of functions computab...
Swapnil Bhatia, Radim Bartos
WDAG
2007
Springer
79views Algorithms» more  WDAG 2007»
14 years 5 months ago
A Simple Population Protocol for Fast Robust Approximate Majority
We describe and analyze a 3-state one-way population protocol to compute approximate majority in the model in which pairs of agents are drawn uniformly at random to interact. Given...
Dana Angluin, James Aspnes, David Eisenstat
FC
2008
Springer
134views Cryptology» more  FC 2008»
14 years 18 days ago
Generalized Non-Interactive Oblivious Transfer Using Count-Limited Objects with Applications to Secure Mobile Agents
Oblivious transfer (OT) is a fundamental primitive used in many cryptographic protocols, including general secure function evaluation (SFE) protocols. However, interaction is a pri...
Vandana Gunupudi, Stephen R. Tate
CORR
2008
Springer
115views Education» more  CORR 2008»
13 years 12 months ago
Playing With Population Protocols
Population protocols have been introduced as a model of sensor networks consisting of very limited mobile agents with no control over their own movement: A collection of anonymous ...
Olivier Bournez, Jérémie Chalopin, J...