I. Abraham, and D. Malkhi. Probabilistic quorums for dynamic systems.
Distributed Computing 18
, 2:113–124, (2005).
N. Alon, C. Avin, M. Koucký, G. Kozma, Z. Lotker, and M. R. Tuttle. Many random walks are faster than one. In
SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallel Algorithms and Architectures, Munich, Germany, June 14–16, 2008 F. M. auf der Heide and N. Shavit(Eds.,) ACM, pages 119–128, (2008).
A. Arora, S. Dolev, and M. Gouda. Maintaining digital clocks in step.
Parallel Processing Letters 1
, 1:11–18, (1991).
B. Awerbuch, and G. Varghese. Distributed program checking: a paradigm for building self-stabilizing distributed protocols (Extended Abstract). In:
Annual Symposium on Foundations of Computer Science (FOCS), San Juan, pages 258–267, 1991.
A. Beimel, and S. Dolev. Buses for anonymous message deliver.
, 16(1):25–39, 2003.
A. Cournier, S. Devismes, and V. Villain. Light enabling snap-stabilization of fundamental protocols.
ACM Transactions on Autonomous and Adaptive Systems
, 4(1):27, 2009.
A. Czumaj, and C. Sohler. Testing expansion in bounded-degree graphs. In
FOCS (2007), IEEE Computer Society, pages. 570–578.
E. W. Dijkstra. Self-stabilizing systems in spite of distributed control.
Communications ACM 17
, 11 643–644, 1974.
. MIT Press, Cambridge, MA, 2000.
S. Dolev, J.A. Garay, N. Gilboa, and V. Kolesnikov. In:
47th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, pages 1438–1445, 2009. Also brief Announcement in
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), pages 231–232, 2010.
S. Dolev, J. Garay, N. Gilboa, and V. Kolesnikov. Secret sharing Krohn-Rhodes: Private and perennial distributed computation. In:
Innovations in Computer Science (ICS), Beijing, China, January 2011.
S. Dolev, S. Gilbert, R. Guerraoui, F. Kuhn, and C. C. Newport. The wireless synchronization problem. In:
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), Portland, pages 190–199, 2009.
S. Dolev, S. Gilbert, R. Guerraoui, and C. C. Newport. Gossiping in a multi-channel radio network. In:
International Symposium on Distributed Computing (DISC). Workshop on Distributed Algorithms (WDAG), pages 208–222, 2007.
S. Dolev, S. Gilbert, R. Guerraoui, and C. C. Newport. Secure communication over radio channels. In:
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), Napoli, Italy, pages 105–114, 2008.
S. Dolev, S. Gilbert, N. A. Lynch, A. A. Shvartsman, and J. L. Welch. GeoQuorums: Implementing atomic memory in mobile
Distributed Computing 18
S. Dolev, S. Gilbert, L. Lynch, E. Schiller, A. A. Shvartsman, and J. L. Welch. Virtual mobile nodes for mobile Ad Hoc networks, In:
International Conference on Principles of DIStributed Computing, (DISC 2007), pages 230–244.
S. Dolev, S. Gilbert, E. Schiller, A. A. Shvartsman, and J. L. Welch. Autonomous virtual mobile nodes, In
DIALM-POMC (2005), pages 62–69.
S. Dolev, T. Herman, and L. Lahiani. Polygonal broadcast, secret maturity, and the firing sensors,
Ad Hoc Networks
, 4:447–486, 2006.
S. Dolev, L. Lahiani, and M. Yung. Secret swarm unitreactive k-secret sharing, In
INDOCRYPT, pages 123–137, 2007.
S. Dolev, K. D. Pradhan, and J. L. Welch. Modified tree structure for location management in mobile environments,
S. Dolev, M. Segal, H. Shpungin. Stretchable topology control, bounded-hop strong connectivity for flocking Swarms, 2009.
S. Dolev, E. Schiller, and J. L. Welch. Random walk for self-stabilizing group communication in ad hoc networks,
IEEE Transactions Mobile Computing 5, (7):893–905, 2006.
S. Dolev, and N. Tzachar. Empire of colonies: Self-stabilizing and self-organizing distributed algorithms,
Theoretical Computer Science
, Volume 410 (6–7) pages 514–532, Special issue of OPODIS06, 2009.
S. Dolev and N. Tzachar. Spanders: Distributed spanning expanders. In:
Proceedings of the 25th ACM Symposium on Applied Computing (SAC-SCS), Nagoya, Japan, pages 1309–1314, 2010.
S. Dolev, and N. Tzachar. SPANDERS: Distributed spanning expanders. TR 08-02, Department of Computer Science, Ben-Gurion University of the Negev, 2007.
O. Goldreich, and D. Ron. On testing expansion in bounded-degree graphs.
Electronic Colloquium on Computational Complexity (ECCC) 7:(20), 2000.
S. Hoory, N. Linial, and A. Wigderson. Expander graphs and their applications,
Bulletin of the AMS
, volume 43, 4:439–561, 2006.
S. Kale, and C. Seshadrhi. Testing expansion in bounded degree graphs. ECCC report TR07–076, 2007.
L. Lamport. Time, clocks, and the ordering of events in a distributed system.
Communications of the ACM 21, (7):558–565, 1978.
C. Law, and K.-Y. Siu. Distributed construction of random expander networks. In:
L. Lovasz. Random walks on graphs: A survey.
R. Motwani, and P. Raghavan.
Randomized Algorithms. Cambridge university press, Cambridge, 2006.
A. Nachmias, and A. Shapira. “Testing the expansion of graphs”. ECCC report TR07–118, 2007.
M.K. Reiter, A. Samar, and C. Wang. Distributed construction of a fault-tolerant network from a tree. In:
SRDS 05: Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems, IEEE Computer Society, Washington, DC, USA, pages 155–165, 2005.
S. A. Wright. “Registration of mobile packet data terminals after disaster,”,
US Patent 6157633, 1996.