Table of Contents

• Working with mike on distributed computing theory, 1978--1992Nancy A. Lynch. 11 [doi]
• Simple and fast optimistic protocols for fair electronic exchangeSilvio Micali. 12-19 [doi]
• Fischer s cryptographic protocolsRebecca N. Wright. 20-22 [doi]
• Constant-time distributed dominating set approximationFabian Kuhn, Roger Wattenhofer. 25-32 [doi]
• Distributed error confinementYossi Azar, Shay Kutten, Boaz Patt-Shamir. 33-42 [doi]
• Compact roundtrip routing with topology-independent node namesMarta Arias, Lenore Cowen, Kofi A. Laing. 43-52 [doi]
• A new approach to on-demand loop-free routing in ad hoc networksJ. J. Garcia-Luna-Aceves, Marc Mosko, Charles E. Perkins. 53-62 [doi]
• Geometric ad-hoc routing: of theory and practiceFabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Zollinger. 63-72 [doi]
• Broadcasting in undirected ad hoc radio networksDariusz R. Kowalski, Andrzej Pelc. 73-82 [doi]
• Brief announcement: cluster-based control mechanism for communication networksSrikant Kuppa, Mansi Ramakrishnan Thoppian, Srinivasan Krishnamurthy, Subbarayan Venkatesan. 83 [doi]
• Operation-valency and the cost of coordinationDanny Hendler, Nir Shavit. 84-91 [doi]
• Software transactional memory for dynamic-sized data structuresMaurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III. 92-101 [doi]
• Split-ordered lists: lock-free extensible hash tablesOri Shalev, Nir Shavit. 102-111 [doi]
• Brief announcement: concurrent counting is harder than queuingSrikanta Tirthapura. 112 [doi]
• Brief announcement: dynamic group communicationAndré Schiper. 113 [doi]
• Scalable and dynamic quorum systemsMoni Naor, Udi Wieder. 114-122 [doi]
• Peer-to-peer systems for prefix searchBaruch Awerbuch, Christian Scheideler. 123-132 [doi]
• Routing networks for distributed hash tablesGurmeet Singh Manku. 133-142 [doi]
• Asynchronous resource discoveryIttai Abraham, Danny Dolev. 143-150 [doi]
• Brief announcement: an overview of the content-addressable network D2BPierre Fraigniaud, Philippe Gauron. 151 [doi]
• Brief announcement: deterministic skipnetNicholas J. A. Harvey, J. Ian Munro. 152 [doi]
• An asynchronous protocol for distributed computation of RSA inverses and its applicationsChristian Cachin. 153-162 [doi]
• Efficient revocation and threshold pairing based cryptosystemsBenoît Libert, Jean-Jacques Quisquater. 163-171 [doi]
• Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signaturesJung Min Park, Edwin K. P. Chong, Howard Jay Siegel. 172-181 [doi]
• Oblivious signature-based envelopeNinghui Li, Wenliang Du, Dan Boneh. 182-189 [doi]
• Scalable public-key tracing and revokingYevgeniy Dodis, Nelly Fazio, Aggelos Kiayias, Moti Yung. 190-199 [doi]
• Brief announcement: impossibility results for concurrent secure two-party computationYehuda Lindell. 200 [doi]
• Brief announcement: a method for exchanging valuable data: how to realize matching oblivious transferShin ichiro Matsuo, Wakaha Ogata. 201 [doi]
• Distributed consensus in the presence of sectional faultsS. Amitanand, I. Sanketh, K. Srinathan, V. Vinod, C. Pandu Rangan. 202-210 [doi]
• Efficient player-optimal protocols for strong and differential consensusMatthias Fitzi, Juan A. Garay. 211-220 [doi]
• tight bounds for k-set agreement with limited-scope failure detectorsMaurice Herlihy, Lucia Draque Penso. 221 [doi]
• Brief announcement: early decision despite general process omission failuresFabrice Le Fessant, Philippe Raipin Parvédy, Michel Raynal. 222 [doi]
• Proactive secure message transmission in asynchronous networksMichael Backes, Christian Cachin, Reto Strobl. 223-232 [doi]
• Efficient reliable communication over partially authenticated networksAmos Beimel, Lior Malka. 233-242 [doi]
• Algorithms for dynamic multicast key distribution treesJustin Goshi, Richard E. Ladner. 243-251 [doi]
• Brief announcement: efficient perfectly secure communication over synchronous networksK. Srinathan, V. Vinod, C. Pandu Rangan. 252 [doi]
• Brief announcement: building data structures on untrusted peer-to-peer storage with per-participant logsBenjie Chen, Thomer M. Gil, Athicha Muthitacharoen, Robert Morris. 253 [doi]
• Brief announcement: extending SQL access control to derived and distributed dataArnon Rosenthal, Edward Sciore. 254 [doi]
• A work-optimal deterministic algorithm for the asynchronous certified write-all problemGrzegorz Malewicz. 255-264 [doi]
• Performing work with asynchronous processors: message-delay-sensitive boundsDariusz R. Kowalski, Alexander A. Shvartsman. 265-274 [doi]
• Fair group mutual exclusionPrasad Jayanti, Srdjan Petrovic, King Tan. 275-284 [doi]
• Efficient and practical constructions of LL/SC variablesPrasad Jayanti, Srdjan Petrovic. 285-294 [doi]
• Adaptive and efficient abortable mutual exclusionPrasad Jayanti. 295-304 [doi]
• Automatic discovery of mutual exclusion algorithmsYoah Bar-David, Gadi Taubenfeld. 305 [doi]
• On implementing omega with weak reliability and synchrony assumptionsMarcos Kawazoe Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg. 306-314 [doi]
• On using network attached disks as shared memoryMarcos Kawazoe Aguilera, Burkhard Englert, Eli Gafni. 315-324 [doi]
• A lattice-theoretic characterization of safety and livenessPanagiotis Manolios, Richard J. Trefler. 325-333 [doi]
• Brief announcement: branching time refinementPanagiotis Manolios. 334 [doi]
• Brief announcement: efficient replication of large data objectsRui Fan, Nancy A. Lynch. 335 [doi]
• Brief announcement: efficient flooding in power-law networksFarnoush Banaei Kashani, Cyrus Shahabi. 336 [doi]
• Scaling properties of the Internet graphAditya Akella, Shuchi Chawla, Arvind Kannan, Srinivasan Seshan. 337-346 [doi]
• On a network creation gameAlex Fabrikant, Ankur Luthra, Elitza N. Maneva, Christos H. Papadimitriou, Scott Shenker. 347-351 [doi]
• Adaptive AIMD congestion controlAlexander Kesselman, Yishay Mansour. 352-359 [doi]
• Adapting to a reliable network pathBaruch Awerbuch, Yishay Mansour. 360-367 [doi]