Conferences in DBLP
Yehuda Afek , Danny Dolev , Hagit Attiya , Eli Gafni , Michael Merritt , Nir Shavit Atomic Snapshots of Shared Memory. [Citation Graph (0, 0)][DBLP ] Conf ] James H. Anderson Composite Registers. [Citation Graph (0, 0)][DBLP ] Conf ] Carol Critchlow , Kim Taylor The Inhibition Spectrum and the Achievement of Causal Consistency. [Citation Graph (0, 0)][DBLP ] Conf ] Rivka Ladin , Barbara Liskov , Liuba Shrira Lazy Replication: Exploiting the Semantics of Distributed Services. [Citation Graph (7, 0)][DBLP ] Conf ] Alon Kleinman , Yoram Moses , Ehud Y. Shapiro Distributed Variable Server for Atomic Unification. [Citation Graph (0, 0)][DBLP ] Conf ] David Jefferson Virtual Time II: Storage Management in Conservative and Optimistic Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Shmuel Katz , Kenneth J. Perry Self-Stabilizing Extensions for Message-Passing Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Shlomi Dolev , Amos Israeli , Shlomo Moran Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity. [Citation Graph (0, 0)][DBLP ] Conf ] Amos Israeli , Marc Jalfon Token Management Schemes and Random Walks Yield Self-Stabilizing Mutual Exclusion. [Citation Graph (0, 0)][DBLP ] Conf ] Frank B. Schmuck , Flaviu Cristian Continuous Clock Amortization Need Not Affect the Precision of a Clock Synchronization Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Israel Cidon , Inder S. Gopal , Marc Kaplan , Shay Kutten Distributed Control for PARIS. [Citation Graph (0, 0)][DBLP ] Conf ] Yoram Ofek , Moti Yung Principle for High Speed Network Control: Congestion- and Deadlock-Freeness, Self-Routing, and a Single Buffer per Link. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Alan E. Baratz , David Peleg Cost-Sensitive Analysis of Communication Protocols. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Oded Goldreich , Amir Herzberg A Quantitative Approach to Dynamic Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Ewan D. Tempero , Richard E. Ladner Tight Bounds for Weakly Bounded Protocols. [Citation Graph (0, 0)][DBLP ] Conf ] Alon Orlitsky Two Messages are Almost Optimal for Conveying Information. [Citation Graph (0, 0)][DBLP ] Conf ] E. Allen Emerson , Jai Srinivasan A Decidable Temporal Logic to Reason About Many Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Josyula R. Rao Reasoning About Probabilistic Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Nancy A. Lynch , Hagit Attiya Using Mappings to Prove Timing Properties. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas A. Henzinger Half-Order Modal Logic: How to Prove Real-Time Properties. [Citation Graph (1, 0)][DBLP ] Conf ] Ajei S. Gopal , H. Raymond Strong , Sam Toueg , Flaviu Cristian Early-Delivery Atomic Broadcast. [Citation Graph (0, 0)][DBLP ] Conf ] Soma Chaudhuri Agreement is Harder than Consensus: Set Consensus Problems in Totally Asynchronous Systems. [Citation Graph (0, 0)][DBLP ] Conf ] James Aspnes Time- and Space-Efficient Randomized Consensus. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Y. Halpern , Yoram Moses , Orli Waarts A Characterization of Eventual Byzantine Agreement. [Citation Graph (0, 0)][DBLP ] Conf ] Maurice Herlihy , Mark R. Tuttle Lower Bounds for Wait-Free Computation in Message-Passing Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Hagit Attiya , Amotz Bar-Noy , Danny Dolev Sharing Memory Robustly in Message-Passing Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Zohar Manna , Amir Pnueli A Hierarchy of Temporal Properties. [Citation Graph (0, 0)][DBLP ] Conf ] 