Conferences in DBLP
Michael Mitzenmacher Digital Fountains and Their Application to Informed Content Delivery over Adaptive Overlay Networks. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:1- [Conf ] Amir Herzberg Securing the Net: Challenges, Failures and Directions. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:2- [Conf ] Flavio Paiva Junqueira , Keith Marzullo Coterie Availability in Sites. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:3-17 [Conf ] Gal Badishi , Amir Herzberg , Idit Keidar Keeping Denial-of-Service Attackers in the Dark. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:18-32 [Conf ] Hagen Völzer On Conspiracies and Hyperfairness in Distributed Computing. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:33-47 [Conf ] Amitanand S. Aiyer , Lorenzo Alvisi , Rida A. Bazzi On the Availability of Non-strict Quorum Systems. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:48-62 [Conf ] Eli Gafni , Sergio Rajsbaum Musical Benches. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:63-77 [Conf ] Faith Ellen Fich , Victor Luchangco , Mark Moir , Nir Shavit Obstruction-Free Algorithms Can Be Practically Wait-Free. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:78-92 [Conf ] Neeraj Mittal , Felix C. Freiling , S. Venkatesan , Lucia Draque Penso Efficient Reduction for Wait-Free Termination Detection in a Crash-Prone Distributed System. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:93-107 [Conf ] Chris Purcell , Tim Harris Non-blocking Hashtables with Open Addressing. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:108-121 [Conf ] Hagit Attiya , Rachid Guerraoui , Petr Kouznetsov Computing with Reads and Writes in the Absence of Step Contention. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:122-136 [Conf ] Matei David , Alex Brodsky , Faith Ellen Fich Restricted Stack Implementations. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:137-151 [Conf ] Gregory Chockler , Nancy A. Lynch , Sayan Mitra , Joshua A. Tauber Proving Atomicity: An Assertional Approach. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:152-168 [Conf ] Hagit Attiya , Danny Hendler Time and Space Lower Bounds for Implementations Using k -CAS. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:169-183 [Conf ] Carole Delporte-Gallet , Hugues Fauconnier , Rachid Guerraoui (Almost) All Objects Are Universal in Message Passing Systems. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:184-198 [Conf ] Dahlia Malkhi , Florian Oprea , Lidong Zhou Omega Meets Paxos: Leader Election and Stability Without Eventual Timely Links. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:199-213 [Conf ] Brad T. Moore , Paolo A. G. Sivilotti Plausible Clocks with Bounded Inaccuracy. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:214-228 [Conf ] Kai Engelhardt , Yoram Moses Causing Communication Closure: Safe Program Composition with Non-FIFO Channels. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:229-243 [Conf ] Rachid Guerraoui , Eric Ruppert What Can Be Implemented Anonymously? [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:244-259 [Conf ] Andrzej Pelc Waking Up Anonymous Ad Hoc Radio Networks. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:260-272 [Conf ] Fabian Kuhn , Thomas Moscibroda , Tim Nieberg , Roger Wattenhofer Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:273-287 [Conf ] Shafi Goldwasser , Madhu Sudan , Vinod Vaikuntanathan Distributed Computing with Imperfect Randomness. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:288-302 [Conf ] Rachid Guerraoui , Maurice Herlihy , Bastian Pochon Polymorphic Contention Management. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:303-323 [Conf ] Maurice Herlihy , Ye Sun Distributed Transactional Memory for Metric-Space Networks. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:324-338 [Conf ] Dahlia Malkhi , Douglas B. Terry Concise Version Vectors in WinFS. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:339-353 [Conf ] Virendra J. Marathe , William N. Scherer III , Michael L. Scott Adaptive Software Transactional Memory. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:354-368 [Conf ] Piotr Zielinski Optimistic Generic Broadcast. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:369-383 [Conf ] Yehuda Afek , Yaron De Levie Space and Step Complexity Efficient Adaptive Collect. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:384-398 [Conf ] Joffroy Beauquier , Laurence Pilard , Brigitte Rozoy Observing Locally Self-stabilization in a Probabilistic Way. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:399-413 [Conf ] Michele Flammini , Luca Moscardelli , Alfredo Navarra , Stéphane Pérennes Asymptotically Optimal Solutions for Small World Graphs. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:414-428 [Conf ] Maria J. Blesa Deciding Stability in Packet-Switched FIFO Networks Under the Adversarial Queuing Model in Polynomial Time , . [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:429-441 [Conf ] Ittai Abraham , Cyril Gavoille , Dahlia Malkhi Compact Routing for Graphs Excluding a Fixed Minor. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:442-456 [Conf ] Amos Korman General Compact Labeling Schemes for Dynamic Trees. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:457-471 [Conf ] Uri Nadav , Moni Naor The Dynamic And-Or Quorum System. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:472-486 [Conf ] Barbara Liskov , Rodrigo Rodrigues Byzantine Clients Rendered Harmless. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:487-489 [Conf ] Antonio Fernández , Chryssis Georgiou , Luis López , Agustín Santos Reliably Executing Tasks in the Presence of Malicious Processors. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:490-492 [Conf ] Faith Ellen Fich , Victor Luchangco , Mark Moir , Nir Shavit Obstruction-Free Step Complexity: Lock-Free DCAS as an Example. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:493-494 [Conf ] Mikel Larrea , Alberto Lafuente Communication-Efficient Implementation of Failure Detector Classes and. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:495-496 [Conf ] Christian Cachin , Stefano Tessaro Optimal Resilience for Erasure-Coded Byzantine Distributed Storage. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:497-498 [Conf ] Michael Okun Agreement Among Unacquainted Byzantine Generals. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:499-500 [Conf ] Yuanyuan Zhao , Sumeer Bhola , Daniel C. Sturman Subscription Propagation and Content-Based Routing with Delivery Guarantees. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:501-502 [Conf ] Christian Cachin , Stefano Tessaro Asynchronous Verifiable Information Dispersal. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:503-504 [Conf ] Emmanuelle Anceaume , Xavier Défago , Maria Gradinariu , Matthieu Roy Towards a Theory of Self-organization. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:505-506 [Conf ] Zvi Lotker , Boaz Patt-Shamir , Mark R. Tuttle Timing Games and Shared Memory. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:507-508 [Conf ] Yu-Chen Kuo , Huang-Chen Lee A Lightweight Group Mutual k -Exclusion Algorithm Using Bi-k -Arbiters. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:509-510 [Conf ] Philippe Duchon , Nicolas Hanusse , Emmanuelle Lebhar , Nicolas Schabanel Could any Graph be Turned into a Small-World?. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:511-513 [Conf ] Ittai Abraham , Dahlia Malkhi , Gurmeet Singh Manku Papillon: Greedy Routing in Rings. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:514-515 [Conf ] Burkhard Englert An Efficient Long-Lived Adaptive Collect Algorithm. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:516-518 [Conf ]