Остановите войну!
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 49 matches
- 2010
- Kunal Agrawal, I-Ting Angelina Lee, Jim Sukha:
Brief announcement: serial-parallel reciprocity in dynamic multithreaded languages. SPAA 2010: 186-188 - Anastasia Ailamaki:
Database systems in the multicore era. SPAA 2010: 40 - Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Zarko Milosevic, Calvin C. Newport:
Securing every bit: authenticated broadcast in radio networks. SPAA 2010: 50-59 - Noga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Tom Leighton:
Basic network creation games. SPAA 2010: 106-113 - James Aspnes, David Eisenstat, Yitong Yin:
Low-contention data structures. SPAA 2010: 345-354 - Matti Åstrand, Jukka Suomela:
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks. SPAA 2010: 294-302 - Hagit Attiya, Vincent Gramoli, Alessia Milani:
Brief announcement: combine -- an improved directory-based consistency protocol. SPAA 2010: 72-73 - Woongki Baek, Nathan Grasso Bronson, Christos Kozyrakis, Kunle Olukotun:
Implementing and evaluating nested parallel transactions in software transactional memory. SPAA 2010: 253-262 - Michela Becchi, Surendra Byna, Srihari Cadambi, Srimat T. Chakradhar:
Data-aware scheduling of legacy kernels on heterogeneous platforms with distributed memory. SPAA 2010: 82-91 - Anne Benoit, Fanny Dufossé, Matthieu Gallet, Yves Robert, Bruno Gaujal:
Computing the throughput of probabilistic and replicated streaming applications. SPAA 2010: 166-175 - Petra Berenbrink, André Brinkmann, Tom Friedetzky, Lars Nagel:
Balls into bins with related random choices. SPAA 2010: 100-105 - Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri:
Low depth cache-oblivious algorithms. SPAA 2010: 189-199 - Guy E. Blelloch, Kanat Tangwongsan:
Parallel approximation algorithms for facility-location problems. SPAA 2010: 315-324 - Ernie Chan, Robert A. van de Geijn, Andrew Chapman:
Managing the complexity of lookahead for LU factorization with pivoting. SPAA 2010: 200-208 - Ioannis Chatzigiannakis, Georgios Mylonas, Orestis Akribopoulos, Marios Logaras, Panagiotis C. Kokkinos, Paul G. Spirakis:
Brief announcement: fun in numbers - a platform for sensor-based multiplayer pervasive games. SPAA 2010: 76-78 - Jen-Yeu Chen, Gopal Pandurangan:
Optimal gossip-based aggregate computation. SPAA 2010: 124-133 - Phong Chuong, Faith Ellen, Vijaya Ramachandran:
A universal construction for wait-free transaction friendly data structures. SPAA 2010: 335-344 - Bastian Degener, Barbara Kempkes, Friedhelm Meyer auf der Heide:
A local O(n2) gathering algorithm. SPAA 2010: 217-223 - Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec:
Brief announcement: byzantine agreement with homonyms. SPAA 2010: 74-75 - Erik D. Demaine, Morteza Zadimoghaddam:
Scheduling to minimize power consumption using submodular functions. SPAA 2010: 21-29 - David Dice, Yossi Lev, Virendra J. Marathe, Mark Moir, Daniel Nussbaum, Marek Olszewski:
Simplifying concurrent algorithms by exploiting hardware transactional memory. SPAA 2010: 325-334 - David Dice, Nir Shavit:
TLRW: return of the read-write lock. SPAA 2010: 284-293 - Bertrand Ducourthial, Sofiane Khalfallah, Franck Petit:
Best-effort group service in dynamic networks. SPAA 2010: 233-242 - Alexander Fanghänel, Sascha Geulen, Martin Hoefer, Berthold Vöcking:
Online capacity maximization in wireless networks. SPAA 2010: 92-99 - Michael J. Fischer, Xueyuan Su, Yitong Yin:
Assigning tasks for efficiency in Hadoop: extended abstract. SPAA 2010: 30-39 - Geoffrey Charles Fox:
Algorithms and application for grids and clouds. SPAA 2010: 144 - Pierre Fraigniaud, George Giakkoupis:
On the bit communication complexity of randomized rumor spreading. SPAA 2010: 134-143 - Pierre Fraigniaud, Andrzej Pelc:
Delays induce an exponential memory gap for rendezvous in trees. SPAA 2010: 224-232 - Seth Gilbert, Rachid Guerraoui, Faezeh Malakouti Rad, Morteza Zadimoghaddam:
Collaborative scoring with dishonest participants. SPAA 2010: 41-49 - Laura Grigori, Pierre-Yves David, James Demmel, Sylvain Peyronnet:
Brief announcement: Lower bounds on communication for sparse Cholesky factorization of a model problem. SPAA 2010: 79-81
skipping 19 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-24 08:41 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