Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID23rd PODC 2004: St. John's, Newfoundland, Canada
- Soma Chaudhuri, Shay Kutten:
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John's, Newfoundland, Canada, July 25-28, 2004. ACM 2004, ISBN 1-58113-802-4
Game theory
- Matt Lepinski, Silvio Micali, Chris Peikert, Abhi Shelat:
Completely fair SFE and coalition-safe cheap talk. 1-10 - Joan Feigenbaum, Rahul Sami, Scott Shenker
:
Mechanism design for policy routing. 11-20 - Byung-Gon Chun, Kamalika Chaudhuri, Hoeteck Wee, Marco Barreno, Christos H. Papadimitriou, John Kubiatowicz:
Selfish caching in distributed systems: a game-theoretic analysis. 21-30
Shared memory objects
- Simon Doherty, Maurice Herlihy, Victor Luchangco, Mark Moir:
Bringing practical lock-free synchronization to 64-bit applications. 31-39 - Hans-Juergen Boehm:
An almost non-blocking stack. 40-49
Shared momory objects
- Mikhail Fomitchev, Eric Ruppert:
Lock-free linked lists and skip lists. 50-59 - Hagit Attiya, Faith Ellen Fich, Yaniv Kaplan:
Lower bounds for adaptive collect and related objects. 60-69 - Alex Brodsky, Faith Ellen Fich:
Efficient synchronous snapshots. 70-79
Game theory
- Faith E. Fich, Danny Hendler, Nir Shavit:
On the inherent weakness of conditional synchronization primitives. 80-87 - Jeffrey Shneidman, David C. Parkes:
Specification faithfulness in networks with rational nodes. 88-97 - Artur Czumaj, Amir Ronen:
On the expected payment of mechanisms for task allocation. 98-106 - Magnús M. Halldórsson, Joseph Y. Halpern, Li (Erran) Li, Vahab S. Mirrokni:
On spectrum sharing games. 107-114
Internet applications
- James Aspnes, Jonathan Kirsch, Arvind Krishnamurthy:
Load balancing and locality in range-queriable data structures. 115-124 - Valerie King, Jared Saia:
Choosing a random peer. 125-130 - Paul W. Goldberg:
Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game. 131-140
Routing and self-stabilization
- Ittai Abraham, Dahlia Malkhi:
Compact routing on euclidian metrics. 141-149 - Christian Boulinier, Franck Petit, Vincent Villain:
When graph theory helps self-stabilization. 150-159 - Michael Elkin, Jian Zhang:
Efficient algorithms for constructing (1+, varepsilon;, beta)-spanners in the distributed and streaming models. 160-168
Networks graphs and network algorithms
- Pierre Fraigniaud, Cyril Gavoille, Christophe Paul:
Eclecticism shrinks even small worlds. 169-178 - Charles U. Martel, Van Nguyen:
Analyzing Kleinberg's (and other) small-world Models. 179-188 - Jie Gao, Li Zhang:
Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs. 189-196
Networks graphs and network algorithms
- Gurmeet Singh Manku:
Balanced binary trees for ID management and load balance in distributed hash tables. 197-205 - Pei Cao, Zhe Wang:
Efficient top-K query calculation in distributed networks. 206-215 - Indranil Gupta:
On the design of distributed protocols from differential equations. 216-225
Distributed applications, distributed memory, and internet applications
- Ittai Abraham, Gregory V. Chockler, Idit Keidar, Dahlia Malkhi:
Byzantine disk paxos: optimal resilience with byzantine shared memory. 226-235 - Partha Dutta, Rachid Guerraoui, Ron R. Levy, Arindam Chakraborty:
How fast can a distributed atomic read be? 236-245 - Haifeng Yu:
Signed quorum systems. 246-255
Wireless and sensors
- Amotz Bar-Noy, Yishay Mansour:
Competitive on-line paging strategies for mobile users under delay constraints. 256-265 - Bogdan S. Chlebus, Dariusz R. Kowalski:
A better wake-up in radio networks. 266-274 - Chiu-Yuen Koo:
Broadcast in radio networks tolerating byzantine adversarial behavior. 275-282
Wireless and sensors
- Boaz Patt-Shamir:
A note on efficient aggregate queries in sensor networks. 283-289 - Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta:
Computation in networks of passively mobile finite-state sensors. 290-299 - Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer:
What cannot be computed locally! 300-309
Wireless
- Gady Kozma, Zvi Lotker, Micha Sharir, Gideon Stupp:
Geometrically aware communication in random wireless networks. 310-319
Failure detectors
- Rui Fan, Nancy A. Lynch:
Gradient clock synchronization. 320-327 - Marcos Kawazoe Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg:
Communication-efficient leader election and consensus with limited link synchrony. 328-337
Failure detectors
- Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Vassos Hadzilacos, Petr Kouznetsov, Sam Toueg:
The weakest failure detectors to solve certain fundamental problems in distributed computing. 338-346 - Roger I. Khazan:
Group membership: a novel approach and the first single-round algorithm. 347-356 - Christian Cachin, Reto Strobl:
Asynchronous group key exchange with failures. 357-366
BA session: P2P
- Kirsten Hildrum, John Kubiatowicz, Jeremy Stribling:
Brief announcement: stretch between nearby peers. 367 - Sriram Ramabhadran, Sylvia Ratnasamy, Joseph M. Hellerstein, Scott Shenker:
Brief announcement: prefix hash tree. 368 - Alper Tugay Mizrak, Keith Marzullo, Stefan Savage:
Brief announcement: detecting malicious routers. 369
BA session: shared memory objects
- Matei David:
Brief announcement: a single enqueuer wait-free queue implementation. 370 - Rafael Ramírez, Juanjo Martinez:
Brief Announcement: constraint-based synchronization and verification of concurrent programs. 371 - Maged M. Michael:
Brief announcement: completing the lock-free dynamic cycle. 372 - Chris Purcell, Tim Harris:
Brief announcement: implementing multi-word atomic snapshots on current hardware. 373
BA session: internet applications
- Gal Badishi, Idit Keidar, Amir Sasson:
Brief announcement: exposing and eliminating vulnerabilities to denial of service attacks in secure gossip-based multicast. 374 - Anat Bremler-Barr, Hanoch Levy:
Brief announcement: spoofing prevention method. 375 - Xiaozhou Li, Jayadev Misra, C. Greg Plaxton:
Brief announcement: concurrent maintenance of rings. 376
BA session: routing and self-stabilization
- Lisa Higham, Lixiao Wang:
Brief announcement: self-stabilizing distance-d distinct labels via enriched fair composition. 377 - Murat Demirbas, Anish Arora, Tina Nolte, Nancy A. Lynch:
Brief announcement: STALK: a self-stabilizing hierarchical tracking service for sensor networks. 378 - Ariel Daliot, Danny Dolev, Hanna Parnas:
Brief announcement: linear time byzantine self-stabilizing clock synchronization. 379
BA session: networks graphs and network algorithms
- Kirsten Hildrum, Sean Ma, Satish Rao:
Brief announcement: randomized rumor spreading with fewer phone calls. 380 - Pierre Fransson, Lenka Carr-Motycková:
Brief announcement: an incremental algorithm for calculation of backup-paths in link-state networks. 381 - Kofi A. Laing:
Brief announcement: name-independent compact routing in trees. 382
BA session: P2P and network algorithms
- Karthik Lakshminarayanan, Daniel Adkins, Adrian Perrig, Ion Stoica:
Brief announcement: towards a secure indirection infrastructure. 383 - Idit Keidar, Roie Melamed:
Brief announcement: Trilix: a scalable unstructured lookup system for dynamic environments. 384 - Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Elad Schiller, Alexander A. Shvartsman, Jennifer L. Welch:
Brief announcement: virtual mobile nodes for mobile ad hoc networks. 385
BA session: distributed applications, distributed memory, and internet applications
- Rodrigo Rodrigues, Barbara Liskov:
Brief announcement: reconfigurable byzantine-fault-tolerant atomic memory. 386 - Srikanta Tirthapura:
Brief announcement: adaptive balancing networks. 387 - Weibin Zhao, Henning Schulzrinne:
Brief announcement: building an adaptive distributed web server system on the fly for handling web hotspots. 388 - Monica Brockmeyer, Chunbo Chu:
Brief announcement: the design of an internet-scale monitoring and assertion-checking infrastructure. 389 - Bhuvan Urgaonkar, Prashant J. Shenoy:
Brief announcement: Cataclysm: handling extreme overloads in internet services. 390
BA session: wireless and sensors
- Shlomi Dolev, Ted Herman, Limor Lahiani:
Brief announcement: polygonal broadcast, secret maturity and the firing sensors. 391 - Rodrigo Schmidt, Islene C. Garcia, Fernando Pedone, Luiz Eduardo Buzato:
Brief announcement: optimal asynchronous garbage collection for checkpointing protocols with rollback-dependency trackability. 392
BA session: wireless and sensor
- Amos Beimel, Shlomi Dolev, Noam Singer:
Brief announcement: RT oblivious erasure correcting. 393 - Claude Castelluccia, Stanislaw Jarecki, Gene Tsudik:
Brief announcement: secret handshakes from CA-oblivious encryption. 394
BA session: wireless and sensor
- Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Vittorio Scarano:
Brief announcement: degree: optimal deterministic routing for P2P systems. 395 - Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer:
Brief announcement: efficient clustering in unstructured radio networks. 396
BA session: wireless
- D. V. S. Ravikant, Muthuramakrishnan Venkitasubramaniam, V. Srikanth, K. Srinathan, C. Pandu Rangan:
Brief announcement: on the round complexity of distributed consensus over synchronous networks. 397
BA session: failure detectors
- Roy Friedman, Achour Mostéfaoui, Michel Raynal:
Brief announcement: veto number and the respective power of eventual failure detectors. 398 - Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal:
Brief announcement: the synchronous condition-based consensus hierarchy. 399 - Rida A. Bazzi, Yin Ding:
Brief announcement: efficient implementation of a byzantine data storage system. 400
BA session: failure detectors
- Fernando Pedone, André Schiper:
Brief announcement: on the inherent cost of generic broadcast. 401 - Christof Fetzer, Ulrich Schmid:
Brief announcement: on the possibility of consensus in asynchronous systems with finite average response times. 402
a service of 
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-04-22 20:01 CEST 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:
