Остановите войну!
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 61 matches
- 2017
- Trevor Brown, Srivatsan Ravi:
Cost of Concurrency in Hybrid Transactional Memory. DISC 2017: 9:1-9:16 - Ittai Abraham, Srinivas Devadas, Kartik Nayak, Ling Ren:
Brief Announcement: Practical Synchronous Byzantine Consensus. DISC 2017: 41:1-41:4 - Yehuda Afek, Yuval Emek, Noa Kolikant:
Brief Announcement: The Synergy of Finite State Machines. DISC 2017: 42:1-42:3 - Maya Arbel-Raviv, Trevor Brown:
Reuse, Don't Recycle: Transforming Lock-Free Algorithms That Throw Away Descriptors. DISC 2017: 4:1-4:16 - Chen Avin, Kaushik Mondal, Stefan Schmid:
Demand-Aware Network Designs of Bounded Degree. DISC 2017: 5:1-5:16 - Alkida Balliu, Pierre Fraigniaud:
Certification of Compact Low-Stretch Routing Schemes. DISC 2017: 6:1-6:16 - Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, Christoph Lenzen:
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. DISC 2017: 7:1-7:16 - Lélia Blin, Sébastien Tixeuil:
Brief Announcement: Compact Self-Stabilizing Leader Election in Arbitrary Graphs. DISC 2017: 43:1-43:3 - Sébastien Bouchard, Marjorie Bournat, Yoann Dieudonné, Swan Dubois, Franck Petit:
Asynchronous Approach in the Plane: A Deterministic Polynomial Algorithm. DISC 2017: 8:1-8:16 - Karl Bringmann, Sebastian Krinninger:
Brief Announcement: A Note on Hardness of Diameter Approximation. DISC 2017: 44:1-44:3 - Christian Cachin, Marko Vukolic:
Blockchain Consensus Protocols in the Wild (Keynote Talk). DISC 2017: 1:1-1:16 - Irina Calciu, Siddhartha Sen, Mahesh Balakrishnan, Marcos K. Aguilera:
Brief Announcement: Black-Box Concurrent Data Structures for NUMA Architectures. DISC 2017: 45:1-45:3 - Keren Censor-Hillel, Seri Khoury, Ami Paz:
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model. DISC 2017: 10:1-10:16 - Keren Censor-Hillel, Merav Parter, Gregory Schwartzman:
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions. DISC 2017: 11:1-11:16 - David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg:
On the Number of Objects with Distinct Power and the Linearizability of Set Agreement Objects. DISC 2017: 12:1-12:14 - Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar:
Brief Announcement: Crash-Tolerant Consensus in Directed Graph Revisited. DISC 2017: 46:1-46:4 - Andrea Clementi, Luciano Gualà, Francesco Pasquale, Giacomo Scornavacca:
Brief Announcement: On the Parallel Undecided-State Dynamics with Two Colors. DISC 2017: 47:1-47:4 - Colin Cooper, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga:
Fast Plurality Consensus in Regular Expanders. DISC 2017: 13:1-13:16 - Ryota Eguchi, Taisuke Izumi:
Brief Announcement: Fast Aggregation in Population Protocols. DISC 2017: 49:1-49:3 - Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina, Pedro Montealegre, Dennis Olivetti, Rotem Oshman, Ivan Rapaport, Ioan Todinca:
Three Notes on Distributed Property Testing. DISC 2017: 15:1-15:30 - Laurent Feuilloley, Pierre Fraigniaud:
Error-Sensitive Proof-Labeling Schemes. DISC 2017: 16:1-16:15 - Manuela Fischer:
Improved Deterministic Distributed Matching via Rounding. DISC 2017: 17:1-17:15 - Manuela Fischer, Mohsen Ghaffari:
Sublogarithmic Distributed Algorithms for Lovász Local Lemma, and the Complexity Hierarchy. DISC 2017: 18:1-18:16 - Michal Friedman, Maurice Herlihy, Virendra J. Marathe, Erez Petrank:
Brief Announcement: A Persistent Lock-Free Queue for Non-Volatile Memory. DISC 2017: 50:1-50:4 - Matthias Függer, Thomas Nowak, Manfred Schwarz:
Brief Announcement: Lower Bounds for Asymptotic Consensus in Dynamic Networks. DISC 2017: 51:1-51:3 - Vijay K. Garg:
Brief Announcement: Applying Predicate Detection to the Stable Marriage Problem. DISC 2017: 52:1-52:3 - Rati Gelashvili, Idit Keidar, Alexander Spiegelman, Roger Wattenhofer:
Brief Announcement: Towards Reduced Instruction Sets for Synchronization. DISC 2017: 53:1-53:4 - Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto:
Improved Distributed Degree Splitting and Edge Coloring. DISC 2017: 19:1-19:15 - Mohsen Ghaffari, Christiana Lymouri:
Simple and Near-Optimal Distributed Coloring for Sparse Graphs. DISC 2017: 20:1-20:14 - Mohsen Ghaffari, Merav Parter:
Near-Optimal Distributed DFS in Planar Graphs. DISC 2017: 21:1-21:16
skipping 31 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-04-25 10:49 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