default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID24th PODC 2005: Las Vegas, Nevada, USA
- Marcos Kawazoe Aguilera, James Aspnes:
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, Las Vegas, NV, USA, July 17-20, 2005. ACM 2005, ISBN 1-58113-994-2
Verification and security
- Cindy Eisner, Dana Fisman
, John Havlicek:
A topological characterization of weakness. 1-8 - Amos Korman, Shay Kutten, David Peleg:
Proof labeling schemes. 9-18 - Anurag Agarwal, Vijay K. Garg:
Efficient dependency tracking for relevant events in shared-memory systems. 19-28 - Jiangtao Li, Ninghui Li:
Policy-hiding access control in open environment. 29-38 - Gene Tsudik, Shouhuai Xu:
Brief announcement: a flexible framework for secret handshakes. 39 - Raj Kumar Rajendran, Vishal Misra, Dan Rubenstein:
Brief announcement: strong detection of misconfigurations. 40
Joint session
- Aleksandrs Slivkins:
Distance estimation and object location via rings of neighbors. 41-50 - Kamal Jain, László Lovász, Philip A. Chou:
Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding. 51-59
Distributed data structures
- Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer:
On the locality of bounded growth. 60-68 - Lars Arge, David Eppstein, Michael T. Goodrich:
Skip-webs: efficient distributed data structures for multi-dimensional data sets. 69-76 - Ruggero Morselli, Bobby Bhattacharjee, Aravind Srinivasan, Michael A. Marsh:
Efficient lookup on unstructured topologies. 77-86 - Anupam Gupta, Bruce M. Maggs, Florian Oprea, Michael K. Reiter:
Quorum placement in networks to minimize access delays. 87-96 - Mahadev Konar, Alexander E. Mohr:
Brief announcement: ring-like DHTs and the postage stamp problem. 97 - Chip Killian, Michael Vrable, Alex C. Snoeren, Amin Vahdat, Joseph Pasquale:
Brief announcement: the overlay network content distribution problem. 98
Optimization
- Jacomo Corbo, David C. Parkes:
The price of selfish behavior in bilateral network formation. 99-107 - Thomas Moscibroda, Roger Wattenhofer:
Facility location: distributed approximation. 108-117 - Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio:
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. 118-125 - David R. Karger, Evdokia Nikolova:
Brief announcement: on the expected overpayment of VCG mechanisms in large networks. 126 - Simon G. M. Koo, C. S. George Lee, Karthik N. Kannan:
Brief announcement: an incentive-compatible capacity assignment algorithm for bulk data distribution using P2P. 127 - Thomas E. Carroll, Daniel Grosu:
Brief announcement: distributed algorithmic mechanism design for scheduling. 128
Radio networks
- Leszek Gasieniec, David Peleg, Qin Xin:
Faster communication in known topology radio networks. 129-137 - Vartika Bhandari, Nitin H. Vaidya:
On reliable broadcast in a radio network. 138-147 - Thomas Moscibroda, Roger Wattenhofer:
Maximal independent sets in radio networks. 148-157 - Dariusz R. Kowalski:
On selection problem in radio networks. 158-166 - Vinod Vaikuntanathan:
Brief announcement: broadcast in radio networks in the presence of byzantine adversaries. 167 - Nishith Krishna, Marc Shapiro, Karthikeyan Bhargavan:
Brief announcement: exploring the consistency problem space. 168
Consensus
- Carole Delporte-Gallet, Hugues Fauconnier, Stephanie Lorraine Horn, Sam Toueg:
Fast fault-tolerant agreement algorithms. 169-178 - Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal:
The combined power of conditions and failure detectors to solve asynchronous set agreement. 179-188 - Jonathan Eisler, Vassos Hadzilacos, Sam Toueg:
The weakest failure detector to solve nonuniform consensus. 189-196 - Gregory V. Chockler, Murat Demirbas, Seth Gilbert, Calvin C. Newport, Tina Nolte:
Consensus and collision detectors in wireless Ad Hoc networks. 197-206 - Antonio Fernández, Ernesto Jiménez, Sergio Arévalo:
Brief announcement: minimal system conditions to implement unreliable failure detectors. 207 - Martin Hutle, Josef Widder:
Brief announcement: on the possibility and the impossibility of message-driven self-stabilizing failure detection. 208
Routing
- Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder:
Routing complexity of faulty networks. 209-217 - Xiaojie Gao, Leonard J. Schulman:
Feedback control for router congestion resolution. 218-226 - Eyal Gordon, Adi Rosén:
Competitive weighted throughput analysis of greedy protocols on DAGs. 227-236 - Hongwei Zhang, Anish Arora:
Brief announcement: continuous containment and local stabilization in path-vector routing. 237 - Lennart Meier, Lothar Thiele:
Brief announcement: gradient clock synchronization in sensor networks. 238 - W. Melody Moh, Marie Dumont, Teng-Sheng Moh, Takeo Hamada, Ching-Fong Su:
Brief announcement: evaluation of tree-based data gathering algorithms for wireless sensor networks. 239
Contention
- William N. Scherer III, Michael L. Scott:
Advanced contention management for dynamic software transactional memory. 240-248 - Phuong Hoai Ha, Philippas Tsigas, Mirjam Wattenhofer, Roger Wattenhofer:
Efficient multi-word locking using randomization. 249-257 - Rachid Guerraoui, Maurice Herlihy, Bastian Pochon:
Toward a theory of transactional contention managers. 258-264 - Shigang Chen, Yibei Ling:
Stochastic analysis of distributed deadlock scheduling. 265-273 - Gopal Pandurangan, GaHyun Park:
Brief announcement: analysis of a randomized contention-resolution protocol for distributed access. 274 - David Lin, Teng-Sheng Moh, W. Melody Moh:
Brief announcement: improved asynchronous group mutual exclusion in token-passing networks. 275
Joint session
- Simon Fischer, Berthold Vöcking:
Adaptive routing with stale information. 276-283 - Ara Hayrapetyan, Éva Tardos, Tom Wexler:
A network pricing game for selfish traffic. 284-291
Peer-to-peer
- André Allavena, Alan J. Demers, John E. Hopcroft:
Correctness of a gossip based membership protocol. 292-301 - George Giakkoupis, Vassos Hadzilacos:
A scheme for load balancing in heterogenous distributed hash tables. 302-311 - Rida A. Bazzi, Goran Konjevod:
On the establishment of distinct identities in overlay networks. 312-320 - Xinjie Li, Monica Brockmeyer:
Brief announcement: controlled quorum selection in arbitrary topologies. 321 - Laurent Fribourg, Stéphane Messika:
Brief announcement: coupling for Markov decision processes - application to self-stabilization with arbitrary schedulers. 322 - Shlomi Dolev, Limor Lahiani, Seth Gilbert, Nancy A. Lynch, Tina Nolte:
Brief announcement: virtual stationary automata for mobile networks. 323
Broadcast
- Alejandro Hevia, Daniele Micciancio:
Simultaneous broadcast revisited. 324-333 - Andrzej Pelc, David Peleg:
Feasibility and complexity of broadcasting with random transmission failures. 334-341 - Lakshminarayanan Subramanian, Randy H. Katz, Volker Roth, Scott Shenker, Ion Stoica:
Reliable broadcast in unknown fixed-identity networks. 342-351 - Michal Kouril, Jerome L. Paul:
Brief announcement: dynamic interoperable point-to-point connection of MPI implementations. 352 - Rida A. Bazzi, Yin Ding:
Brief announcement: wait-free implementation of multiple-writers/multiple-readers atomic byzantine data storage systems. 353 - Roy Friedman, Michel Raynal, Corentin Travers:
Brief announcement: abstractions for implementing atomic objects in dynamic systems. 354
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.
last updated on 2024-11-08 20:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
