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 56 matches
- 2020
- Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, Jara Uitto:
Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping. DISC 2020: 40:1-40:3 - Sebastian Brandt, Julian Portmann, Jara Uitto:
Tight Bounds for Deterministic High-Dimensional Grid Exploration. DISC 2020: 13:1-13:16 - Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang:
Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case Latency. DISC 2020: 47:1-47:3 - Dolev Adas, Roy Friedman:
Brief Announcement: Jiffy: A Fast, Memory Efficient, Wait-Free Multi-Producers Single-Consumer Queue. DISC 2020: 50:1-50:3 - Mohamad Ahmadi, Fabian Kuhn:
Distributed Maximum Matching Verification in CONGEST. DISC 2020: 37:1-37:18 - Vitaly Aksenov, Dan Alistarh, Alexandra Drozdova, Amirkeivan Mohtashami:
The Splay-List: A Distribution-Adaptive Concurrent Skip-List. DISC 2020: 3:1-3:18 - Talley Amir, James Aspnes, David Doty, Mahsa Eftekhari, Eric E. Severson:
Message Complexity of Population Protocols. DISC 2020: 6:1-6:18 - Sepehr Assadi, Aaron Bernstein, Zachary Langley:
Improved Bounds for Distributed Load Balancing. DISC 2020: 1:1-1:15 - John Augustine, Valerie King, Anisur Rahaman Molla, Gopal Pandurangan, Jared Saia:
Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols. DISC 2020: 31:1-31:19 - Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jukka Suomela:
Classification of Distributed Binary Labeling Problems. DISC 2020: 17:1-17:17 - Aurélien Bellet, Rachid Guerraoui, Hadrien Hendrikx:
Who Started This Rumor? Quantifying the Natural Differential Privacy of Gossip Protocols. DISC 2020: 8:1-8:18 - Guy E. Blelloch, Yuanhao Wei:
LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations Using Only Pointer-Width CAS. DISC 2020: 5:1-5:17 - Guy E. Blelloch, Yuanhao Wei:
Brief Announcement: Concurrent Fixed-Size Allocation and Free in Constant Time. DISC 2020: 51:1-51:3 - Manuel Bravo, Gregory V. Chockler, Alexey Gotsman:
Making Byzantine Consensus Live. DISC 2020: 23:1-23:17 - Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, François Le Gall, Dean Leitersdorf, Rotem Oshman:
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. DISC 2020: 33:1-33:17 - Yi-Jun Chang:
The Complexity Landscape of Distributed Locally Checkable Problems on Trees. DISC 2020: 18:1-18:17 - Yi-Jun Chang, Jan Studený, Jukka Suomela:
Brief Announcement: Distributed Graph Problems Through an Automata-Theoretic Lens. DISC 2020: 41:1-41:3 - Bogdan S. Chlebus, Dariusz R. Kowalski, Jan Olkowski:
Fast Agreement in Networks with Byzantine Nodes. DISC 2020: 30:1-30:18 - Da-Jung Cho, Matthias Függer, Corbin Hopper, Manish Kushwaha, Thomas Nowak, Quentin Soubeyran:
Distributed Computation with Continual Population Growth. DISC 2020: 7:1-7:17 - Ashish Choudhury:
Brief Announcement: Optimally-Resilient Unconditionally-Secure Asynchronous Multi-Party Computation Revisited. DISC 2020: 44:1-44:3 - Pierre Civit, Seth Gilbert, Vincent Gramoli:
Brief Announcement: Polygraph: Accountable Byzantine Agreement. DISC 2020: 45:1-45:3 - Shir Cohen, Idit Keidar, Alexander Spiegelman:
Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP. DISC 2020: 25:1-25:17 - Emilio Cruciani, Hlafo Alfie Mimun, Matteo Quattropani, Sara Rizzo:
Brief Announcement: Phase Transitions of the k-Majority Dynamics in a Biased Communication Model. DISC 2020: 42:1-42:3 - Xavier Défago, Yuval Emek, Shay Kutten, Toshimitsu Masuzawa, Yasumasa Tamura:
Communication Efficient Self-Stabilizing Leader Election. DISC 2020: 11:1-11:19 - Yuval Emek, Yuval Gil:
Twenty-Two New Approximate Proof Labeling Schemes. DISC 2020: 20:1-20:14 - Klaus-Tycho Foerster, Juho Hirvonen, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
Brief Announcement: What Can(Not) Be Perfectly Rerouted Locally. DISC 2020: 46:1-46:3 - Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz:
Brief Announcement: Distributed Quantum Proofs for Replicated Data. DISC 2020: 43:1-43:3 - Mohsen Ghaffari, Christoph Grunau, Ce Jin:
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond. DISC 2020: 34:1-34:18 - Diana Ghinea, Martin Hirt, Chen-Da Liu-Zhang:
From Partial to Global Asynchronous Reliable Broadcast. DISC 2020: 29:1-29:16 - George Giakkoupis, Hayk Saribekyan, Thomas Sauerwald:
Spread of Information and Diseases via Random Walks in Sparse Graphs. DISC 2020: 9:1-9:17
skipping 26 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-24 02:08 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