Conferences in DBLP
James H. Anderson , Yong-Jik Kim Nonatomic mutual exclusion with local spinning. [Citation Graph (0, 0)][DBLP ] Conf ] Panagiota Fatourou , Faith Ellen Fich , Eric Ruppert Space-optimal multi-writer snapshot objects are slow. [Citation Graph (0, 0)][DBLP ] Conf ] Maged M. Michael Safe memory reclamation for dynamic lock-free objects using atomic reads and writes. [Citation Graph (0, 0)][DBLP ] Conf ] Michael L. Scott Non-blocking timeout in scalable queue-based spin locks. [Citation Graph (0, 0)][DBLP ] Conf ] Amotz Bar-Noy , Grzegorz Malewicz Establishing wireless conference calls under delay constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Tomasz Jurdzinski , Miroslaw Kutylowski , Jan Zatopianski Efficient algorithms for leader election in radio networks. [Citation Graph (0, 0)][DBLP ] Conf ] Hongwei Zhang , Anish Arora GS3 : scalable self-configuration and self-healing in wireless networks. [Citation Graph (0, 0)][DBLP ] Conf ] Stergios V. Anastasiadis , Peter J. Varman , Jeffrey Scott Vitter , Ke Yi Lexicographically optimal smoothing for broadband traffic multiplexing. [Citation Graph (0, 0)][DBLP ] Conf ] Gregory Chockler , Dahlia Malkhi Active disk paxos with infinitely many processes. [Citation Graph (0, 0)][DBLP ] Conf ] Partha Dutta , Rachid Guerraoui The inherent price of indulgence. [Citation Graph (0, 0)][DBLP ] Conf ] Haifeng Yu , Amin Vahdat Minimal replication cost for availability. [Citation Graph (0, 0)][DBLP ] Conf ] David Mazières , Dennis Shasha Building secure file systems out of byantine storage. [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Fitzi , Daniel Gottesman , Martin Hirt , Thomas Holenstein , Adam Smith Detectable byzantine agreement secure against faulty majorities. [Citation Graph (0, 0)][DBLP ] Conf ] Paul D. Ezhilchelvan , Jean-Michel Hélary , Michel Raynal Building responseive TMR-based servers in presence of timing constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Ugur Çetintemel , Peter J. Keleher , Yanif Ahmad Exploiting precision vs. efficiency tradeoffs in symmetric replication environments. [Citation Graph (0, 0)][DBLP ] Conf ] Achour Mostéfaoui , Michel Raynal , Matthieu Roy , Divyakant Agrawal , Amr El Abbadi Towards a formal model for view maintenance in data warehouses. [Citation Graph (0, 0)][DBLP ] Conf ] K. Vidyasankar A highly concurrent group mutual /-exclusion algorithm0 . [Citation Graph (0, 0)][DBLP ] Conf ] Maurice Herlihy , Victor Luchangco , Paul A. Martin , Mark Moir Dynamic-sized lock-free data structures. [Citation Graph (0, 0)][DBLP ] Conf ] Chryssis Georgiou , Alexander Russell , Alexander A. Shvartsman Optimally work-competitive scheduling for cooperative computing with merging groups. [Citation Graph (0, 0)][DBLP ] Conf ] Yongqiang Huang , Hector Garcia-Molina Assignment-based partitioning in a condition monitoring system. [Citation Graph (0, 0)][DBLP ] Conf ] Zvi Lotker , Boaz Patt-Shamir Nearly optimal FIFO buffer management for DiffServ. [Citation Graph (0, 0)][DBLP ] Conf ] Andrei Z. Broder , Michael Mitzenmacher Optmial plans for aggregation. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Dobrev , Paola Flocchini , Giuseppe Prencipe , Nicola Santoro Searching for a black hole in arbitrary networks: optimal mobile agent protocols. [Citation Graph (0, 0)][DBLP ] Conf ] Zvika Brakerski , Aviv Nisgav , Boaz Patt-Shamir General perfectly periodic scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Joan Feigenbaum , Christos H. Papadimitriou , Rahul Sami , Scott Shenker A BGP-based mechanism for lowest-cost routing. [Citation Graph (0, 0)][DBLP ] Conf ] Dahlia Malkhi , Moni Naor , David Ratajczak Viceroy: a scalable and dynamic emulation of the butterfly. [Citation Graph (0, 0)][DBLP ] Conf ] M. V. N. Ashwin Kumar , Pranava R. Goundan , K. Srinathan , C. Pandu Rangan On perfectly secure cmmunication over arbitrary networks. [Citation Graph (0, 0)][DBLP ] Conf ] Yehuda Lindell , Anna Lysyanskaya , Tal Rabin Sequential composition of protocols without simultaneous termination. [Citation Graph (0, 0)][DBLP ] Conf ] Sitaram Iyer , Antony I. T. Rowstron , Peter Druschel Squirrel: a decentralized peer-to-peer web cache. [Citation Graph (0, 0)][DBLP ] Conf ] James Aspnes , Zoë Diamadi , Gauri Shah Fault-tolerant routing in peer-to-peer systems. [Citation Graph (0, 0)][DBLP ] Conf ] David Liben-Nowell , Hari Balakrishnan , David R. Karger Analysis of the evolution of peer-to-peer systems. [Citation Graph (0, 0)][DBLP ] Conf ] Omar Bakr , Idit Keidar Evaluating the running time of a communication round over the internet. [Citation Graph (0, 0)][DBLP ] Conf ] Achour Mostéfaoui , Sergio Rajsbaum , Michel Raynal Asynchronous interactive consistency and its relation with error-correcting codes. [Citation Graph (0, 0)][DBLP ] Conf ] Weibin Zhao , Henning Schulzrinne Selective anti-entropy. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuo Iwama , Masaki Okita Compact routing for average-case networks. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Greenwald How to wait when you are not going to block. [Citation Graph (0, 0)][DBLP ] Conf ] Mikel Larrea Understanding perfect failure detectors. [Citation Graph (0, 0)][DBLP ] Conf ] Carole Delporte-Gallet , Hugues Fauconnier , Jean-Michel Hélary , Michel Raynal Early stopping in aglobal data computation. [Citation Graph (0, 0)][DBLP ] Conf ] Shlomi Dolev , Elad Schiller , Jennifer L. Welch Random walk for self-stabilitzing group communication in ad hoc networks. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Greenwald Two-handed emulation: how to build non-blocking implementation of complex data-structures using DCAS. [Citation Graph (0, 0)][DBLP ] Conf ] Prasad Jayanti f -arrays: implementation and applications.Citation Graph (0, 0)][DBLP ] Conf ] Danny Hendler , Nir Shavit Non-blocking steal-half work queues. [Citation Graph (0, 0)][DBLP ] Conf ] Subhendu Chattopadhyay , Lisa Higham , Karen Seyffarth Dynamic and self-stabilizing distributed matching. [Citation Graph (0, 0)][DBLP ] Conf ] 