Остановите войну!
for scientists:
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 49 matches
- 2023
- Peter Robinson:
Distributed Sketching Lower Bounds for k-Edge Connected Spanning Subgraphs, BFS Trees, and LCL Problems. DISC 2023: 32:1-32:21 - Ittai Abraham, Danny Dolev, Ittay Eyal, Joseph Y. Halpern:
Colordag: An Incentive-Compatible Blockchain. DISC 2023: 1:1-1:22 - Vitaly Aksenov, Michael Anoprenko, Alexander Fedorov, Michael F. Spear:
Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures. DISC 2023: 35:1-35:7 - Karine Altisen, Pierre Corbineau, Stéphane Devismes:
Certified Round Complexity of Self-Stabilizing Algorithms. DISC 2023: 2:1-2:22 - Ananya Appan, Anirudh Chandramouli, Ashish Choudhury:
Network Agnostic Perfectly Secure MPC Against General Adversaries. DISC 2023: 3:1-3:19 - Hagit Attiya, Armando Castañeda, Thomas Nowak:
Topological Characterization of Task Solvability in General Models of Computation. DISC 2023: 5:1-5:21 - Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum:
One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks. DISC 2023: 4:1-4:23 - Hagit Attiya, Jennifer L. Welch:
Brief Announcement: Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit. DISC 2023: 36:1-36:7 - Sarah Azouvi, Guy Goren, Lioba Heimbach, Alexander Hicks:
Base Fee Manipulation in Ethereum's EIP-1559 Transaction Fee Mechanism. DISC 2023: 6:1-6:22 - Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Gustav Schmid:
On the Node-Averaged Complexity of Locally Checkable Problems on Trees. DISC 2023: 7:1-7:21 - Evangelos Bampas, Joffroy Beauquier, Janna Burman, William Guy-Obé:
Treasure Hunt with Volatile Pheromones. DISC 2023: 8:1-8:21 - Naama Ben-David, Gal Sela, Adriana Szekeres:
The FIDS Theorems: Tensions Between Multinode and Multicore Performance in Transactional Systems. DISC 2023: 9:1-9:24 - Erica Blum, Elette Boyle, Ran Cohen, Chen-Da Liu-Zhang:
Communication Lower Bounds for Cryptographic Broadcast Protocols. DISC 2023: 10:1-10:19 - Mélanie Cambus, Fabian Kuhn, Shreyas Pai, Jara Uitto:
Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem. DISC 2023: 11:1-11:12 - Bernadette Charron-Bost, Louis Penet de Monterno:
Self-Stabilizing Clock Synchronization in Probabilistic Networks. DISC 2023: 12:1-12:18 - Michael Chen, A. Pavan, N. V. Vinodchandran:
Brief Announcement: Relations Between Space-Bounded and Adaptive Massively Parallel Computations. DISC 2023: 37:1-37:7 - Jakeb Chouinard, Kush Kansara, Xialin Liu, Nihal Potdar, Wojciech Golab:
Brief Announcement: On Implementing Wear Leveling in Persistent Synchronization Structures. DISC 2023: 38:1-38:7 - Pierre Civit, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Matteo Monti, Manuel Vidigueira:
Every Bit Counts in Consensus. DISC 2023: 13:1-13:26 - Shir Cohen, Idit Keidar:
Brief Announcement: Subquadratic Multivalued Asynchronous Byzantine Agreement WHP. DISC 2023: 39:1-39:6 - Romain Cosson, Laurent Massoulié, Laurent Viennot:
Efficient Collaborative Tree Exploration with Breadth-First Depth-Next. DISC 2023: 14:1-14:21 - Yannis Coutouly, Emmanuel Godard:
A Topology by Geometrization for Sub-Iterated Immediate Snapshot Message Adversaries and Applications to Set-Agreement. DISC 2023: 15:1-15:20 - Sameep Dahal, Francesco D'Amore, Henrik Lievonen, Timothé Picavet, Jukka Suomela:
Brief Announcement: Distributed Derandomization Revisited. DISC 2023: 40:1-40:5 - Mathilde Déprés, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
Send/Receive Patterns Versus Read/Write Patterns in Crash-Prone Asynchronous Distributed Systems. DISC 2023: 16:1-16:24 - Sahil Dhoked, Wojciech Golab, Neeraj Mittal:
Modular Recoverable Mutual Exclusion Under System-Wide Failures. DISC 2023: 17:1-17:24 - Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin:
Fast Coloring Despite Congested Relays. DISC 2023: 19:1-19:24 - Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Distributed Certification for Classes of Dense Graphs. DISC 2023: 20:1-20:17 - Davide Frey, Mathieu Gestin, Michel Raynal:
The Synchronization Power (Consensus Number) of Access-Control Objects: the Case of AllowList and DenyList. DISC 2023: 21:1-21:23 - Marc Fuchs, Fabian Kuhn:
List Defective Colorings: Distributed Algorithms and Applications. DISC 2023: 22:1-22:23 - Eli Gafni, Giuliano Losa:
Brief Announcement: Byzantine Consensus Under Dynamic Participation with a Well-Behaved Majority. DISC 2023: 41:1-41:7 - Yuval Gelles, Ilan Komargodski:
Brief Announcement: Scalable Agreement Protocols with Optimal Optimistic Efficiency. DISC 2023: 42:1-42:6
skipping 19 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-08-28 09:42 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