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 66 matches
- 2021
- Gal Sela, Maurice Herlihy, Erez Petrank:
Brief Announcement: Linearizability: A Typo. PODC 2021: 561-564 - Sebastian Brandt, Christoph Grunau, Václav Rozhon:
The Randomized Local Computation Complexity of the Lovász Local Lemma. PODC 2021: 307-317 - Shuo Liu, Nirupam Gupta, Nitin H. Vaidya:
Approximate Byzantine Fault-Tolerance in Distributed Optimization. PODC 2021: 379-389 - Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, Alin Tomescu:
Reaching Consensus for Asynchronous Distributed Key Generation. PODC 2021: 363-373 - Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang:
Good-case Latency of Byzantine Broadcast: a Complete Categorization. PODC 2021: 331-341 - Mark Abspoel, Thomas Attema, Matthieu Rambaud:
Brief Announcement: Malicious Security Comes for Free in Consensus with Leaders. PODC 2021: 195-198 - Marcos K. Aguilera, Hagit Attiya, Christian Cachin, Alessandro Panconesi:
2021 Principles of Distributed Computing Doctoral Dissertation Award. PODC 2021: 3 - Dan Alistarh, Martin Töpfer, Przemyslaw Uznanski:
Comparison Dynamics in Population Protocols. PODC 2021: 55-65 - Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, Franck Petit:
On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics. PODC 2021: 21-31 - John Augustine, Anisur Rahaman Molla, Gopal Pandurangan:
Byzantine Agreement and Leader Election: From Classical to the Modern. PODC 2021: 569-571 - Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti:
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees. PODC 2021: 283-293 - Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jan Studený, Jukka Suomela, Aleksandr Tereshchenko:
Locally Checkable Problems in Rooted Trees. PODC 2021: 263-272 - Benyamin Bashari, Philipp Woelfel:
An Efficient Adaptive Partial Snapshot Implementation. PODC 2021: 545-555 - Naama Ben-David, Kartik Nayak:
Brief Announcement: Classifying Trusted Hardware via Unidirectional Communication. PODC 2021: 191-194 - Greg Bodwin, Merav Parter:
Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs. PODC 2021: 435-443 - Elette Boyle, Ran Cohen, Aarushi Goel:
Breaking the O(√ n)-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party. PODC 2021: 319-330 - Kayman Brusse, Faith Ellen:
Reductions and Extension-Based Proofs. PODC 2021: 497-507 - Janna Burman, Ho-Lin Chen, Hsueh-Ping Chen, David Doty, Thomas Nowak, Eric E. Severson, Chuan Xu:
Time-Optimal Self-Stabilizing Leader Election in Population Protocols. PODC 2021: 33-44 - Nairen Cao, Jeremy T. Fineman, Katina Russell:
Brief Announcement: An Improved Distributed Approximate Single Source Shortest Paths Algorithm. PODC 2021: 493-496 - Keren Censor-Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, David Peleg:
2021 Edsger W. Dijkstra Prize in Distributed Computing. PODC 2021: 1 - Eric Chan, Mohsen Lesani:
Brief Announcement: Brokering with Hashed Timelock Contracts is NP-Hard. PODC 2021: 199-202 - David Yu Cheng Chan, Philipp Woelfel:
Tight Lower Bound for the RMR Complexity of Recoverable Mutual Exclusion. PODC 2021: 533-543 - Saksham Chand, Yanhong A. Liu:
Brief Announcement: What's Live? Understanding Distributed Consensus. PODC 2021: 565-568 - Yi-Jun Chang, Mohsen Ghaffari:
Strong-Diameter Network Decomposition. PODC 2021: 273-281 - Moses Charikar, Weiyun Ma, Li-Yang Tan:
Brief Announcement: A Randomness-efficient Massively Parallel Algorithm for Connectivity. PODC 2021: 431-433 - Haimin Chen, Yonggang Jiang, Chaodong Zheng:
Tight Trade-off in Contention Resolution without Collision Detection. PODC 2021: 139-149 - Amit K. Chopra, Samuel H. Christie V., Munindar P. Singh:
Interaction-Oriented Programming: An Application Semantics Approach for Engineering Decentralized Applications. PODC 2021: 575-576 - Andrea Clementi, Francesco D'Amore, George Giakkoupis, Emanuele Natale:
Search via Parallel Lévy Walks on Z2. PODC 2021: 81-91 - Philipp Czerner, Javier Esparza:
Lower Bounds on the State Complexity of Population Protocols. PODC 2021: 45-54 - Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza:
Decision Power of Weak Asynchronous Models of Distributed Computing. PODC 2021: 115-125
skipping 36 more matches
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-10-24 00:34 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