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 31 matches
- 1985
- Yehuda Afek, Eli Gafni:
Time and Message Bounds of Election in Synchronous and Asynchronous Complete Networks. PODC 1985: 186-195 - Chagit Attiya, Marc Snir, Manfred K. Warmuth:
Computing on an Anonymous Ring. PODC 1985: 196-203 - Baruch Awerbuch:
Communication-Time Trade-Offs in Network Synchronization. PODC 1985: 272-276 - Amotz Bar-Noy, Michael Ben-Or, Danny Dolev:
Choice Coordination with Bounded Failure (a Preliminary Version). PODC 1985: 309-316 - Michael Ben-Or:
Fast Asynchronous Byzantine Agreement (Extended Abstract). PODC 1985: 149-151 - Andrei Z. Broder:
A Provably Secure Polynomial Approximation Scheme for the Distributed Lottery Problem (Extended Abstract). PODC 1985: 136-148 - K. Mani Chandy:
Concurrent Programming For The Masses (PODC 1984 Invited Address). PODC 1985: 1-12 - K. Mani Chandy, Jayadev Misra:
How Processes Learn. PODC 1985: 204-214 - David Wai-Lok Cheung, Tiko Kameda:
Site Optimal Termination Protocols for a Distributed Database under Network Partitioning. PODC 1985: 111-121 - Benny Chor, Michael Merritt, David B. Shmoys:
Simple Constant-Time Consensus Protocols in Realistic Failure Models (Extended Abstract). PODC 1985: 152-162 - Michael J. Fischer, Nancy A. Lynch, Michael Merritt:
Easy Impossibility Proofs for Distributed Consensus Problems. PODC 1985: 59-70 - Eli Gafni:
Improvements in the Time Complexity of Two Message-Optimal Election Algorithms. PODC 1985: 175-185 - Albert G. Greenberg, Boris D. Lubachevsky, Andrew M. Odlyzko:
Simple, Efficient Asynchronous Parallel Algorithms for Maximization. PODC 1985: 300-308 - Joseph Y. Halpern, Ronald Fagin:
A Formal Model of Knowledge, Action, and Communication in Distributed Systems: Preliminary Report. PODC 1985: 224-236 - Maurice Herlihy:
Comparing How Atomicity Mechanisms Support Replication. PODC 1985: 102-110 - Alon Itai:
Parallel Arithmetic with Concurrent Writes. PODC 1985: 293-299 - Ralph E. Johnson, Fred B. Schneider:
Symmetry and Similarity in Distributed Systems. PODC 1985: 13-22 - Bengt Jonsson:
A Model and Proof System for Asynchronous Networks. PODC 1985: 49-58 - Paris C. Kanellakis, Scott A. Smolka:
On the Analysis of Cooperation and Antagonism in Networks of Communicating Processes. PODC 1985: 23-38 - Ephraim Korach, Shay Kutten, Shlomo Moran:
A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms. PODC 1985: 163-174 - Ephraim Korach, Shlomo Moran, Shmuel Zaks:
The Optimality of Distributed Constructions of Minimum Weigth and Degree Restricted Spanning Trees in a Complete Network of Processors. PODC 1985: 277-286 - Keith A. Lantz, Judy L. Edighoffer, Bruce L. Hitson:
Towards a Universal Directory Service. PODC 1985: 250-260 - Stephen R. Mahaney, Fred B. Schneider:
Inexact Agreement: Accuracy, Precision, and Graceful Degradation. PODC 1985: 237-249 - Yoram Moses, Danny Dolev, Joseph Y. Halpern:
Cheating Husbands and Other Stories: A Case Study of Knowledge, Action, and Communication (Preliminary Version). PODC 1985: 215-223 - Sape J. Mullender, Paul M. B. Vitányi:
Distributed Match-Making for Processes in Computer Networks (Preliminary Version). PODC 1985: 261-271 - A. Prasad Sistla:
On Characterization of Safety and Liveness Properties in Temporal Logic. PODC 1985: 39-48 - T. K. Srikanth, Sam Toueg:
Optimal Clock Synchronization. PODC 1985: 71-86 - Boleslaw K. Szymanski, Yuan Shi, Noah S. Prywes:
Terminating Iterative Solution of Simultaneous Equations in Distributed Message Passing Systems. PODC 1985: 287-292 - Sam Toueg, Kenneth J. Perry, T. K. Srikanth:
Fast Distributed Agreement (Preliminary Version). PODC 1985: 87-101 - William E. Weihl:
Distributed Version Management for Read-Only Actions (Extended Abstract). PODC 1985: 122-135
skipping 1 more match
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-11-08 13:24 CET 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