376 search results - page 40 / 76 » Self-Stabilizing Graph Protocols |
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
Robotic swarms, like all spatial computers, are a challenging environment for the execution of distributed consensus algorithms due to their scale, diameter, and frequent failures...
ISI
2007
Springer
13 years 8 months ago
2007
Springer
ABSTRACT. Grids have become very complex. It makes the deployment and maintenance of systems a difficult task requiring lots of efforts from administrators. We believe that peer-t...
IPSN
2011
Springer
13 years 8 days ago
2011
Springer
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
SODA
2012
ACM
11 years 11 months ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
STOC
2006
ACM
14 years 9 months ago
2006
ACM
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...