Distributed Computing
A modular approach to shared-memory consensus, with applications to the probabilistic-write model
How to meet when you forget: log-space rendezvous in arbitrary graphs
RMR-efficient implementations of comparison primitives using read and write operations
Special section with selected papers from PODC 2010