Остановите войну!
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 39 matches
- 2006
- Ittai Abraham, Danny Dolev, Rica Gonen, Joseph Y. Halpern:
Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. PODC 2006: 53-62 - Ittai Abraham, Cyril Gavoille:
Object location using path separators. PODC 2006: 188-197 - Yehuda Afek, Eli Gafni, Adam Morrison:
Common2 extended to stacks and unbounded concurrency. PODC 2006: 218-227 - Dana Angluin, James Aspnes, David Eisenstat:
Stably computable predicates are semilinear. PODC 2006: 292-299 - Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir:
Transactional contention management as a non-clairvoyant scheduling problem. PODC 2006: 308-315 - Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kouznetsov:
Synchronizing without locks is inherently expensive. PODC 2006: 300-307 - Yitzhak Birk, Idit Keidar, Liran Liss, Assaf Schuster, Ran Wolff:
Veracity radius: capturing the locality of distributed computations. PODC 2006: 102-111 - Avrim Blum, Eyal Even-Dar, Katrina Ligett:
Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games. PODC 2006: 45-52 - Bogdan Caprita, Jason Nieh, Clifford Stein:
Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling. PODC 2006: 72-81 - Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki:
Adversarial queuing on the multiple-access channel. PODC 2006: 92-101 - Ariel Daliot, Danny Dolev:
Self-stabilizing byzantine agreement. PODC 2006: 143-152 - Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju:
Local approximation schemes for topology control. PODC 2006: 208-217 - Danny Dolev:
Century papers at the first quarter-century milestone. PODC 2006: 3-4 - Rui Fan, Nancy A. Lynch:
An Omega (n log n) lower bound on the cost of mutual exclusion. PODC 2006: 275-284 - Panagiota Fatourou, Nikolaos D. Kallimanis:
Single-scanner multi-writer snapshot implementations are fast! PODC 2006: 228-237 - Matthias Fitzi, Martin Hirt:
Optimally efficient multi-valued byzantine agreement. PODC 2006: 163-168 - Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc:
Oracle size: a new measure of difficulty for communication tasks. PODC 2006: 179-187 - Wojciech M. Golab, Danny Hendler, Philipp Woelfel:
An O(1) RMRs leader election algorithm. PODC 2006: 238-247 - Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Florian Oprea, Michael K. Reiter:
Quorum placement in networks: minimizing network congestion. PODC 2006: 16-25 - Rachid Guerraoui, Maurice Herlihy, Bastian Pochon:
Towards a theory of transactional contention managers. PODC 2006: 316-317 - Rachid Guerraoui, Marko Vukolic:
How fast can a very robust read be? PODC 2006: 248-257 - Maurice Herlihy:
The art of multiprocessor programming. PODC 2006: 1-2 - Dan Holtby, Bruce M. Kapron, Valerie King:
Lower bound for scalable Byzantine Agreement. PODC 2006: 285-291 - Idit Keidar, Roie Melamed, Ariel Orda:
EquiCast: scalable multicast with selfish users. PODC 2006: 63-71 - Idit Keidar, Alexander Shraer:
Timeliness, failure-detectors, and consensus performance. PODC 2006: 169-178 - Jon M. Kleinberg:
Distributed social systems. PODC 2006: 5-6 - Goran Konjevod, Andréa W. Richa, Donglin Xia:
Optimal-stretch name-independent compact routing in doubling metrics. PODC 2006: 198-207 - Chiu-Yuen Koo, Vartika Bhandari, Jonathan Katz, Nitin H. Vaidya:
Reliable broadcast in radio networks: the bounded collision case. PODC 2006: 258-264 - Amos Korman, Shay Kutten:
Distributed verification of minimum spanning trees. PODC 2006: 26-34 - Fabian Kuhn, Roger Wattenhofer:
On the complexity of distributed graph coloring. PODC 2006: 7-15
skipping 9 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-26 18:05 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