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 66 matches
- 2011
- Yehuda Afek, Adam Morrison, Guy Wertheim:
From bounded to unbounded concurrency objects and back. PODC 2011: 119-128 - Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, Morteza Zadimoghaddam:
Optimal-time adaptive strong renaming, with applications to counting. PODC 2011: 239-248 - Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker:
Order optimal information spreading using algebraic gossip. PODC 2011: 363-372 - Michael Backes, Matteo Maffei, Kim Pecina:
Securing social networks. PODC 2011: 341-342 - Roberto Baldoni, Silvia Bonomi, Amir Soltani Nezhad:
Validity bound of regular registers with churn and byzantine processes. PODC 2011: 225-226 - Nikhil Bansal, Kang-Won Lee, Viswanath Nagarajan, Murtaza Zafer:
Minimum congestion mapping in a cloud. PODC 2011: 267-276 - Leonid Barenboim, Michael Elkin:
Distributed deterministic edge coloring using bounded neighborhood independence. PODC 2011: 129-138 - Cristina Basescu, Christian Cachin, Ittay Eyal, Robert Haas, Marko Vukolic:
Robust data sharing with key-value stores. PODC 2011: 221-222 - Martin Biely, Peter Robinson, Ulrich Schmid:
Easy impossibility proofs for k-set agreement in message passing systems. PODC 2011: 227-228 - Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport:
Structuring unreliable radio networks. PODC 2011: 79-88 - Graham Cormode, Ke Yi:
Tracking distributed aggregates over time-based sliding windows. PODC 2011: 213-214 - Varsha Dani, Mahnush Movahedi, Yamel Rodriguez, Jared Saia:
Scalable rational secret sharing. PODC 2011: 187-196 - Seda Davtyan, Kishori M. Konwar, Alexander A. Shvartsman:
Robust network supercomputing without centralized control. PODC 2011: 293-294 - Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert, Hung Tran-The:
Byzantine agreement with homonyms. PODC 2011: 21-30 - Michael Dinitz, Robert Krauthgamer:
Fault-tolerant spanners: better and simpler. PODC 2011: 169-178 - Dan Dobre, Rachid Guerraoui, Matthias Majuntke, Neeraj Suri, Marko Vukolic:
The complexity of robust atomic storage. PODC 2011: 59-68 - Shlomi Dolev, Panagiota N. Panagopoulou, Mikaël Rabie, Elad Michael Schiller, Paul G. Spirakis:
Rationality authority for provable rational behavior. PODC 2011: 289-290 - Aleksandar Dragojevic, Maurice Herlihy, Yossi Lev, Mark Moir:
On the power of hardware transactional memory to simplify memory management. PODC 2011: 99-108 - Juan A. Garay, Jonathan Katz, Ranjit Kumaresan, Hong-Sheng Zhou:
Adaptively secure broadcast, revisited. PODC 2011: 179-186 - Vijay K. Garg, John Bridgman, Bharath Balasubramanian:
Accurate byzantine agreement with feedback. PODC 2011: 215-216 - Wojciech M. Golab:
A complexity separation between the cache-coherent and distributed shared memory models. PODC 2011: 109-118 - Wojciech M. Golab, Xiaozhou Li, Mehul A. Shah:
Analyzing consistency properties for fun and profit. PODC 2011: 197-206 - Oded Goldreich, Brendan Juba, Madhu Sudan:
A theory of goal-oriented communication. PODC 2011: 299-300 - Mika Göös, Jukka Suomela:
Locally checkable proofs. PODC 2011: 159-168 - Bernhard Haeupler, David R. Karger:
Faster information dissemination in dynamic networks via network coding. PODC 2011: 381-390 - Maryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel:
The space complexity of long-lived and one-shot timestamp implementations. PODC 2011: 139-148 - Maurice Herlihy, Yoram Moses, Mark R. Tuttle:
Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions. PODC 2011: 231-238 - Stephan Holzer, Yvonne-Anne Pignolet, Jasmin Smula, Roger Wattenhofer:
Information dissemination on multiple channels. PODC 2011: 219-220 - Damien Imbs, Sergio Rajsbaum, Michel Raynal:
The universe of symmetry breaking tasks. PODC 2011: 287-288 - Alexander Jaffe, Thomas Moscibroda, Laura Effinger-Dean, Luis Ceze, Karin Strauss:
The impact of memory models on software reliability in multiprocessors. PODC 2011: 89-98
skipping 36 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-25 18:50 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