22. PODC 2003:
Boston,
Massachusetts,
USA
PODC 2003,
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing (PODC 2003),
July 13-16,
2003,
Boston,
Massachusetts,
USA. ACM,
2003
- Ross J. Anderson:
Cryptography and competition policy: issues with 'trusted computing'.
3-10
Electronic Edition (ACM DL) BibTeX
- Nancy A. Lynch:
Working with mike on distributed computing theory, 1978--1992.
11
Electronic Edition (ACM DL) BibTeX
- Silvio Micali:
Simple and fast optimistic protocols for fair electronic exchange.
12-19
Electronic Edition (ACM DL) BibTeX
- Rebecca N. Wright:
Fischer's cryptographic protocols.
20-22
Electronic Edition (ACM DL) BibTeX
- Fabian Kuhn, Roger Wattenhofer:
Constant-time distributed dominating set approximation.
25-32
Electronic Edition (ACM DL) BibTeX
- Yossi Azar, Shay Kutten, Boaz Patt-Shamir:
Distributed error confinement.
33-42
Electronic Edition (ACM DL) BibTeX
- Marta Arias, Lenore Cowen, Kofi A. Laing:
Compact roundtrip routing with topology-independent node names.
43-52
Electronic Edition (ACM DL) BibTeX
- J. J. Garcia-Luna-Aceves, Marc Mosko, Charles E. Perkins:
A new approach to on-demand loop-free routing in ad hoc networks.
53-62
Electronic Edition (ACM DL) BibTeX
- Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Zollinger:
Geometric ad-hoc routing: of theory and practice.
63-72
Electronic Edition (ACM DL) BibTeX
- Dariusz R. Kowalski, Andrzej Pelc:
Broadcasting in undirected ad hoc radio networks.
73-82
Electronic Edition (ACM DL) BibTeX
- Srikant Kuppa, Mansi Ramakrishnan Thoppian, Srinivasan Krishnamurthy, Subbarayan Venkatesan:
Brief announcement: cluster-based control mechanism for communication networks.
83
Electronic Edition (ACM DL) BibTeX
- Danny Hendler, Nir Shavit:
Operation-valency and the cost of coordination.
84-91
Electronic Edition (ACM DL) BibTeX
- Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III:
Software transactional memory for dynamic-sized data structures.
92-101
Electronic Edition (ACM DL) BibTeX
- Ori Shalev, Nir Shavit:
Split-ordered lists: lock-free extensible hash tables.
102-111
Electronic Edition (ACM DL) BibTeX
- Srikanta Tirthapura:
Brief announcement: concurrent counting is harder than queuing.
112
Electronic Edition (ACM DL) BibTeX
- André Schiper:
Brief announcement: dynamic group communication.
113
Electronic Edition (ACM DL) BibTeX
- Moni Naor, Udi Wieder:
Scalable and dynamic quorum systems.
114-122
Electronic Edition (ACM DL) BibTeX
- Baruch Awerbuch, Christian Scheideler:
Peer-to-peer systems for prefix search.
123-132
Electronic Edition (ACM DL) BibTeX
- Gurmeet Singh Manku:
Routing networks for distributed hash tables.
133-142
Electronic Edition (ACM DL) BibTeX
- Ittai Abraham, Danny Dolev:
Asynchronous resource discovery.
143-150
Electronic Edition (ACM DL) BibTeX
- Pierre Fraigniaud, Philippe Gauron:
Brief announcement: an overview of the content-addressable network D2B.
151
Electronic Edition (ACM DL) BibTeX
- Nicholas J. A. Harvey, J. Ian Munro:
Brief announcement: deterministic skipnet.
152
Electronic Edition (ACM DL) BibTeX
- Christian Cachin:
An asynchronous protocol for distributed computation of RSA inverses and its applications.
153-162
Electronic Edition (ACM DL) BibTeX
- Benoît Libert, Jean-Jacques Quisquater:
Efficient revocation and threshold pairing based cryptosystems.
163-171
Electronic Edition (ACM DL) BibTeX
- Jung Min Park, Edwin K. P. Chong, Howard Jay Siegel:
Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures.
172-181
Electronic Edition (ACM DL) BibTeX
- Ninghui Li, Wenliang Du, Dan Boneh:
Oblivious signature-based envelope.
182-189
Electronic Edition (ACM DL) BibTeX
- Yevgeniy Dodis, Nelly Fazio, Aggelos Kiayias, Moti Yung:
Scalable public-key tracing and revoking.
190-199
Electronic Edition (ACM DL) BibTeX
- Yehuda Lindell:
Brief announcement: impossibility results for concurrent secure two-party computation.
200
Electronic Edition (ACM DL) BibTeX
- Shin'ichiro Matsuo, Wakaha Ogata:
Brief announcement: a method for exchanging valuable data: how to realize matching oblivious transfer.
201
Electronic Edition (ACM DL) BibTeX
- S. Amitanand, I. Sanketh, K. Srinathan, V. Vinod, C. Pandu Rangan:
Distributed consensus in the presence of sectional faults.
202-210
Electronic Edition (ACM DL) BibTeX
- Matthias Fitzi, Juan A. Garay:
Efficient player-optimal protocols for strong and differential consensus.
211-220
Electronic Edition (ACM DL) BibTeX
- Maurice Herlihy, Lucia Draque Penso:
tight bounds for k-set agreement with limited-scope failure detectors.
221
Electronic Edition (ACM DL) BibTeX
- Fabrice Le Fessant, Philippe Raipin Parvédy, Michel Raynal:
Brief announcement: early decision despite general process omission failures.
222
Electronic Edition (ACM DL) BibTeX
- Michael Backes, Christian Cachin, Reto Strobl:
Proactive secure message transmission in asynchronous networks.
223-232
Electronic Edition (ACM DL) BibTeX
- Amos Beimel, Lior Malka:
Efficient reliable communication over partially authenticated networks.
233-242
Electronic Edition (ACM DL) BibTeX
- Justin Goshi, Richard E. Ladner:
Algorithms for dynamic multicast key distribution trees.
243-251
Electronic Edition (ACM DL) BibTeX
- K. Srinathan, V. Vinod, C. Pandu Rangan:
Brief announcement: efficient perfectly secure communication over synchronous networks.
252
Electronic Edition (ACM DL) BibTeX
- Benjie Chen, Thomer M. Gil, Athicha Muthitacharoen, Robert Morris:
Brief announcement: building data structures on untrusted peer-to-peer storage with per-participant logs.
253
Electronic Edition (ACM DL) BibTeX
- Arnon Rosenthal, Edward Sciore:
Brief announcement: extending SQL access control to derived and distributed data.
254
Electronic Edition (ACM DL) BibTeX
- Grzegorz Malewicz:
A work-optimal deterministic algorithm for the asynchronous certified write-all problem.
255-264
Electronic Edition (ACM DL) BibTeX
- Dariusz R. Kowalski, Alexander A. Shvartsman:
Performing work with asynchronous processors: message-delay-sensitive bounds.
265-274
Electronic Edition (ACM DL) BibTeX
- Prasad Jayanti, Srdjan Petrovic, King Tan:
Fair group mutual exclusion.
275-284
Electronic Edition (ACM DL) BibTeX
- Prasad Jayanti, Srdjan Petrovic:
Efficient and practical constructions of LL/SC variables.
285-294
Electronic Edition (ACM DL) BibTeX
- Prasad Jayanti:
Adaptive and efficient abortable mutual exclusion.
295-304
Electronic Edition (ACM DL) BibTeX
- Yoah Bar-David, Gadi Taubenfeld:
Automatic discovery of mutual exclusion algorithms.
305
Electronic Edition (ACM DL) BibTeX
- Marcos Kawazoe Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg:
On implementing omega with weak reliability and synchrony assumptions.
306-314
Electronic Edition (ACM DL) BibTeX
- Marcos Kawazoe Aguilera, Burkhard Englert, Eli Gafni:
On using network attached disks as shared memory.
315-324
Electronic Edition (ACM DL) BibTeX
- Panagiotis Manolios, Richard J. Trefler:
A lattice-theoretic characterization of safety and liveness.
325-333
Electronic Edition (ACM DL) BibTeX
- Panagiotis Manolios:
Brief announcement: branching time refinement.
334
Electronic Edition (ACM DL) BibTeX
- Rui Fan, Nancy A. Lynch:
Brief announcement: efficient replication of large data objects.
335
Electronic Edition (ACM DL) BibTeX
- Farnoush Banaei Kashani, Cyrus Shahabi:
Brief announcement: efficient flooding in power-law networks.
336
Electronic Edition (ACM DL) BibTeX
- Aditya Akella, Shuchi Chawla, Arvind Kannan, Srinivasan Seshan:
Scaling properties of the Internet graph.
337-346
Electronic Edition (ACM DL) BibTeX
- Alex Fabrikant, Ankur Luthra, Elitza N. Maneva, Christos H. Papadimitriou, Scott Shenker:
On a network creation game.
347-351
Electronic Edition (ACM DL) BibTeX
- Alexander Kesselman, Yishay Mansour:
Adaptive AIMD congestion control.
352-359
Electronic Edition (ACM DL) BibTeX
- Baruch Awerbuch, Yishay Mansour:
Adapting to a reliable network path.
360-367
Electronic Edition (ACM DL) BibTeX
Copyright © Sat May 16 23:33:37 2009
by Michael Ley (ley@uni-trier.de)
