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 51 matches
- 2019
- Ruslan Nikolaev:
A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue. DISC 2019: 28:1-28:16 - James Aspnes, Heyang Er:
Consensus with Max Registers. DISC 2019: 1:1-1:9 - Hagit Attiya, Constantin Enea:
Putting Strong Linearizability in Context: Preserving Hyperproperties in Programsthat Use Concurrent Objects. DISC 2019: 2:1-2:17 - Chen Avin, Iosif Salem, Stefan Schmid:
Brief Announcement: On Self-Adjusting Skip List Networks. DISC 2019: 35:1-35:3 - Mirza Ahad Baig, Danny Hendler, Alessia Milani, Corentin Travers:
Long-Lived Counters with Polylogarithmic Amortized Step Complexity. DISC 2019: 3:1-3:16 - Ruben Becker, Yuval Emek, Mohsen Ghaffari, Christoph Lenzen:
Distributed Algorithms for Low Stretch Spanning Trees. DISC 2019: 4:1-4:14 - Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh:
Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring. DISC 2019: 36:1-36:3 - Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Optimal Distributed Covering Algorithms. DISC 2019: 5:1-5:15 - Ran Ben-Basat, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Parameterized Distributed Algorithms. DISC 2019: 6:1-6:16 - Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten:
Message Reduction in the LOCAL Model Is a Free Lunch. DISC 2019: 7:1-7:15 - Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder:
Brief Announcement: Memory Lower Bounds for Self-Stabilization. DISC 2019: 37:1-37:3 - Grégoire Bonin, Achour Mostéfaoui, Matthieu Perrin:
Brief Announcement: Wait-Free Universality of Consensus in the Infinite Arrival Model. DISC 2019: 38:1-38:3 - Mark Braverman, Gillat Kol, Rotem Oshman, Avishay Tal:
On the Computational Power of Radio Channels. DISC 2019: 8:1-8:17 - Janna Burman, Joffroy Beauquier, Devan Sohier:
Space-Optimal Naming in Population Protocols. DISC 2019: 9:1-9:16 - Christian Cachin, Björn Tackmann:
Brief Announcement: Asymmetric Distributed Trust. DISC 2019: 39:1-39:3 - Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Erasure Correction for Noisy Radio Networks. DISC 2019: 10:1-10:17 - Shiri Chechik, Doron Mukhtar:
Reachability and Shortest Paths in the Broadcast CONGEST Model. DISC 2019: 11:1-11:13 - Vicent Cholvi, Antonio Fernández Anta, Chryssis Georgiou, Nicolas C. Nicolaou:
Brief Announcement: Implementing Byzantine Tolerant Distributed Ledger Objects. DISC 2019: 40:1-40:3 - Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky:
On the Round Complexity of Randomized Byzantine Agreement. DISC 2019: 12:1-12:17 - Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz:
Trade-Offs in Distributed Interactive Proofs. DISC 2019: 13:1-13:17 - Xavier Défago, Adam Heriban, Sébastien Tixeuil, Koichi Wada:
Brief Announcement: Model Checking Rendezvous Algorithms for Robots with Lights in Euclidean Space. DISC 2019: 41:1-41:3 - Michael Dinitz, Magnús M. Halldórsson, Calvin Newport, Alex Weaver:
The Capacity of Smartphone Peer-To-Peer Networks. DISC 2019: 14:1-14:17 - Michael Dinitz, Yasamin Nazari:
Brief Announcement: Massively Parallel Approximate Distance Sketches. DISC 2019: 42:1-42:3 - Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada:
Brief Announcement: Neighborhood Mutual Remainder and Its Self-Stabilizing Implementation of Look-Compute-Move Robots. DISC 2019: 43:1-43:3 - Talya Eden, Nimrod Fiat, Orr Fischer, Fabian Kuhn, Rotem Oshman:
Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles. DISC 2019: 15:1-15:16 - Orr Fischer, Rotem Oshman:
A Distributed Algorithm for Directed Minimum-Weight Spanning Tree. DISC 2019: 16:1-16:16 - Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski:
Stable Memoryless Queuing under Contention. DISC 2019: 17:1-17:16 - Mohsen Ghaffari, Julian Portmann:
Improved Network Decompositions Using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond. DISC 2019: 18:1-18:16 - Seth Gilbert, Wei Quan Lim:
Parallel Finger Search Structures. DISC 2019: 20:1-20:18 - Seth Gilbert, James Maguire, Calvin Newport:
On Bioelectric Algorithms. DISC 2019: 19:1-19:17
skipping 21 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-09-28 02:20 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