default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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 40 matches
- 2025
- Silvia Bonomi
, Letterio Galletta, Etienne Rivière, Valerio Schiavoni:
28th International Conference on Principles of Distributed Systems, OPODIS 2024, December 11-13, 2024, Lucca, Italy. LIPIcs 324, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2025, ISBN 978-3-95977-360-7 [contents] - 2024
- Timothé Albouy, Antonio Fernández Anta, Chryssis Georgiou, Mathieu Gestin, Nicolas Nicolaou, Junlang Wang:
AMECOS: A Modular Event-Based Framework for Concurrent Object Specification. OPODIS 2024: 4:1-4:29 - Timothé Albouy, Davide Frey, Ran Gelles, Carmit Hazay, Michel Raynal, Elad Michael Schiller, François Taïani, Vassilis Zikas:
Near-Optimal Communication Byzantine Reliable Broadcast Under a Message Adversary. OPODIS 2024: 14:1-14:29 - Vijeth Aradhya, Seth Gilbert, Thorsten Götte:
Distributed Branching Random Walks and Their Applications. OPODIS 2024: 36:1-36:20 - Mathieu Bacou:
FaaSLoad: Fine-Grained Performance and Resource Measurement for Function-As-a-Service. OPODIS 2024: 22:1-22:21 - Alysson Bessani:
The Power of Simplicity on Dependable Distributed Systems (Invited Talk). OPODIS 2024: 1:1-1:1 - João Paulo Bezerra, Veronika Anikina, Petr Kuznetsov, Liron Schiff, Stefan Schmid:
Dynamic Probabilistic Reliable Broadcast. OPODIS 2024: 31:1-31:30 - Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten:
Self-Stabilizing Fully Adaptive Maximal Matching. OPODIS 2024: 33:1-33:21 - Nicolas Bousquet, Laurent Feuilloley, Théo Pierron:
How Local Constraints Influence Network Diameter and Applications to LCL Generalizations. OPODIS 2024: 28:1-28:28 - Quentin Bramas, Toshimitsu Masuzawa, Sébastien Tixeuil:
Crash-Tolerant Exploration of Trees by Energy-Sharing Mobile Agents. OPODIS 2024: 9:1-9:16 - Keren Censor-Hillel, Einav Huberman:
Near-Optimal Resilient Labeling Schemes. OPODIS 2024: 35:1-35:22 - Rowdy Chotkan, Bart Cox, Vincent Rahli, Jérémie Decouchant:
Reliable Communication in Hybrid Authentication and Trust Models. OPODIS 2024: 25:1-25:26 - Jacek Cichon, Dawid Dworzanski, Karol Gotfryd:
On Reliability of the Extrema Propagation Technique in Random Environment. OPODIS 2024: 29:1-29:16 - Diana Cohen, Roy Friedman, Rana Shahout:
Distributed Recoverable Sketches. OPODIS 2024: 23:1-23:16 - Anubhav Dhar, Eli Kujawa, Henrik Lievonen, Augusto Modanese, Mikail Muftuoglu, Jan Studený, Jukka Suomela:
Local Problems in Trees Across a Wide Range of Distributed Models. OPODIS 2024: 27:1-27:17 - Sahil Dhoked, Ahmed Fahmy, Wojciech Golab, Neeraj Mittal:
RMR-Efficient Detectable Objects for Persistent Memory and Their Applications. OPODIS 2024: 5:1-5:26 - Fabien Dufoulon, Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
The Singular Optimality of Distributed Computation in LOCAL. OPODIS 2024: 26:1-26:17 - Mose Mizrahi Erbes, Roger Wattenhofer:
Quit-Resistant Reliable Broadcast and Efficient Terminating Gather. OPODIS 2024: 15:1-15:22 - Ahmed Fahmy, Wojciech Golab:
DULL: A Fast Scalable Detectable Unrolled Lock-Based Linked List. OPODIS 2024: 6:1-6:25 - Stephan Felber, Hugo Rincon Galeana:
Stabilizing Consensus Is Impossible in Lossy Iterated Immediate Snapshot Models. OPODIS 2024: 18:1-18:16 - Aleksander Figiel, Janne H. Korhonen, Neil Olver, Stefan Schmid:
Efficient Algorithms for Demand-Aware Networks and a Connection to Virtual Network Embedding. OPODIS 2024: 38:1-38:24 - Paola Flocchini:
Distributed Computing by Mobile Robots: Expanding the Horizon (Invited Talk). OPODIS 2024: 2:1-2:2 - François Le Gall, Oran Nadler, Harumichi Nishimura, Rotem Oshman:
Quantum Simultaneous Protocols Without Public Coins Using Modified Equality Queries. OPODIS 2024: 34:1-34:20 - Younan Gao, Andrzej Pelc:
Gathering Teams of Deterministic Finite Automata on a Line. OPODIS 2024: 11:1-11:17 - Sylvain Gay, Achour Mostéfaoui, Matthieu Perrin:
No Symmetric Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing Systems. OPODIS 2024: 21:1-21:20 - Raphael Gerlach, Sören von der Gracht, Christopher Hahn, Jonas Harbig, Peter Kling:
Symmetry Preservation in Swarms of Oblivious Robots with Limited Visibility. OPODIS 2024: 13:1-13:28 - Pritam Goswami, Adri Bhattacharya, Raja Das, Partha Sarathi Mandal:
Perpetual Exploration of a Ring in Presence of Byzantine Black Hole. OPODIS 2024: 17:1-17:17 - Juho Hirvonen, Sara Ranjbaran:
Fast, Fair and Truthful Distributed Stable Matching for Common Preferences. OPODIS 2024: 30:1-30:20 - Haruki Kanaya, Ryota Eguchi, Taisho Sasada, Michiko Inoue:
Almost Time-Optimal Loosely-Stabilizing Leader Election on Arbitrary Graphs Without Identifiers in Population Protocols. OPODIS 2024: 37:1-37:17 - Thomas Locher:
Byzantine Reliable Broadcast with Low Communication and Time Complexity. OPODIS 2024: 16:1-16:17
skipping 10 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 2025-01-10 16:59 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
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:
