PODC Archives

ACM PODC Participants List

PODC@LISTSERV.ACM.ORG

Options: Use Forum View

Use Monospaced Font
Show Text Part by Default
Condense Mail Headers

Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Sender:
ACM PODC Participants List <[log in to unmask]>
X-To:
Date:
Thu, 20 May 2010 15:47:42 -0400
Content-Disposition:
inline
Reply-To:
Subject:
MIME-Version:
1.0
Message-ID:
Content-Transfer-Encoding:
quoted-printable
Content-Type:
text/plain; charset=ISO-8859-1; DelSp="Yes"; format="flowed"
From:
Parts/Attachments:
text/plain (72 lines)
PODC list subscribers,

You might be interested in a new monograph series I'm editing:  the  
Synthesis Lectures on Distributed Computing Theory, published by  
Morgan and Claypool.
This series will publish 50- to 150-page monographs on topics  
pertaining to any aspect of distributed computing theory, including  
distributed algorithms and lower bounds, algorithm design methods,  
formal modeling and verification of distributed algorithms, concurrent  
data structures, etc.

This series is the latest addition to the Synthesis Digital Library of  
Engineering and Computer Science.  Synthesis is intended to fill the  
gap between graduate textbooks and journals, providing focused  
coverage of fast-moving areas in an approachable, pedagogical fashion.  
  Use of these books as course texts is encouraged; and the texts may  
be downloaded without restriction at licensing institutions, or after  
a one-time fee at non-licensing schools. These books can also be  
purchased in print directly from the Morgan & Claypool Bookstore, or  
from Amazon and other booksellers worldwide.

Contact [log in to unmask] for desk copies.

Contact either [log in to unmask] or [log in to unmask] to  
inquire about contributing to this series as an author or reviewer.


Two books are already available:

Communication and Agreement Abstractions for Fault-Tolerant  
Asynchronous Distributed Systems (2010), by Michel Raynal.

The Mobile Agent Rendezvous Problem in the Ring (2010), by Evangelos  
Kranakis, Danny Krizanc, and Euripides Markou.


Upcoming titles include:

Algorithmic Foundations of Communication in Radio Networks, by Dariusz  
Kowalski.

Complexity of Cooperation in Distributed Systems, by Alexander A.  
Shvartsman and Chryssis Georgiou.

Fault-Tolerant Agreement in Synchronous Message-Passing Systems, by  
Michel Raynal.

Knowledge in Distributed Systems, by Yoram Moses

k-set Consensus and the Consensus Hierarchy, by Soma Chaudhuri and  
Jennifer Welch.

Link-Reversal Algorithms, by Jennifer Welch and Jennifer Walter.

Lower Bounds for Distributed Algorithms, by Faith Ellen and Hagit Attiya.

Randomized Smoothing Networks, by Marios Mavronicolas and Thomas Sauerwald.

Reductions and Simulations in Distributed Computing, by Sergio  
Rajsbaum and Corentin Travers.

The Theory of Timed I/O Automata, Second Edition, by Dilsun Kaynar,  
Nancy Lynch, Roberto Segala, and Frits Vaandrager.

Transactional Memory, Second Edition, by Tim Harris, Jim Larus, and  
Ravi Rajwar.

Transactional Memory: The Theory, by Rachid Guerraoui and Michal Kapalka.


Thanks, Nancy Lynch

ATOM RSS1 RSS2