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 770 matches
- 2024
- Erik van den Akker
, Kevin Buchin, Klaus-Tycho Foerster:
Multi-agent Online Graph Exploration on Cycles and Tadpole Graphs. SIROCCO 2024: 513-519 - Ignacio Amores-Sesar, Christian Cachin, Philipp Schneider:
An Analysis of Avalanche Consensus. SIROCCO 2024: 27-44 - Emmanuelle Anceaume, Davide Frey, Arthur Rauch:
Sharding in Permissionless Systems in Presence of an Adaptive Adversary. SIROCCO 2024: 481-487 - John Augustine, William K. Moses Jr., Gopal Pandurangan:
Awake Complexity of Distributed Minimum Spanning Tree. SIROCCO 2024: 45-63 - Tugkan Batu, Amitabh Trehan, Chhaya Trehan:
All You Need are Random Walks: Fast and Simple Distributed Conductance Testing. SIROCCO 2024: 64-82 - Leyla Biabani, Ami Paz:
k-Center Clustering in Distributed Models. SIROCCO 2024: 83-100 - Lélia Blin, Gabriel Le Bouder, Franck Petit:
Optimal Memory Requirement for Self-stabilizing Token Circulation. SIROCCO 2024: 101-118 - Quentin Bramas, Sayaka Kamei, Anissa Lamani, Sébastien Tixeuil:
Stand-Up Indulgent Gathering on Rings. SIROCCO 2024: 119-137 - Costas Busch, Pawel Garncarek, Dariusz R. Kowalski:
Locally Balanced Allocations Under Strong Byzantine Influence. SIROCCO 2024: 262-280 - Arnaud Casteigts, Timothée Corsini:
In Search of the Lost Tree - Hardness and Relaxation of Spanning Trees in Temporal Graphs. SIROCCO 2024: 138-155 - Keren Censor-Hillel, Majd Khoury:
On Distributed Computation of the Minimum Triangle Edge Transversal. SIROCCO 2024: 336-358 - Keren Censor-Hillel, Yuka Machino, Pedro Soto:
Near-Optimal Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens. SIROCCO 2024: 156-173 - Jérémie Chalopin, Shantanu Das, Maria Kokkou:
Deterministic Leader Election for Stationary Programmable Matter with Common Direction. SIROCCO 2024: 174-191 - Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra, Francesco Piselli:
Mutual Visibility in Hypercube-Like Graphs. SIROCCO 2024: 192-207 - Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers:
Non-negotiating Distributed Computing. SIROCCO 2024: 208-225 - Anaïs Durand, Michel Raynal, Gadi Taubenfeld:
Better Sooner Rather Than Later. SIROCCO 2024: 226-237 - Panagiota Fatourou, Nikos Giachoudis, George Mallis:
Highly-Efficient Persistent FIFO Queues. SIROCCO 2024: 238-261 - Hugo Rincon Galeana, Ulrich Schmid:
Network Abstractions for Characterizing Communication Requirements in Asynchronous Distributed Systems. SIROCCO 2024: 501-506 - Magnús M. Halldórsson, Dror Rawitz:
Distributed Fractional Local Ratio and Independent Set Approximation. SIROCCO 2024: 281-299 - Saswata Jana, Giuseppe F. Italiano, Manas Jyoti Kashyop, Athanasios L. Konstantinidis, Evangelos Kosinas, Partha Sarathi Mandal:
Online Drone Scheduling for Last-Mile Delivery. SIROCCO 2024: 488-493 - Hongyan Ji, Sriram V. Pemmaraju:
Towards Singular Optimality in the Presence of Local Initial Knowledge. SIROCCO 2024: 300-317 - Colette Johnen, Adnane Khattabi, Alessia Milani, Jennifer L. Welch:
Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers. SIROCCO 2024: 318-335 - Lucianna Kiffer, Rajmohan Rajaraman:
Stability of P2P Networks Under Greedy Peering. SIROCCO 2024: 359-383 - Irina Kostitsyna, David Liedtke, Christian Scheideler:
Universal Coating by 3D Hybrid Programmable Matter. SIROCCO 2024: 384-401 - Vasiliki Liagkou, Panagiotis E. Nastou, Paul G. Spirakis, Yannis C. Stamatiou:
On the Existence of Consensus Converging Organized Groups in Large Social Networks. SIROCCO 2024: 507-512 - Henrik Lievonen, Timothé Picavet, Jukka Suomela:
Distributed Binary Labeling Problems in High-Degree Graphs. SIROCCO 2024: 402-419 - Vignesh Manoharan, Vijaya Ramachandran:
Computing Replacement Paths in the CONGEST Model. SIROCCO 2024: 420-437 - Keita Nakajima, Kaito Takase, Koichi Wada:
Efficient Self-stabilizing Simulations of Energy-Restricted Mobile Robots by Asynchronous Luminous Mobile Robots. SIROCCO 2024: 494-500 - Gadi Taubenfeld:
Reaching Agreement Among k out of n Processes. SIROCCO 2024: 438-455 - Guillermo Toyos-Marfurt, Petr Kuznetsov:
On the Bit Complexity of Iterated Memory. SIROCCO 2024: 456-477
skipping 740 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-11-10 07:46 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:
