Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 28 matches
- 1990
- Yehuda Afek, Danny Dolev, Hagit Attiya, Eli Gafni, Michael Merritt, Nir Shavit:
Atomic Snapshots of Shared Memory. PODC 1990: 1-13 - James H. Anderson:
Composite Registers. PODC 1990: 15-29 - James Aspnes:
Time- and Space-Efficient Randomized Consensus. PODC 1990: 325-331 - Hagit Attiya, Amotz Bar-Noy, Danny Dolev:
Sharing Memory Robustly in Message-Passing Systems. PODC 1990: 363-375 - Baruch Awerbuch, Israel Cidon, Inder S. Gopal, Marc A. Kaplan, Shay Kutten:
Distributed Control for PARIS. PODC 1990: 145-159 - Baruch Awerbuch, Alan E. Baratz, David Peleg:
Cost-Sensitive Analysis of Communication Protocols. PODC 1990: 177-187 - Baruch Awerbuch, Oded Goldreich, Amir Herzberg:
A Quantitative Approach to Dynamic Networks. PODC 1990: 189-203 - Soma Chaudhuri:
Agreement is Harder than Consensus: Set Consensus Problems in Totally Asynchronous Systems. PODC 1990: 311-324 - Carol Critchlow, Kim Taylor:
The Inhibition Spectrum and the Achievement of Causal Consistency. PODC 1990: 31-42 - Shlomi Dolev, Amos Israeli, Shlomo Moran:
Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity. PODC 1990: 103-117 - E. Allen Emerson, Jai Srinivasan:
A Decidable Temporal Logic to Reason About Many Processes. PODC 1990: 233-246 - Ajei S. Gopal, H. Raymond Strong, Sam Toueg, Flaviu Cristian:
Early-Delivery Atomic Broadcast. PODC 1990: 297-309 - Joseph Y. Halpern, Yoram Moses, Orli Waarts:
A Characterization of Eventual Byzantine Agreement. PODC 1990: 333-346 - Thomas A. Henzinger:
Half-Order Modal Logic: How to Prove Real-Time Properties. PODC 1990: 281-296 - Maurice Herlihy, Mark R. Tuttle:
Lower Bounds for Wait-Free Computation in Message-Passing Systems. PODC 1990: 347-362 - Amos Israeli, Marc Jalfon:
Token Management Schemes and Random Walks Yield Self-Stabilizing Mutual Exclusion. PODC 1990: 119-131 - David Jefferson:
Virtual Time II: Storage Management in Conservative and Optimistic Systems. PODC 1990: 75-89 - Shmuel Katz, Kenneth J. Perry:
Self-Stabilizing Extensions for Message-Passing Systems. PODC 1990: 91-101 - Alon Kleinman, Yoram Moses, Ehud Shapiro:
Distributed Variable Server for Atomic Unification. PODC 1990: 59-74 - Rivka Ladin, Barbara Liskov, Liuba Shrira:
Lazy Replication: Exploiting the Semantics of Distributed Services. PODC 1990: 43-57 - Nancy A. Lynch, Hagit Attiya:
Using Mappings to Prove Timing Properties. PODC 1990: 265-280 - Zohar Manna, Amir Pnueli:
A Hierarchy of Temporal Properties. PODC 1990: 377-410 - Yoram Ofek, Moti Yung:
Principle for High Speed Network Control: Congestion- and Deadlock-Freeness, Self-Routing, and a Single Buffer per Link. PODC 1990: 161-175 - Alon Orlitsky:
Two Messages are Almost Optimal for Conveying Information. PODC 1990: 219-232 - Josyula R. Rao:
Reasoning About Probabilistic Algorithms. PODC 1990: 247-264 - Frank B. Schmuck, Flaviu Cristian:
Continuous Clock Amortization Need Not Affect the Precision of a Clock Synchronization Algorithm. PODC 1990: 133-143 - Ewan D. Tempero, Richard E. Ladner:
Tight Bounds for Weakly Bounded Protocols. PODC 1990: 205-218 - Cynthia Dwork:
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 [contents]
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-08-22 22:42 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint