Остановите войну!
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 82 matches
- 2007
- Ittai Abraham, Mahesh Balakrishnan, Fabian Kuhn, Dahlia Malkhi, Venugopalan Ramasubramanian, Kunal Talwar:
Reconstructing approximate tree metrics. PODC 2007: 43-52 - Marcos Kawazoe Aguilera, Svend Frølund, Vassos Hadzilacos, Stephanie Lorraine Horn, Sam Toueg:
Abortable and query-abortable objects and their efficient implementation. PODC 2007: 23-32 - Marcos Kawazoe Aguilera, Ram Swaminathan:
Remote storage with byzantine servers. PODC 2007: 312-313 - Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi:
Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions. PODC 2007: 310-311 - Hagit Attiya, Faith Ellen, Panagiota Fatourou:
The complexity of updating multi-writer snapshot objects. PODC 2007: 318-319 - Hagit Attiya, Eshcar Hillel:
The power of DCAS: highly-concurrent software transactional memory. PODC 2007: 342-343 - Baruch Awerbuch, Rohit Khandekar:
Greedy distributed optimization of multi-commodity flows. PODC 2007: 274-283 - Baruch Awerbuch, Rohit Khandekar:
Distributed network monitoring and multicommodity flows: a primal-dual approach. PODC 2007: 284-291 - Baruch Awerbuch, Rohit Khandekar:
Minimizing the total cost of network measurements in a distributed manner: a primal-dual approach. PODC 2007: 354-355 - Baruch Awerbuch, Rohit Khandekar:
On cost sharing mechanisms in the network design game. PODC 2007: 364-365 - Baruch Awerbuch, Aviv Nisgav, Boaz Patt-Shamir:
Asynchronous recommendation systems. PODC 2007: 366-367 - Baruch Awerbuch, Christian Scheideler:
A denial-of-service resistant DHT. PODC 2007: 370-371 - Roberto Baldoni, Kleoni Ioannidou, Alessia Milani:
Solvability of geocasting in mobile ad-hoc networks. PODC 2007: 386-387 - Joffroy Beauquier, Julien Clément, Stéphane Messika, Laurent Rosaz, Brigitte Rozoy:
Self-stabilizing counting in mobile sensor networks. PODC 2007: 396-397 - Martin Biely, Josef Widder, Bernadette Charron-Bost, Antoine Gaillard, Martin Hutle, André Schiper:
Tolerating corrupted communication. PODC 2007: 244-253 - Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti:
An algorithm composition scheme preserving monotonicity. PODC 2007: 360-361 - Anat Bremler-Barr, Nir Chen, Jussi Kangasharju, Osnat Mokryn, Yuval Shavitt:
Bringing order to BGP: decreasing time and message complexity. PODC 2007: 368-369 - Alex Brodsky, Dmitry Brodsky:
Trinity: distributed defense against transient spam-bots. PODC 2007: 378-379 - Costas Busch, Ryan LaFortune, Srikanta Tirthapura:
Improved sparse covers for graphs excluding a fixed minor. PODC 2007: 61-70 - Christian Cachin, Abhi Shelat, Alexander Shraer:
Efficient fork-linearizable access to untrusted shared memory. PODC 2007: 129-138 - Lásaro J. Camargos, Rodrigo Schmidt, Fernando Pedone:
Multicoordinated Paxos. PODC 2007: 316-317 - James Caverlee, Ling Liu:
Countering web spam with credibility-based link analysis. PODC 2007: 157-166 - Augustin Chaintreau:
Sharpness, a tight condition for throughput scalability. PODC 2007: 346-347 - Tushar Deepak Chandra, Robert Griesemer, Joshua Redstone:
Paxos made live: an engineering perspective. PODC 2007: 398-407 - Keke Chen, Ling Liu:
Space adaptation: privacy-preserving multiparty collaborative mining with geometric perturbation. PODC 2007: 324-325 - Wei Chen, Jialin Zhang, Yu Chen, Xuezheng Liu:
Partition approach to failure detectors for k-set agreement. PODC 2007: 306-307 - Gregory V. Chockler, Roie Melamed, Yoav Tock, Roman Vitenberg:
Constructing scalable overlays for pub-sub with many topics. PODC 2007: 109-118 - Allen Clement, Jeff Napper, Harry C. Li, Jean-Philippe Martin, Lorenzo Alvisi, Michael Dahlin:
Theory of BAR games. PODC 2007: 358-359 - Andrea E. F. Clementi, Francesco Pasquale, Angelo Monti, Riccardo Silvestri:
Communication in dynamic radio networks. PODC 2007: 205-214 - Edith Cohen, Haim Kaplan:
Summarizing data using bottom-k sketches. PODC 2007: 225-234
skipping 52 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-30 00:58 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