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 63 matches
- 2017
- Trevor Brown:
A Template for Implementing Fast Lock-free Trees Using HTM. PODC 2017: 293-302 - Yehuda Afek, James Aspnes, Edo Cohen, Danny Vainstein:
Brief Announcement: Object Oriented Consensus. PODC 2017: 367-369 - Dan Alistarh, Justin Kopinsky, Jerry Li, Giorgi Nadiradze:
The Power of Choice in Priority Scheduling. PODC 2017: 283-292 - James Aspnes:
Clocked Population Protocols. PODC 2017: 431-440 - Alexander Bagnall, Samuel Merten, Gordon Stewart:
Brief Announcement: Certified Multiplicative Weights Update: Verified Learning Without Regret. PODC 2017: 459-461 - Reuven Bar-Yehuda, Keren Censor-Hillel, Mohsen Ghaffari, Gregory Schwartzman:
Distributed Approximation of Maximum Independent Set and Maximum Matching. PODC 2017: 165-174 - Leonid Barenboim, Michael Elkin, Tzalik Maimon:
Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity. PODC 2017: 175-184 - Naama Ben-David, Guy E. Blelloch:
Analyzing Contention and Backoff in Asynchronous Shared Memory. PODC 2017: 53-62 - Benjamin Bengfort, Pete Keleher:
Brief Announcement: Hierarchical Consensus. PODC 2017: 355-357 - Petra Berenbrink, Andrea Clementi, Robert Elsässer, Peter Kling
, Frederik Mallmann-Trenn, Emanuele Natale:
Ignore or Comply?: On Breaking Symmetry in Consensus. PODC 2017: 335-344 - Andreas Bilke, Colin Cooper, Robert Elsässer, Tomasz Radzik:
Brief Announcement: Population Protocols for Leader Election and Exact Majority with O(log2 n) States and O(log2 n) Convergence Time. PODC 2017: 451-453 - Peva Blanchard, El Mahdi El Mhamdi, Rachid Guerraoui, Julien Stainer:
Brief Announcement: Byzantine-Tolerant Machine Learning. PODC 2017: 455-457 - Guy E. Blelloch:
Some Sequential Algorithms are Almost Always Parallel. PODC 2017: 1 - Michael Blondin, Javier Esparza, Stefan Jaax, Philipp J. Meyer:
Towards Efficient Verification of Population Protocols. PODC 2017: 423-430 - Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, Przemyslaw Uznanski:
LCL Problems on Grids. PODC 2017: 101-110 - Karl Bringmann, Ralph Keusch, Johannes Lengler, Yannic Maus, Anisur Rahaman Molla:
Greedy Routing and the Algorithmic Small-World Phenomenon. PODC 2017: 371-380 - L. Elisa Celis, Peter M. Krafft, Nisheeth K. Vishnoi:
A Distributed Learning Dynamics in Social Groups. PODC 2017: 441-450 - Keren Censor-Hillel, Michal Dory:
Brief Announcement: Distributed Approximation for Tree Augmentation. PODC 2017: 199-201 - Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Broadcasting in Noisy Radio Networks. PODC 2017: 33-42 - David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg:
Life Beyond Set Agreement. PODC 2017: 345-354 - Shankha Chatterjee, Wojciech M. Golab:
Brief Announcement: A Probabilistic Performance Model and Tuning Framework for Eventually Consistent Distributed Storage Systems. PODC 2017: 259-261 - Gregory V. Chockler, Alexander Spiegelman:
Space Complexity of Fault-Tolerant Register Emulations. PODC 2017: 83-92 - Natacha Crooks, Youer Pu, Lorenzo Alvisi, Allen Clement:
Seeing is Believing: A Client-Centric Specification of Database Isolation. PODC 2017: 73-82 - Artur Czumaj, Peter Davies:
Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks. PODC 2017: 3-12 - Asa Dan, Rajit Manohar, Yoram Moses:
On Using Time Without Clocks via Zigzag Causality. PODC 2017: 241-250 - Thomas D. Dickerson, Paul Gazzillo, Maurice Herlihy, Eric Koskinen:
Brief Announcement: Proust: A Design Space for Highly-Concurrent Transactional Data Structures. PODC 2017: 251-253 - Thomas D. Dickerson, Paul Gazzillo, Maurice Herlihy, Eric Koskinen:
Adding Concurrency to Smart Contracts. PODC 2017: 303-312 - Shlomi Dolev, Karim Eldefrawy, Juan A. Garay, Muni Venkateswarlu Kumaramangalam, Rafail Ostrovsky, Moti Yung:
Brief Announcement: Secure Self-Stabilizing Computation. PODC 2017: 415-417 - Danny Dolev, Michael Erdmann, Neil Lutz, Michael Schapira, Adva Zair:
Stateless Computation. PODC 2017: 419-421 - Michael Elkin:
A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities. PODC 2017: 157-163
skipping 33 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-06 23: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:
