9. PODC 1990:
Quebec City, Quebec, Canada
Cynthia Dwork (Ed.):
Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, Quebec City, Quebec, Canada, August 22-24, 1990.
ACM 1990, ISBN 0-89791-404-X 
- Yehuda Afek, Danny Dolev, Hagit Attiya, Eli Gafni, Michael Merritt, Nir Shavit:
Atomic Snapshots of Shared Memory.
1-13
- James H. Anderson:
Composite Registers.
15-29
- Carol Critchlow, Kim Taylor:
The Inhibition Spectrum and the Achievement of Causal Consistency.
31-42
- Rivka Ladin, Barbara Liskov, Liuba Shrira:
Lazy Replication: Exploiting the Semantics of Distributed Services.
43-57
- Alon Kleinman, Yoram Moses, Ehud Y. Shapiro:
Distributed Variable Server for Atomic Unification.
59-74
- David Jefferson:
Virtual Time II: Storage Management in Conservative and Optimistic Systems.
75-89
- Shmuel Katz, Kenneth J. Perry:
Self-Stabilizing Extensions for Message-Passing Systems.
91-101
- Shlomi Dolev, Amos Israeli, Shlomo Moran:
Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity.
103-117
- Amos Israeli, Marc Jalfon:
Token Management Schemes and Random Walks Yield Self-Stabilizing Mutual Exclusion.
119-131
- Frank B. Schmuck, Flaviu Cristian:
Continuous Clock Amortization Need Not Affect the Precision of a Clock Synchronization Algorithm.
133-143
- Baruch Awerbuch, Israel Cidon, Inder S. Gopal, Marc A. Kaplan, Shay Kutten:
Distributed Control for PARIS.
145-159
- Yoram Ofek, Moti Yung:
Principle for High Speed Network Control: Congestion- and Deadlock-Freeness, Self-Routing, and a Single Buffer per Link.
161-175
- Baruch Awerbuch, Alan E. Baratz, David Peleg:
Cost-Sensitive Analysis of Communication Protocols.
177-187
- Baruch Awerbuch, Oded Goldreich, Amir Herzberg:
A Quantitative Approach to Dynamic Networks.
189-203
- Ewan D. Tempero, Richard E. Ladner:
Tight Bounds for Weakly Bounded Protocols.
205-218
- Alon Orlitsky:
Two Messages are Almost Optimal for Conveying Information.
219-232
- E. Allen Emerson, Jai Srinivasan:
A Decidable Temporal Logic to Reason About Many Processes.
233-246
- Josyula R. Rao:
Reasoning About Probabilistic Algorithms.
247-264
- Nancy A. Lynch, Hagit Attiya:
Using Mappings to Prove Timing Properties.
265-280
- Thomas A. Henzinger:
Half-Order Modal Logic: How to Prove Real-Time Properties.
281-296
- Ajei S. Gopal, H. Raymond Strong, Sam Toueg, Flaviu Cristian:
Early-Delivery Atomic Broadcast.
297-309
- Soma Chaudhuri:
Agreement is Harder than Consensus: Set Consensus Problems in Totally Asynchronous Systems.
311-324
- James Aspnes:
Time- and Space-Efficient Randomized Consensus.
325-331
- Joseph Y. Halpern, Yoram Moses, Orli Waarts:
A Characterization of Eventual Byzantine Agreement.
333-346
- Maurice Herlihy, Mark R. Tuttle:
Lower Bounds for Wait-Free Computation in Message-Passing Systems.
347-362
- Hagit Attiya, Amotz Bar-Noy, Danny Dolev:
Sharing Memory Robustly in Message-Passing Systems.
363-375
Invited Paper, PODC 1989
Last update Wed May 22 16:20:52 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
