Distributed Computing Theory

SERIES EDITOR: Jennifer Welch, Texas A&M; University
FOUNDING EDITOR: Nancy Lynch, Massachusetts Institute of Technology
The series publishes on topics pertaining to distributed computing theory. The scope largely follows the purview of premier information and computer science conferences, such as ACM PODC, DISC, SPAA, OPODIS, CONCUR, DialM-POMC, ICDCS, SODA, Sirocco, SSS, and related conferences. Potential topics include, but not are limited to: distributed algorithms and lower bounds, algorithm design methods, formal modeling and verification of distributed algorithms, and concurrent data structures.

Series ISSNs: 2155-1626 (print) and 2155-1634 (electronic)

Editor Bios

	Distributed Computing Pearls Gadi Taubenfeld The design of distributed systems where computing devices (computers, smartphones, sensors) interact with one another is one of the most challenging problems in computer science. This book is a gentle introduction to some of the most fundamental issu… Publication Date: May, 2018 Read More
	Decidability of Parameterized Verification Roderick Bloem, Swen Jacobs, Ayrat Khalimov, Igor Konnov, Helmut Veith, Josef Widder, Sasha Rubin In this book we consider the important case of M(n) being a concurrent system, where the number of replicated processes depends on the parameter n but each process is independent of n. Examples are cache coherenc… Publication Date: September, 2015 Read More
	Impossibility Results for Distributed Computing Hagit Attiya, Faith Ellen To understand the power of distributed systems, it is necessary to understand their inherent limitations: what problems cannot be solved in particular systems, or without sufficient resources (such as time or space). This book presents key techniques… Publication Date: 06/01/2014 Read More
	Distributed Graph Coloring Leonid Barenboim, Michael Elkin The focus of this monograph is on symmetry breaking problems in the message-passing model of distributed computing. In this model a communication network is represented by a n-vertex graph G = (V,E), whose vertices host autonomous processors. The pr… Publication Date: 07/01/2013 Read More
	Quorum Systems Marko Vukolic A quorum system is a collection of subsets of nodes, called quorums, with the property that each pair of quorums have a non-empty intersection. Quorum systems are the key mathematical abstraction for ensuring consistency in fault-tolerant and highly … Publication Date: 01/01/2012 Read More
	Link Reversal Algorithms Jennifer Welch, Jennifer Walter Link reversal is a versatile algorithm design technique that has been used in numerous distributed algorithms for a variety of problems. The common thread in these algorithms is that the distributed system is viewed as a graph, with vertices represen… Publication Date: 01/01/2011 Read More
	Distributed Computing by Oblivious Mobile Robots Paola Flocchini, Giuseppe Prencipe, Nicola Santoro The study of what can be computed by a team of autonomous mobile robots, originally started in robotics and AI, has become increasingly popular in theoretical computer science (especially in distributed computing), where it is now an integral part of… Publication Date: 01/01/2012 Read More
	Cooperative Task-Oriented Computing Chryssis Georgiou, Alexander Shvartsman Cooperative network supercomputing is becoming increasingly popular for harnessing the power of the global Internet computing platform. A typical Internet supercomputer consists of a master computer or server and a large number of computers called wo… Publication Date: 01/01/2011 Read More
	The Theory of Timed I/O Automata, Second Edition Dilsun Kaynar, Nancy Lynch, Roberto Segala, Frits Vaandrager This monograph presents the Timed Input/Output Automaton (TIOA) modeling framework, a basic mathematical framework to support description and analysis of timed (computing) systems. Timed systems are systems in which desirable correctness or performan… Publication Date: 01/01/2010 Read More
	The Mobile Agent Rendezvous Problem in the Ring Evangelos Kranakis, Danny Krizanc, Euripides Marcou Mobile agent computing is being used in fields as diverse as artificial intelligence, computational economics and robotics. Agents’ ability to adapt dynamically and execute asynchronously and autonomously brings potential advantages in terms of fault… Publication Date: 01/01/2010 Read More
	Principles of Transactional Memory Rachid Guerraoui, Michael Kapalka Transactional memory (TM) is an appealing paradigm for concurrent programming on shared memory architectures. With a TM, threads of an application communicate, and synchronize their actions, via in-memory transactions. Each transaction can perform an… Publication Date: 01/01/2010 Read More
	New Models for Population Protocols Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis Wireless sensor networks are about to be part of everyday life. Homes and workplaces capable of self-controlling and adapting air-conditioning for different temperature and humidity levels, sleepless forests ready to detect and react in case of a fir… Publication Date: 01/01/2011 Read More
	Fault-tolerant Agreement in Synchronous Message-passing Systems Michel Raynal Understanding distributed computing is not an easy task. This is due to the many facets of uncertainty one has to cope with and master in order to produce correct distributed software. A previous book Communication and Agreement Abstraction for Fault… Publication Date: 01/01/2010 Read More
	Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems Michel Raynal Understanding distributed computing is not an easy task. This is due to the many facets of uncertainty one has to cope with and master in order to produce correct distributed software. Considering the uncertainty created by asynchrony and process cra… Publication Date: 01/01/2010 Read More