PODC 2003:  Accepted Papers

Regular Papers

• Asynchronous Resource Discovery
  Ittai Abraham, Danny Dolev
• On implementing Omega with weak reliability and synchrony assumptions
  Marcos Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg
• On using network attached disks as shared memory
  Marcos Aguilera, Burkhard Englert, Eli Gafni
• Distributed Consensus in the presence of Sectional Faults
  Amitanand Aiyer, Sanketh Indarapu, Srinathan Kannan, Vinod Vaikuntanathan, C. Pandu Rangan
• Scaling Properties of the Internet Graph
  Aditya Akella, Shuchi Chawla, Arvind Kannan, Srinivasan Seshan
• Compact Roundtrip Routing with Topology-Independent Node Names
  Marta Arias, Lenore Cowen, A. Kofi Laing
• Adapting to a Reliable Network Path
  Baruch Awerbuch, Yishay Mansour
• Peer-to-Peer Systems for Prefix Search
  Baruch Awerbuch, Christian Scheideler
• Distributed Error Confinement
  Yossi Azar, Shay Kutten, Boaz Patt-Shamir
• Proactive Secure Message Transmission in Asynchronous Networks
  Michael Backes, Christian Cachin, Reto Strobl
• Efficient Reliable Communication over Partially Authenticated Networks
  Amos Beimel, Lior Malka
• An Asynchronous Protocol for Distributed Computation of RSA Inverses and its Applications
  Christian Cachin
• Scalable Public-Key Tracing and Revoking
  Yevgeniy Dodis, Nelly Fazio, Aggelos Kiayias, Moti Yung
• On a Network Creation Game
  Alex Fabrikant, Ankur Luthra, Elitza Maneva, Christos H. Papadimitriou, Scott Shenker
• Efficient Player-Optimal Protocols for Strong and Differential Consensus
  Matthias Fitzi, Juan Garay
• A New Approach to On-Demand Loop-Free Routing in Ad Hoc Networks
  J.J. Garcia-Luna-Aceves, Marc Mosko, Charles Perkins
• Algorithms for Dynamic Multicast Key Distribution Trees
  Justin Goshi, Richard Ladner
• Operation-Valency and the Cost of Coordination
  Danny Hendler, Nir Shavit
• Software Transactional Memory for Dynamic-sized Data Structures
  Maurice Herlihy, Victor Luchangco, Mark Moir, William Scherer
• Adaptive and Efficient Abortable Mutual Exclusion
  Prasad Jayanti
• Efficient and Practical Constructions of LL/SC Variables
  Prasad Jayanti, Srdjan Petrovic
• Fair Group Mutual Exclusion
  Prasad Jayanti, Srdjan Petrovic, King Tan
• Adaptive AIMD Congestion Control
  Alexander Kesselman, Yishay Mansour
• Broadcasting in undirected ad hoc radio networks
  Dariusz Kowalski, Andrzej Pelc
• Performing Work with Asynchronous Processors: Message-Delay-Sensitive Bounds
  Dariusz Kowalski, Alex Shvartsman
• Constant-Time Distributed Dominating Set Approximation
  Fabian Kuhn, Roger Wattenhofer
  Winner of Best Student-Paper Award
• Geometric Ad-Hoc Routing: Of Theory and Practice
  Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Zollinger
• Oblivious Signature-Based Envelope
  Ninghui Li, Wenliang Du, Dan Boneh
• Efficient revocation and threshold pairing based cryptosystems
  Benoît Libert, Jean-Jacques Quisquater
• A Work-Optimal Deterministic Algorithm for the Asynchronous Certified Write-All Problem
  Grzegorz Malewicz
• Low Degree Networks for Distributed Hashing
  Gurmeet Manku
• A Lattice-Theoretic Characterization of Safety and Liveness
  Panagiotis Manolios, Richard Trefler
• Scalable and Dynamic Quorum Systems
  Moni Naor, Udi Wieder
• Constructing Fair-Exchange Protocols for E-commerce Via Distributed Computation of RSA Signatures
  Jung Min Park, Edwin Chong, Howard Siegel, Indrajit Ray
• Split-Ordered Lists - Lock-free Extensible Hash Tables
  Ori Shalev, Nir Shavit

Brief Announcements

• Building Data Structures on Untrusted Peer-to-Peer Storage with Per-participant Logs
  Benjie Chen, Robert Morris
• Efficient Replication of Large Data Objects
  Rui Fan, Nancy Lynch
• An Overview of the Content-Addressable Network D2B
  Pierre Fraigniaud, Philippe Gauron
• Deterministic SkipNet
  Nicholas J.A. Harvey, J. Ian Munro
• Tight Bounds for k-Set Agreement with Limited-Scope Failure Detectors
  Maurice Herlihy, Lucia Penso
• An elegant cluster-based control mechanism for communication networks
  Srikant Kuppa, Mansi Ramakrishnan, Srinivasan Krishnamurthy, S. Venkatesan
• Early Decision Despite General Process Omission Failures
  Fabrice Le Fessant, Philippe Raipin Parvedy, Michel Raynal
• Impossibility Results for Concurrent Secure Two-Party Computation
  Yehuda Lindell
• Branching Time Refinement
  Panagiotis Manolios
• A Method for Exchanging Valuable Data: How to Realize Matching Oblivious Transfer
  Shinichiro Matsuo, Wakaha Ogata
• Extending SQL Security to Derived and Distributed Data
  Arnon Rosenthal, Edward Sciore
• Dynamic Group Communication
  Andre Schiper
• Efficient Flooding in Power-Law Networks
  Farnoush Banaei-Kashani, Cyrus Shahabi
• Efficient Perfect Communication over Synchronous Networks
  K. Srinathan, V. Vinod, C. Pandu Rangan
• Automatic Discovery of Mutual Exclusion Algorithms
  Gadi Taubenfeld, Yoah Bar-David
• Concurrent Counting is Harder than Queuing
  Srikanta Tirthapura

---

This page is maintained by Gil Neiger (gilATacm.org)