22. PODC 2003: Boston, Massachusetts, USA

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

Last update Fri May 25 08:32:34 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page