This work doesn't have a description yet. Can you add one?
Subjects
| Edition | Availability |
|---|---|
1
Proceedings of the Twenty-Second Annual ACM Symposium on Principles of Distributed Computing: PODC 2003 : Boston, Massachusetts, USA, July 13-16, 2003
2003, Association for Computing Machinery
in English
1581137087 9781581137088
|
aaaa
|
Book Details
Table of Contents
Cryptography and Competition Policy - Issues with 'Trusted Computing' -- Ross Anderson
Working With Mike on Distributed Computing theory, 1978-1992 -- Nancy Lynch
Simple and Fast Optimistic Protocols for Fair Electronic Exchange -- Silvio Micali
Fischer's Cryptographic Protocols -- Rebecca N. Wright
Constant-Time Distributed Dominating Set Approximation -- Fabian Kuhn and Roger Wattenhofer
Distributed Error Confinement -- Yossi Azar, Shay Kutten and Boaz Patt-Shamir
Compact Roundtrip Routing with Topology-Independent Node Names -- Marta Arias, Lenore Cowen and A. Kofi Laing
A New Approach to On-Demand Loop-Free Routing in Ad Hoc Networks -- J. J. Garcia-Luna-Aceves, Marc Mosko and Charles Perkins
Geometric Ad-Hoc Routing: Of Theory and Practice -- Fabian Kuhn, Roger Wattenhofer, Yan Zhang and Aaron Zollinger
Broadcasting in Undirected Ad Hoc Radio Networks -- Dariusz Kowalski and Andrzej Pelc
Cluster-Based Control Mechanism for Communication Networks -- Srikant Kuppa, Mansi Ramakrishnan, Srinivasan Krishnamurthy and S. Venkatesan
Operation-Valency and the Cost of Coordination -- Danny Hendler and Nir Shavit
Software Transactional Memory for Dynamic-sized Data Structures -- Maurice Herlihy, Victor Luchangco, Mark Moir and William Scherer
Split-Ordered Lists - Lock-free Resizable Hash Tables -- Ori Shalev and Nir Shavit
Concurrent Counting is Harder than Queuing -- Srikanta Tirthapura
Dynamic Group Communication -- Andre Schiper
Scalable and Dynamic Quorum Systems -- Moni Naor and Udi Wieder
Peer-to-Peer Systems for Prefix Search -- Baruch Awerbuch and Christian Scheideler
Routing Networks for Distributed Hash Tables -- Gurmeet Singh Manku
Asynchronous Resource Discovery -- Ittai Abraham and Danny Dolev
An Overview of the Content-Addressable Network D2B -- Pierre Fraigniaud and Philippe Gauron
Deterministic SkipNet -- Nicholas J. A. Harvey and J. Ian Munro
An Asynchronous Protocol for Distributed Computation of RSA Inverses and its Applications -- Christian Cachin
Efficient Revocation And Threshold Pairing Based Cryptosystems -- Benoit Libert and Jean-Jacques Quisquater
Constructing Fair-Exchange Protocols for E-commerce Via Distributed Computation of RSA Signatures -- Jung Min Park, Edwin Chong, Howard Siegel and Indrajit Ray
Oblivious Signature-Based Envelope -- Ninghui Li, Wenliang Du and Dan Boneh
Scalable Public-Key Tracing and Revoking -- Yevgeniy Dodis, Nelly Fazio, Aggelos Kiayias and Moti Yung
Impossibility Results for Concurrent Secure Two-Party Computation -- Yehuda Lindell
A Method for Exchanging Valuable Data -- Shinichiro Matsuo and Wakaha Ogata
Distributed Consensus in the Presence of Sectional Faults -- Amitanand Aiyer, Sanketh Indarapu, Srinathan Kannan, Vinod Vaikuntanathan and C. Pandu Rangan
Efficient Player-Optimal Protocols for Strong and Differential Consensus -- Matthias Fitzi and Juan Garay
Tight Bounds for k-Set Agreement with Limited-Scope Failure Detectors -- Maurice Herlihy and Lucia Penso
Early Decision Despite General Process Failures -- Fabrice Le Fessant, Philippe Raipin Parvedy and Michel Raynal
Proactive Secure Message Transmission in Asynchronous Networks -- Michael Backes, Christian Cachin and Reto Strobl
Efficient Reliable Communication over Partially Authenticated Networks -- Amos Beimel and Lior Malka
Algorithms for Dynamic Multicast Key Distribution Trees -- Justin Goshi and Richard Ladner
Efficient Perfect Communication over Synchronous Networks -- K. Srinathan, V. Vinod and C. Pandu Rangan
Building Data Structures on Untrusted Peer-to-Peer Storage -- Benjie Chen and Robert Morris
Extending SQL Security to Derived and Distributed Data -- Arnon Rosenthal and Edward Sciore
A Work-Optimal Deterministic Algorithm for the Asynchronous Certified Write-All Problem -- Grzegorz Malewicz
Performing Work with Asynchronous Processors: Message-Delay-Sensitive Bounds -- Dariusz Kowalski and Alex Shvartsman
Fair Group Mutual Exclusion -- Prasad Jayanti, Srdjan Petrovic and King Tan
Efficient and Practical Constructions of LL/SC Variables -- Prasad Jayanti and Srdjan Petrovic
Adaptive and Efficient Abortable Mutual Exclusion -- Prasad Jayanti
Automatic Discovery of Mutual Exclusion Algorithms -- Gadi Taubenfeld and Yoah Bar-David
On Implementing Omega with Weak Reliability and Synchrony Assumptions -- Marcos Aguilera, Carole Delporte-Gallet, Hugues Fauconnier and Sam Toueg
On Using Network Attached Disks as Shared Memory -- Marcos Aguilera, Burkhard Englert and Eli Gafni
A Lattice-Theoretic Characterization of Safety and Liveness -- Panagiotis Manolios and Richard Trefler
Branching Time Refinement -- Panagiotis Manolios
Efficient Replication of Large Data Objects -- Rui Fan and Nancy Lynch
Efficient Flooding in Power-Law Networks -- Farnoush Banaei-Kashani and Cyrus Shahabi
Scaling Properties of the Internet Graph -- Aditya Akella, Shuchi Chawla, Arvind Kannan and Srinivasan Seshan
On a Network Creation Game -- Alex Fabrikant, Ankur Luthra, Elitza Maneva, Christos H. Papadimitriou and Scott Shenker
Adaptive AIMD Congestion Control -- Alexander Kesselman and Yishay Mansour
Adapting to a Reliable Network Path -- Baruch Awerbuch and Yishay Mansour.
Edition Notes
"ACM order number 536030"--T.p. verso.
Includes bibliographical references and author index.
Also available on the World Wide Web via ACM Digital Library.
The Physical Object
Edition Identifiers
Work Identifiers
Source records
Community Reviews (0)
Lists
