Conferences in DBLP
Ross J. Anderson Cryptography and competition policy: issues with 'trusted computing'. [Citation Graph (0, 0)][DBLP ] Conf ] Nancy A. Lynch Working with mike on distributed computing theory, 1978--1992. [Citation Graph (0, 0)][DBLP ] Conf ] Silvio Micali Simple and fast optimistic protocols for fair electronic exchange. [Citation Graph (0, 0)][DBLP ] Conf ] Rebecca N. Wright Fischer's cryptographic protocols. [Citation Graph (0, 0)][DBLP ] Conf ] Fabian Kuhn , Roger Wattenhofer Constant-time distributed dominating set approximation. [Citation Graph (0, 0)][DBLP ] Conf ] Yossi Azar , Shay Kutten , Boaz Patt-Shamir Distributed error confinement. [Citation Graph (0, 0)][DBLP ] Conf ] Marta Arias , Lenore Cowen , Kofi A. Laing Compact roundtrip routing with topology-independent node names. [Citation Graph (0, 0)][DBLP ] Conf ] J. J. Garcia-Luna-Aceves , Marc Mosko , Charles E. Perkins A new approach to on-demand loop-free routing in ad hoc networks. [Citation Graph (0, 0)][DBLP ] Conf ] Fabian Kuhn , Roger Wattenhofer , Yan Zhang , Aaron Zollinger Geometric ad-hoc routing: of theory and practice. [Citation Graph (0, 0)][DBLP ] Conf ] Dariusz R. Kowalski , Andrzej Pelc Broadcasting in undirected ad hoc radio networks. [Citation Graph (0, 0)][DBLP ] Conf ] Srikant Kuppa , Mansi Ramakrishnan Thoppian , Srinivasan Krishnamurthy , S. Venkatesan Brief announcement: cluster-based control mechanism for communication networks. [Citation Graph (0, 0)][DBLP ] Conf ] Danny Hendler , Nir Shavit Operation-valency and the cost of coordination. [Citation Graph (0, 0)][DBLP ] Conf ] Maurice Herlihy , Victor Luchangco , Mark Moir , William N. Scherer III Software transactional memory for dynamic-sized data structures. [Citation Graph (0, 0)][DBLP ] Conf ] Ori Shalev , Nir Shavit Split-ordered lists: lock-free extensible hash tables. [Citation Graph (0, 0)][DBLP ] Conf ] Srikanta Tirthapura Brief announcement: concurrent counting is harder than queuing. [Citation Graph (0, 0)][DBLP ] Conf ] André Schiper Brief announcement: dynamic group communication. [Citation Graph (0, 0)][DBLP ] Conf ] Moni Naor , Udi Wieder Scalable and dynamic quorum systems. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Christian Scheideler Peer-to-peer systems for prefix search. [Citation Graph (0, 0)][DBLP ] Conf ] Gurmeet Singh Manku Routing networks for distributed hash tables. [Citation Graph (0, 0)][DBLP ] Conf ] Ittai Abraham , Danny Dolev Asynchronous resource discovery. [Citation Graph (0, 0)][DBLP ] Conf ] Pierre Fraigniaud , Philippe Gauron Brief announcement: an overview of the content-addressable network D2B. [Citation Graph (0, 0)][DBLP ] Conf ] Nicholas J. A. Harvey , J. Ian Munro Brief announcement: deterministic skipnet. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Cachin An asynchronous protocol for distributed computation of RSA inverses and its applications. [Citation Graph (0, 0)][DBLP ] Conf ] Benoît Libert , Jean-Jacques Quisquater Efficient revocation and threshold pairing based cryptosystems. [Citation Graph (0, 0)][DBLP ] Conf ] Jung Min Park , Edwin K. P. Chong , Howard Jay Siegel Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures. [Citation Graph (0, 0)][DBLP ] Conf ] Ninghui Li , Wenliang Du , Dan Boneh Oblivious signature-based envelope. [Citation Graph (0, 0)][DBLP ] Conf ] Yevgeniy Dodis , Nelly Fazio , Aggelos Kiayias , Moti Yung Scalable public-key tracing and revoking. [Citation Graph (0, 0)][DBLP ] Conf ] Yehuda Lindell Brief announcement: impossibility results for concurrent secure two-party computation. [Citation Graph (0, 0)][DBLP ] Conf ] Shin'ichiro Matsuo , Wakaha Ogata Brief announcement: a method for exchanging valuable data: how to realize matching oblivious transfer. [Citation Graph (0, 0)][DBLP ] Conf ] S. Amitanand , I. Sanketh , K. Srinathan , V. Vinod , C. Pandu Rangan Distributed consensus in the presence of sectional faults. [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Fitzi , Juan A. Garay Efficient player-optimal protocols for strong and differential consensus. [Citation Graph (0, 0)][DBLP ] Conf ] Maurice Herlihy , Lucia Draque Penso tight bounds for k-set agreement with limited-scope failure detectors. [Citation Graph (0, 0)][DBLP ] Conf ] Fabrice Le Fessant , Philippe Raipin Parvédy , Michel Raynal Brief announcement: early decision despite general process omission failures. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Backes , Christian Cachin , Reto Strobl Proactive secure message transmission in asynchronous networks. [Citation Graph (0, 0)][DBLP ] Conf ] Amos Beimel , Lior Malka Efficient reliable communication over partially authenticated networks. [Citation Graph (0, 0)][DBLP ] Conf ] Justin Goshi , Richard E. Ladner Algorithms for dynamic multicast key distribution trees. [Citation Graph (0, 0)][DBLP ] Conf ] K. Srinathan , V. Vinod , C. Pandu Rangan Brief announcement: efficient perfectly secure communication over synchronous networks. [Citation Graph (0, 0)][DBLP ] Conf ] Benjie Chen , Thomer M. Gil , Athicha Muthitacharoen , Robert Morris Brief announcement: building data structures on untrusted peer-to-peer storage with per-participant logs. [Citation Graph (0, 0)][DBLP ] Conf ] Arnon Rosenthal , Edward Sciore Brief announcement: extending SQL access control to derived and distributed data. [Citation Graph (0, 0)][DBLP ] Conf ] Grzegorz Malewicz A work-optimal deterministic algorithm for the asynchronous certified write-all problem. [Citation Graph (0, 0)][DBLP ] Conf ] Dariusz R. Kowalski , Alexander A. Shvartsman Performing work with asynchronous processors: message-delay-sensitive bounds. [Citation Graph (0, 0)][DBLP ] Conf ] Prasad Jayanti , Srdjan Petrovic , King Tan Fair group mutual exclusion. [Citation Graph (0, 0)][DBLP ] Conf ] Prasad Jayanti , Srdjan Petrovic Efficient and practical constructions of LL/SC variables. [Citation Graph (0, 0)][DBLP ] Conf ] Prasad Jayanti Adaptive and efficient abortable mutual exclusion. [Citation Graph (0, 0)][DBLP ] Conf ] Yoah Bar-David , Gadi Taubenfeld Automatic discovery of mutual exclusion algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Marcos Kawazoe Aguilera , Carole Delporte-Gallet , Hugues Fauconnier , Sam Toueg On implementing omega with weak reliability and synchrony assumptions. [Citation Graph (0, 0)][DBLP ] Conf ] Marcos Kawazoe Aguilera , Burkhard Englert , Eli Gafni On using network attached disks as shared memory. [Citation Graph (0, 0)][DBLP ] Conf ] Panagiotis Manolios , Richard J. Trefler A lattice-theoretic characterization of safety and liveness. [Citation Graph (0, 0)][DBLP ] Conf ] Panagiotis Manolios Brief announcement: branching time refinement. [Citation Graph (0, 0)][DBLP ] Conf ] Rui Fan , Nancy A. Lynch Brief announcement: efficient replication of large data objects. [Citation Graph (0, 0)][DBLP ] Conf ] Farnoush Banaei Kashani , Cyrus Shahabi Brief announcement: efficient flooding in power-law networks. [Citation Graph (0, 0)][DBLP ] Conf ] Aditya Akella , Shuchi Chawla , Arvind Kannan , Srinivasan Seshan Scaling properties of the Internet graph. [Citation Graph (0, 0)][DBLP ] Conf ] Alex Fabrikant , Ankur Luthra , Elitza N. Maneva , Christos H. Papadimitriou , Scott Shenker On a network creation game. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Kesselman , Yishay Mansour Adaptive AIMD congestion control. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Yishay Mansour Adapting to a reliable network path. [Citation Graph (0, 0)][DBLP ] Conf ] 