Abstract is missing.
- The Next 700 BFT ProtocolsRachid Guerraoui. 1 [doi]
- On Replication of Software Transactional MemoriesLuís Rodrigues. 2-4 [doi]
- Write Markers for Probabilistic Quorum SystemsMichael G. Merideth, Michael K. Reiter. 5-21 [doi]
- Byzantine Consensus with Unknown ParticipantsEduardo Adílio Pelinson Alchieri, Alysson Neves Bessani, Joni da Silva Fraga, Fabíola Greve. 22-40 [doi]
- With Finite Memory Consensus Is Easier Than Reliable BroadcastCarole Delporte-Gallet, Stéphane Devismes, Hugues Fauconnier, Franck Petit, Sam Toueg. 41-57 [doi]
- Group RenamingYehuda Afek, Iftah Gamzu, Irit Levy, Michael Merritt, Gadi Taubenfeld. 58-72 [doi]
- Global Static-Priority Preemptive Multiprocessor Scheduling with Utilization Bound 38 Björn Andersson. 73-88 [doi]
- Deadline Monotonic Scheduling on Uniform MultiprocessorsSanjoy K. Baruah, Joël Goossens. 89-104 [doi]
- A Comparison of the M-PCP, D-PCP, and FMLPon LITMUSRTBjörn B. Brandenburg, James H. Anderson. 105-124 [doi]
- A Self-stabilizing Marching Algorithm for a Group of Oblivious RobotsYuichi Asahiro, Satoshi Fujita, Ichiro Suzuki, Masafumi Yamashita. 125-144 [doi]
- Fault-Tolerant Flocking in a k-Bounded Asynchronous SystemSamia Souissi, Yan Yang, Xavier Défago. 145-163 [doi]
- Bounds for Deterministic Reliable Geocast in Mobile Ad-Hoc NetworksAntonio Fernández Anta, Alessia Milani. 164-183 [doi]
- Degree 3 Suffices: A Large-Scale Overlay for P2P NetworksMarcin Bienkowski, André Brinkmann, Miroslaw Korzeniowski. 184-196 [doi]
- On the Time-Complexity of Robust and Amnesic StorageDan Dobre, Matthias Majuntke, Neeraj Suri. 197-216 [doi]
- Graph Augmentation via Metric EmbeddingEmmanuelle Lebhar, Nicolas Schabanel. 217-225 [doi]
- A Lock-Based STM Protocol That Satisfies Opacity and ProgressivenessDamien Imbs, Michel Raynal. 226-245 [doi]
- The 0-1-Exclusion Families of TasksEli Gafni. 246-258 [doi]
- Interval Tree ClocksPaulo Sérgio Almeida, Carlos Baquero, Victor Fonte. 259-274 [doi]
- Ordering-Based Semantics for Software Transactional MemoryMichael F. Spear, Luke Dalessandro, Virendra J. Marathe, Michael L. Scott. 275-294 [doi]
- CQS-Pair: Cyclic Quorum System Pair for Wakeup Scheduling in Wireless Sensor NetworksShouwen Lai, Bo Zhang, Binoy Ravindran, Hyeonjoong Cho. 295-310 [doi]
- Impact of Information on the Complexity of Asynchronous Radio BroadcastingTiziana Calamoneri, Emanuele G. Fusco, Andrzej Pelc. 311-330 [doi]
- Distributed Approximation of Cellular CoverageBoaz Patt-Shamir, Dror Rawitz, Gabriel Scalosub. 331-345 [doi]
- Fast Geometric Routing with Concurrent Face TraversalThomas Clouser, Mark Miyashita, Mikhail Nesterenko. 346-362 [doi]
- Optimal Deterministic Remote Clock Estimation in Real-Time SystemsHeinrich Moser, Ulrich Schmid. 363-387 [doi]
- Power-Aware Real-Time Scheduling upon Dual CPU Type Multiprocessor PlatformsJoël Goossens, Dragomir Milojevic, Vincent Nélis. 388-407 [doi]
- Revising Distributed UNITY Programs Is NP-CompleteBorzoo Bonakdarpour, Sandeep S. Kulkarni. 408-427 [doi]
- On the Solvability of Anonymous Partial Grids Exploration by Mobile RobotsRoberto Baldoni, François Bonnet, Alessia Milani, Michel Raynal. 428-445 [doi]
- Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a RingRalf Klasing, Adrian Kosowski, Alfredo Navarra. 446-462 [doi]
- Rendezvous of Mobile Agents When Tokens Fail AnytimeShantanu Das, Matús Mihalák, Rastislav Srámek, Elias Vicari, Peter Widmayer. 463-480 [doi]
- Solving Atomic Multicast When Groups CrashNicolas Schiper, Fernando Pedone. 481-495 [doi]
- A Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe ConvergenceSayaka Kamei, Hirotsugu Kakugawa. 496-511 [doi]
- Leader Election in Extremely Unreliable Rings and Complete NetworksStefan Dobrev, Rastislav Kralovic, Dana Pardubská. 512-526 [doi]
- Toward a Theory of Input Acceptance for Transactional MemoriesVincent Gramoli, Derin Harmanci, Pascal Felber. 527-533 [doi]
- Geo-registers: An Abstraction for Spatial-Based Distributed ComputingMatthieu Roy, François Bonnet, Leonardo Querzoni, Silvia Bonomi, Marc-Olivier Killijian, David Powell. 534-537 [doi]
- Evaluating a Data Removal Strategy for Grid Environments Using Colored Petri NetsNikola Trcka, Wil M. P. van der Aalst, Carmen Bratosin, Natalia Sidorova. 538-541 [doi]
- Load-Balanced and Sybil-Resilient File Search in P2P NetworksHyeong S. Kim, Eunjin Jung, Heon Young Yeom. 542-545 [doi]
- Computing and Updating the Process Number in TreesDavid Coudert, Florian Huc, Dorian Mazauric. 546-550 [doi]
- Redundant Data Placement Strategies for Cluster Storage EnvironmentsAndré Brinkmann, Sascha Effert. 551-554 [doi]
- An Unreliable Failure Detector for Unknown and Mobile NetworksPierre Sens, Luciana Arantes, Mathieu Bouillaguet, Véronique Simon, Fabíola Greve. 555-559 [doi]
- Efficient Large Almost Wait-Free Single-Writer Multireader Atomic RegistersAndrew Lutomirski, Victor Luchangco. 560-563 [doi]
- A Distributed Algorithm for Resource Clustering in Large Scale PlatformsOlivier Beaumont, Nicolas Bonichon, Philippe Duchon, Lionel Eyraud-Dubois, Hubert Larchevêque. 564-567 [doi]
- Reactive Smart Buffering Scheme for Seamless Handover in PMIPv6Hyon-Young Choi, Kwang-Ryoul Kim, Hyo-Beom Lee, Sung-Gi Min. 568-571 [doi]
- Uniprocessor EDF Scheduling with Mode ChangeBjörn Andersson. 572-577 [doi]