External Links

    Journal: Distributed Computing

    Volume 17, Issue 4

    291 -- 0Sergio Rajsbaum. Introduction
    293 -- 302Ninghui Li, Wenliang Du, Dan Boneh. Oblivious signature-based envelope
    303 -- 310Fabian Kuhn, Roger Wattenhofer. Constant-time distributed dominating set approximation
    311 -- 322Moni Naor, Udi Wieder. Scalable and dynamic quorum systems
    323 -- 347Yevgeniy Dodis, Nelly Fazio, Aggelos Kiayias, Moti Yung. Scalable public-key tracing and revoking

    Volume 17, Issue 3

    191 -- 207Yonatan Aumann, Michael A. Bender. Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler
    209 -- 221Hyunyoung Lee, Jennifer L. Welch. Randomized registers and iterative algorithms
    223 -- 236Joseph Y. Halpern, Aleta Ricciardi. A knowledge-theoretic analysis of uniform distributed coordination and failure detectors
    237 -- 249Miguel Correia, Nuno Ferreira Neves, Lau Cheuk Lung, Paulo Veríssimo. Low complexity Byzantine-resilient consensus
    251 -- 277Neeraj Mittal, Vijay K. Garg. Techniques and applications of computation slicing
    279 -- 290Anish Arora, Mikhail Nesterenko. Unifying stabilization and termination in message-passing systems

    Volume 17, Issue 2

    91 -- 106Joseph Y. Halpern, Yoram Moses. Using counterfactuals in knowledge-based programming
    107 -- 130Neeraj Mittal, Vijay K. Garg. Finding missing synchronization in a distributed computation using controlled re-execution
    131 -- 150Ajay D. Kshemkalyani. The power of logical clock abstractions
    151 -- 170Michalis Faloutsos, Mart Molle. A linear-time optimal-message distributed algorithm for minimum spanning trees
    171 -- 189Jennifer E. Walter, Jennifer L. Welch, Nancy M. Amato. Distributed reconfiguration of metamorphic robot chains

    Volume 17, Issue 1

    1 -- 20Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Matthieu Roy. Condition-based consensus solvability: a hierarchy of conditions and efficient protocols
    21 -- 31Darin Goldstein, Nick Meyer. The wake up and report problem is time-equivalent to the firing squad synchronization problem
    33 -- 46Panagiota Fatourou, Maurice Herlihy. Read-modify-write networks
    47 -- 63Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman. The complexity of synchronous iterative Do-All with crashes
    65 -- 76Marie Duflot, Laurent Fribourg, Claudine Picaronny. Randomized dining philosophers without fairness assumption
    77 -- 89Yishay Mansour, Boaz Patt-Shamir, Ofer Lapid. Optimal smoothing schedules for real-time streams
    runs on