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 37 matches
- 2024
- Alysson Bessani, Xavier Défago, Junya Nakamura, Koichi Wada, Yukiko Yamauchi:
27th International Conference on Principles of Distributed Systems, OPODIS 2023, December 6-8, 2023, Tokyo, Japan. LIPIcs 286, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-308-9 [contents] - 2023
- Akanksha Agrawal, John Augustine, David Peleg, Srikkanth Ramachandran:
Local Recurrent Problems in the SUPPORTED Model. OPODIS 2023: 22:1-22:19 - Andrei Constantinescu, Diana Ghinea, Lioba Heimbach, Zilin Wang, Roger Wattenhofer:
A Fair and Resilient Decentralized Clock Network for Transaction Ordering. OPODIS 2023: 8:1-8:20 - Ittai Abraham, Naama Ben-David, Gilad Stern, Sravya Yandamuri:
On the Round Complexity of Asynchronous Crusader Agreement. OPODIS 2023: 29:1-29:21 - Orestis Alpos, Ignacio Amores-Sesar, Christian Cachin, Michelle Yeo:
Eating Sandwiches: Modular and Lightweight Elimination of Transaction Reordering Attacks. OPODIS 2023: 12:1-12:22 - Shalom M. Asbell, Eric Ruppert:
A Wait-Free Deque With Polylogarithmic Step Complexity. OPODIS 2023: 17:1-17:22 - Hagit Attiya, Antonella Del Pozzo, Alessia Milani, Ulysse Pavloff, Alexandre Rapetti:
The Synchronization Power of Auditable Registers. OPODIS 2023: 4:1-4:23 - Hagit Attiya, Jennifer L. Welch:
Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit. OPODIS 2023: 6:1-6:23 - Hagit Attiya, Jennifer L. Welch:
Bounds on Worst-Case Responsiveness for Agreement Algorithms. OPODIS 2023: 32:1-32:22 - João Paulo Bezerra, Petr Kuznetsov:
A Tight Bound on Multiple Spending in Decentralized Cryptocurrencies. OPODIS 2023: 31:1-31:19 - Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil:
Reliable Broadcast Despite Mobile Byzantine Faults. OPODIS 2023: 18:1-18:23 - Charlie Carlson, Daniel Frishberg, Eric Vigoda:
Improved Distributed Algorithms for Random Colorings. OPODIS 2023: 13:1-13:18 - Colin Cooper, Tomasz Radzik, Takeharu Shiraga:
Discrete Incremental Voting. OPODIS 2023: 10:1-10:22 - Avinandan Das, Pierre Fraigniaud, Adi Rosén:
Distributed Partial Coloring via Gradual Rounding. OPODIS 2023: 30:1-30:22 - Ramy Fakhoury, Anastasia Braginsky, Idit Keidar, Yoav Zuriel:
Nova: Safe Off-Heap Memory Allocation and Reclamation. OPODIS 2023: 15:1-15:20 - Caterina Feletti, Carlo Mereghetti, Beatrice Palano:
𝒪(log{n})-Time Uniform Circle Formation for Asynchronous Opaque Luminous Robots. OPODIS 2023: 5:1-5:21 - Paola Flocchini, Nicola Santoro, Yuichi Sudo, Koichi Wada:
On Asynchrony, Memory, and Communication: Separations and Landscapes. OPODIS 2023: 28:1-28:23 - François Le Gall:
Quantum Distributed Computing: Potential and Limitations (Invited Talk). OPODIS 2023: 2:1-2:1 - Yuval Gil:
Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs. OPODIS 2023: 16:1-16:20 - Vincent Gramoli:
From Consensus Research to Redbelly Network Pty Ltd (Invited Talk). OPODIS 2023: 1:1-1:2 - Juho Hirvonen, Laura Schmid, Krishnendu Chatterjee, Stefan Schmid:
On the Convergence Time in Graphical Games: A Locality-Sensitive Approach. OPODIS 2023: 11:1-11:24 - Vincent Kowalski, Achour Mostéfaoui, Matthieu Perrin:
Atomic Register Abstractions for Byzantine-Prone Distributed Systems. OPODIS 2023: 35:1-35:20 - Shay Kutten, Peter Robinson, Ming Ming Tan:
Tight Bounds on the Message Complexity of Distributed Tree Verification. OPODIS 2023: 26:1-26:22 - Junghyun Lee, Laura Schmid, Se-Young Yun:
Flooding with Absorption: An Efficient Protocol for Heterogeneous Bandits over Complex Networks. OPODIS 2023: 20:1-20:25 - Tomer Lev Lehman, Hagit Attiya, Danny Hendler:
Recoverable and Detectable Self-Implementations of Swap. OPODIS 2023: 24:1-24:22 - Andrew Lewis-Pye, Ittai Abraham:
Fever: Optimal Responsive View Synchronisation. OPODIS 2023: 14:1-14:16 - Ariel Livshits, Yoram Moses:
Probable Approximate Coordination. OPODIS 2023: 19:1-19:21 - Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
Black Hole Search in Dynamic Rings: The Scattered Case. OPODIS 2023: 33:1-33:18 - Jämes Ménétrey, Aeneas Grüter, Peterson Yuhala, Julius Oeftiger, Pascal Felber, Marcelo Pasin, Valerio Schiavoni:
A Holistic Approach for Trustworthy Distributed Systems with WebAssembly and TEEs. OPODIS 2023: 23:1-23:23 - Alejandro Naser-Pastoriza, Gregory V. Chockler, Alexey Gotsman:
Fault-Tolerant Computing with Unreliable Channels. OPODIS 2023: 21:1-21:21
skipping 7 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-28 10:26 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