Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8th PODC 1989: Edmonton, Alberta, Canada
- Piotr Rudnicki:
Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, Edmonton, Alberta, Canada, August 14-16, 1989. ACM 1989, ISBN 0-89791-326-4 - Nancy A. Lynch:
A Hundred Impossibility Proofs for Distributed Computing. 1-28 - Jayadev Misra:
Equational Reasoning About Nondeterministic Processes. 29-44 - Wuxu Peng, S. Purushothaman:
Towards Dataflow Analysis of Communicating Finite State Machines. 45-58 - Yishay Mansour, Baruch Schieber:
The Intractability of Bounded Protocols for Non-FIFO Channels. 59-72 - Da-Wei Wang, Lenore D. Zuck:
Tight Bounds for the Sequence Transmission Problem. 73-83 - Oded Goldreich, Amir Herzberg, Yishay Mansour:
Source to Destination Communication in the Presence of Faults. 85-101 - Joseph Y. Halpern, Mark R. Tuttle:
Knowledge, Probability, and Adversaries. 103-118 - Yoram Moses, Gil Roth:
On Reliable Message Diffusion. 119-127 - Ruben Michel:
A Categorical Approach to Distributed Systems Expressibility and Knowledge. 129-143 - James E. Burns, Gary L. Peterson:
The Ambiguity of Choosing. 145-157 - Serge A. Plotkin:
Sticky Bits and Universality of Consensus. 159-175 - Eugene Styer, Gary L. Peterson:
Tight Bounds for Shared Memory Symmetric Mutual Exclusion Problems. 177-191 - Divyakant Agrawal, Amr El Abbadi:
Efficient Solution to the Distributed Mutual Exclusion Problem. 193-200 - Judit Bar-Ilan, Donald Beaver:
Non-Cryptographic Fault-Tolerant Computing in Constant Number of Rounds of Interaction. 201-209 - Paris C. Kanellakis, Alexander A. Shvartsman
:
Efficient Parallel Algorithms Can Be Made Robust. 211-219 - A. Prasad Sistla, Jennifer L. Welch:
Efficient Distributed Recovery Using Message Logging. 223-238 - Robert P. Kurshan, Kenneth L. McMillan:
A Structural Induction Theorem for Processes. 239-247 - Charanjit S. Jutla, Edgar Knapp, Josyula R. Rao:
A Predicate Transformer Approach to Semantics of Parallel Programs. 249-263 - Job Zwiers, Willem P. de Roever:
Predicates are Predicate Transformers: A Unified Compositional Theory for Concurrency. 265-279 - Hagit Attiya, Danny Dolev, Nir Shavit:
Bounded Polynomial Randomized Consensus. 281-293 - Brian A. Coan, Jennifer L. Welch:
Modular Construction of Nearly Optimal Byzantine Agreement Protocols. 295-305 - Amotz Bar-Noy, Danny Dolev:
Shared-Memory vs. Message-Passing in an Asynchronous Distributed Environment. 307-318 - Baruch Schieber:
Calling Names in Nameless Networks. 319-328 - Reuven Bar-Yehuda, Amos Israeli:
Multiple Communication in Multi-Hop Radio Networks. 329-338 - Amir Herzberg, Shay Kutten:
Fast Isolation of Arbitrary Forwarding Faults. 339-353
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
