| Exploring Gafni's reduction land : from [Omega][superscript k] to wait-free adaptive (2p - [p/k])-renaming via [kappa]-set agreement | p. 1 |
| Renaming in message passing systems with Byzantine failures | p. 16 |
| Built-in coloring for highly-concurrent doubly-linked lists | p. 31 |
| Fault-tolerant and self-stabilizing mobile robots gathering | p. 46 |
| Fast Computation by population protocols with a leader | p. 61 |
| On self-stabilizing search trees | p. 76 |
| Efficient dynamic aggregation | p. 90 |
| Groupings and pairings in anonymous networks | p. 105 |
| A new proof of the GHS minimum spanning tree algorithm | p. 120 |
| A knowledge-based analysis of global function computation | p. 136 |
| Checking a multithreaded algorithm with [superscript +]CAL | p. 151 |
| Capturing register and control dependence in memory consistency models with applications to the Itanium architecture | p. 164 |
| Conflict detection and validation strategies for software transactional memory | p. 179 |
| Transactional locking II | p. 194 |
| Less is more : consensus gaps between restricted and unrestricted objects | p. 209 |
| One-step consensus solvability | p. 224 |
| Time-bounded task-PIOAs : a framework for analyzing security protocols | p. 238 |
| On consistency of encrypted files | p. 254 |
| Agreeing to agree : conflict resolution for optimistically replicated data | p. 269 |
| A lazy snapshot algorithm with eager validation | p. 284 |
| Bounded wait-free f-resilient atomic Byzantine data storage systems for an unbounded number of clients | p. 299 |
| Time and communication efficient consensus for crash failures | p. 314 |
| Subconsensus tasks : renaming is weaker than set agreement | p. 329 |
| Exact distance labelings yield additive-stretch compact routing schemes | p. 339 |
| A fast distributed approximation algorithm for minimum spanning trees | p. 355 |
| On randomized broadcasting in power law networks | p. 370 |
| Distributed approximation algorithms in unit-disk graphs | p. 385 |
| The weakest failure detectors to boost obstruction-freedom | p. 399 |
| Fully-adaptive algorithms for long-lived renaming | p. 413 |
| Constructing shared objects that are both robust and high-throughput | p. 428 |
| Byzantine and multi-writer K-quorums | p. 443 |
| On minimizing the number of ADMs in a general topology optical network | p. 459 |
| Robust network supercomputing with malicious processes | p. 474 |
| Distributed resource allocation in stream processing systems | p. 489 |
| Low-latency atomic broadcast in the presence of contention | p. 505 |
| Oblivious gradient clock synchronization | p. 520 |
| Abortable and query-abortable objects | p. 534 |
| Fault-tolerant semifast implementations of atomic read/write registers | p. 537 |
| Convergence analysis of scalable gossip protocols | p. 540 |
| Computing automatically the stabilization time against the worst and the best schedules | p. 543 |
| Many slices are better than one | p. 548 |
| On augmented graph navigability | p. 551 |
| Decoupled quorum-based Byzantine-resilient coordination in open distributed systems | p. 554 |
| Optimistic algorithms for partial database replication | p. 557 |
| Performance analysis of cyclon, an inexpensive membership management for unstructured P2P overlays | p. 560 |
| Decentralized, connectivity-preserving, and cost-effective structured overlay maintenance | p. 563 |
| Monitoring of linear distributed computations | p. 566 |
| Communication-optimal implementation of failure detector class [actual symbol not reproducible][actual symbol not reproducible] | p. 569 |
| Synchronous distributed algorithms for node discovery and configuration in multi-channel cognitive radio networks | p. 572 |
| Table of Contents provided by Blackwell. All Rights Reserved. |