Остановите войну!
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 62 matches
- 2012
- Clemens P. J. Adolphs, Petra Berenbrink:
Distributed selfish load balancing with weights and speeds. PODC 2012: 135-144 - Adi Akavia, Shafi Goldwasser, Carmit Hazay:
Distributed public key schemes secure against continual leakage. PODC 2012: 155-164 - Hoda Akbari, Petra Berenbrink, Thomas Sauerwald:
A simple approach for adapting continuous load balancing processes to discrete settings. PODC 2012: 271-280 - Heger Arfaoui, Pierre Fraigniaud:
Brief announcement: what can be computed without communication? PODC 2012: 87-88 - Eyjolfur Ingi Asgeirsson, Magnús M. Halldórsson, Pradipta Mitra:
Brief announcement: distributed algorithms for throughput performance in wireless networks. PODC 2012: 89-90 - James Aspnes:
Faster randomized consensus with an oblivious adversary. PODC 2012: 1-8 - James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen:
Faster than optimal snapshots (for a while): preliminary version. PODC 2012: 375-384 - Michael Backes, Fabian Bendun, Aniket Kate:
Brief announcement: distributed cryptography using trinc. PODC 2012: 91-92 - Petra Berenbrink, Colin Cooper, Tom Friedetzky:
Random walks which prefer unvisited edges.: exploring high girth even degree expanders in linear time. PODC 2012: 29-36 - Vita Bortnikov, Gregory V. Chockler, Dmitri Perelman, Alexey Roytman, Shlomit Shachor, Ilya Shnayderman:
Brief announcement: reconfigurable state machine replication from non-reconfigurable building blocks. PODC 2012: 93-94 - John Bridgman, Vijay K. Garg:
Brief announcement: all-to-all gradecast using coding with byzantine failures. PODC 2012: 95-96 - Victor Bushkov, Rachid Guerraoui, Michal Kapalka:
On the liveness of transactional memory. PODC 2012: 9-18 - Armando Castañeda, Sergio Rajsbaum, Michel Raynal:
Brief announcement: there are plenty of tasks weaker than perfect renaming and stronger than set agreement. PODC 2012: 97-98 - Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita:
Brief announcement: waiting in dynamic networks. PODC 2012: 99-100 - Venkatesan T. Chakaravarthy, Sambuddha Roy, Yogish Sabharwal:
Distributed algorithms for scheduling on line and tree networks. PODC 2012: 345-354 - Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gibbons:
The cost of fault tolerance in multi-party communication complexity. PODC 2012: 57-66 - Ashish Choudhury:
Brief announcement: optimal amortized secret sharing with cheater identification. PODC 2012: 101-102 - Ashish Choudhury, Arpita Patra:
Brief announcement: efficient optimally resilient statistical AVSS and its applications. PODC 2012: 103-104 - Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Ángel Sánchez:
Brief announcement: achieving reliability in master-worker computing via evolutionary dynamics. PODC 2012: 225-226 - Allen Clement, Flavio Junqueira, Aniket Kate, Rodrigo Rodrigues:
On the (limited) power of non-equivocation. PODC 2012: 301-308 - Andrea Clementi, Riccardo Silvestri, Luca Trevisan:
Information spreading in dynamic graphs. PODC 2012: 37-46 - Alejandro Cornejo, Nancy A. Lynch, Srikanth Sastry:
Asynchronous failure detectors. PODC 2012: 243-252 - Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik:
Coalescing random walks and voting on graphs. PODC 2012: 47-56 - Alejandro Cornejo, Seth Gilbert, Calvin C. Newport:
Aggregation in dynamic networks. PODC 2012: 195-204 - Varsha Dani, Valerie King, Mahnush Movahedi, Jared Saia:
Brief announcement: breaking the O(nm) bit barrier, secure multiparty computation with a static adversary. PODC 2012: 227-228 - Sebastian Daum, Seth Gilbert, Fabian Kuhn, Calvin C. Newport:
Leader election in shared spectrum radio networks. PODC 2012: 215-224 - Seda Davtyan, Kishori M. Konwar, Alexander A. Shvartsman:
Brief announcement: decentralized network supercomputing in the presence of malicious and crash-prone workers. PODC 2012: 231-232 - Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov:
Wait-freedom with advice. PODC 2012: 105-114 - Oksana Denysyuk, Luís E. T. Rodrigues:
Brief announcement: order-preserving renaming in synchronous message passing systems with byzantine faults. PODC 2012: 233-234 - Andrew Drucker, Fabian Kuhn, Rotem Oshman:
The communication complexity of distributed task allocation. PODC 2012: 67-76
skipping 32 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-05-20 12: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