Остановите войну!
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 55 matches
- 2014
- Yehuda Afek, Yehonatan Ginzberg, Shir Landau Feibish, Moshe Sulamy:
Distributed computing building blocks for rational agents. PODC 2014: 406-415 - Yehuda Afek, Amir Levy, Adam Morrison:
Software-improved hardware lock elision. PODC 2014: 212-221 - Zahra Aghazadeh, Wojciech M. Golab, Philipp Woelfel:
Making objects writable. PODC 2014: 385-395 - Dan Alistarh, Keren Censor-Hillel, Nir Shavit:
Brief announcement: are lock-free concurrent algorithms practically wait-free? PODC 2014: 50-52 - Dan Alistarh, Oksana Denysyuk, Luís E. T. Rodrigues, Nir Shavit:
Balls-into-leaves: sub-logarithmic renaming in synchronous message-passing systems. PODC 2014: 232-241 - Maya Arbel, Hagit Attiya:
Concurrent updates with RCU: search tree as an example. PODC 2014: 196-205 - Michael Backes, Fabian Bendun, Ashish Choudhury, Aniket Kate:
Asynchronous MPC with a strict honest majority using non-equivocation. PODC 2014: 10-19 - Joshua Baron, Karim El Defrawy, Joshua Lampkins, Rafail Ostrovsky:
How to withstand mobile virus attacks, revisited. PODC 2014: 293-302 - Tushar Bisht, Kishore Kothapalli, Sriram V. Pemmaraju:
Brief announcement: Super-fast t-ruling sets. PODC 2014: 379-381 - Marijke H. L. Bodlaender, Magnús M. Halldórsson:
Beyond geometry: towards fully realistic wireless models. PODC 2014: 347-356 - Joshua Brody, Amit Chakrabarti, Ranganath Kondapally, David P. Woodruff, Grigory Yaroslavtsev:
Beyond set disjointness: the communication complexity of finding the intersection. PODC 2014: 106-113 - Keren Censor-Hillel, Mohsen Ghaffari, Fabian Kuhn:
Distributed connectivity decomposition. PODC 2014: 156-165 - Bapi Chatterjee, Nhan Nguyen Dang, Philippas Tsigas:
Efficient lock-free binary search trees. PODC 2014: 322-331 - Kai-Min Chung, Seth Pettie, Hsin-Hao Su:
Distributed algorithms for the Lovász local lemma and graph coloring. PODC 2014: 134-143 - Edith Cohen:
Estimation for monotone sampling: competitiveness and customization. PODC 2014: 124-133 - Messaoud Doudou, José M. Barceló-Ordinas, Djamel Djenouri, Jorge García-Vidal, Nadjib Badache:
Brief announcement: game theoretical approach for energy-delay balancing in distributed duty-cycled MAC protocols of wireless networks. PODC 2014: 147-152 - Andrew Drucker, Fabian Kuhn, Rotem Oshman:
On the power of the congested clique model. PODC 2014: 367-376 - Michael Elkin, Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan:
Can quantum communication speed up distributed computation? PODC 2014: 166-175 - Faith Ellen, Panagiota Fatourou, Joanna Helga, Eric Ruppert:
The amortized complexity of non-blocking binary search trees. PODC 2014: 332-340 - Yuval Emek, Christoph Pfister, Jochen Seidel, Roger Wattenhofer:
Anonymous networks: randomization = 2-hop coloring. PODC 2014: 96-105 - Ofer Feinerman, Bernhard Haeupler, Amos Korman:
Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication. PODC 2014: 114-123 - Eli Gafni, Petr Kuznetsov, Ciprian Manolescu:
A generalized asynchronous computability theorem. PODC 2014: 222-231 - Juan A. Garay, Clinton Givens, Rafail Ostrovsky, Pavel Raykov:
Fast and unconditionally secure anonymous channel. PODC 2014: 313-321 - Mohsen Ghaffari, Erez Kantor, Nancy A. Lynch, Calvin C. Newport:
Multi-message broadcast with abstract MAC layers and unreliable links. PODC 2014: 56-65 - Mika Göös, Juho Hirvonen, Jukka Suomela:
Linear-in-delta lower bounds in the LOCAL model. PODC 2014: 86-95 - Rachid Guerraoui, Eric Ruppert:
A paradox of eventual linearizability in shared memory. PODC 2014: 40-49 - Bernhard Haeupler, Dahlia Malkhi:
Optimal gossip with direct addressing. PODC 2014: 176-185 - Nir Hemed, Noam Rinetzky:
Brief announcement: concurrency-aware linearizability. PODC 2014: 209-211 - Danny Hendler, Vitaly Khait:
Complexity tradeoffs for read and update operations. PODC 2014: 186-195 - Miikka Hilke, Christoph Lenzen, Jukka Suomela:
Brief announcement: local approximability of minimum dominating set on planar graphs. PODC 2014: 344-346
skipping 25 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-27 05:09 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