default search action
18th DISC 2004: Amsterdam, The Netherlands
- Rachid Guerraoui:
Distributed Computing, 18th International Conference, DISC 2004, Amsterdam, The Netherlands, October 4-7, 2004, Proceedings. Lecture Notes in Computer Science 3274, Springer 2004, ISBN 3-540-23306-7 - Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal:
The Synchronous Condition-Based Consensus Hierarchy. 1-15 - Taisuke Izumi, Toshimitsu Masuzawa:
Synchronous Condition-Based Consensus Adapting to Input-Vector Legality. 16-29 - Eli Gafni:
Group-Solvability. 30-40 - Roy Friedman, Achour Mostéfaoui, Michel Raynal:
The Notion of Veto Number and the Respective Power of OP and OS to Solve One-Shot Agreement Problems. 41-55 - Gadi Taubenfeld:
The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms. 56-70 - Robert Danek, Vassos Hadzilacos:
Local-Spin Group Mutual Exclusion Algorithms. 71-85 - Yuh-Jzer Joung:
On Quorum Systems for Group Resources with Bounded Capacity. 86-101 - José Bacelar Almeida, Paulo Sérgio Almeida, Carlos Baquero:
Bounded Version Vectors. 102-116 - Edya Ladan-Mozes, Nir Shavit:
An Optimistic Approach to Lock-Free FIFO Queues. 117-131 - Matei David:
A Single-Enqueuer Wait-Free Queue Implementation. 132-143 - Maged M. Michael:
Practical Lock-Free and Wait-Free LL/SC/VL Implementations Using 64-Bit CAS. 144-158 - Hagit Attiya, Fabian Kuhn, Mirjam Wattenhofer, Roger Wattenhofer:
Efficient Adaptive Collect Using Randomization. 159-173 - William N. Scherer III, Michael L. Scott:
Nonblocking Concurrent Data Structures with Condition Synchronization. 174-187 - Danny Hendler, Yossi Lev, Nir Shavit:
Dynamic Memory ABP Work-Stealing. 188-200 - Laurent Fribourg, Stéphane Messika, Claudine Picaronny:
Coupling and Self-stabilization.. 201-215 - Philippe Duchon, Nicolas Hanusse, Sébastien Tixeuil:
Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings. 216-229 - Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Elad Schiller, Alexander A. Shvartsman, Jennifer L. Welch:
Virtual Mobile Nodes for Mobile Ad Hoc Networks. 230-244 - Costas Busch, Malik Magdon-Ismail, Fikret Sivrikaya, Bülent Yener:
Contention-Free MAC Protocols for Wireless Sensor Networks. 245-259 - James Aspnes, Faith E. Fich, Eric Ruppert:
Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems. 260-274 - Yitzhak Birk, Liran Liss, Assaf Schuster, Ran Wolff:
A Local Algorithm for Ad Hoc Majority Voting via Charge Fusion. 275-289 - Neeraj Mittal, Subbarayan Venkatesan, Sathya Peri:
Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies. 290-304 - Ittai Abraham, Cyril Gavoille, Dahlia Malkhi:
Routing with Improved Communication-Space Trade-Off. 305-319 - Xiaozhou Li, Jayadev Misra, C. Greg Plaxton:
Active and Concurrent Topology Maintenance. 320-334 - Mirjam Wattenhofer, Roger Wattenhofer:
Distributed Weighted Matching. 335-348 - Lei Guo, Song Jiang, Li Xiao, Xiaodong Zhang:
Exploiting Content Localities for Efficient Search in P2P Systems. 349-364 - Yon Dourisboure:
Compact Routing Schemes for Bounded Tree-Length Graphs and for k-Chordal Graphs. 365-378 - Ueli M. Maurer:
Towards a Theory of Consistency Primitives. 379-389 - Uri Nadav, Moni Naor:
Fault-Tolerant Storage in a Dynamic Environment. 390-404 - Rida A. Bazzi, Yin Ding:
Non-skipping Timestamps for Byzantine Data Storage Systems. 405-419 - Rida A. Bazzi, Goran Konjevod:
Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty. 420-434 - Eunjin Jung, Ehab S. Elmallah, Mohamed G. Gouda:
Optimal Dispersal of Certificate Chains. 435-449 - D. V. S. Ravikant, Muthuramakrishnan Venkitasubramaniam, V. Srikanth, K. Srinathan, C. Pandu Rangan:
On Byzantine Agreement over (2, 3)-Uniform Hypergraphs. 450-464
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.