Остановите войну!
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 45 matches
- 2014
- Kunal Agrawal, Jeremy T. Fineman:
Brief announcement: cache-oblivious scheduling of streaming pipelines. SPAA 2014: 79-81 - Kunal Agrawal, Jeremy T. Fineman, Kefu Lu, Brendan Sheridan, Jim Sukha, Robert Utterback:
Provably good scheduling for parallel programs that use data structures through implicit batching. SPAA 2014: 84-95 - Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis:
Ephemeral networks with random availability of links: diameter and connectivity. SPAA 2014: 267-276 - Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli:
A note on multiprocessor speed scaling with precedence constraints. SPAA 2014: 138-142 - Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan:
Simple dynamics for plurality consensus. SPAA 2014: 247-256 - Ioana Oriana Bercea, Navin Goyal, David G. Harris, Aravind Srinivasan:
On computing maximal independent sets of hypergraphs in parallel. SPAA 2014: 42-50 - Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Locality-based network creation games. SPAA 2014: 277-286 - Peter Bodík, Ishai Menache, Joseph Naor, Jonathan Yaniv:
Brief announcement: deadline-aware scheduling of big-data processing jobs. SPAA 2014: 211-213 - André Brinkmann, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, Tim Süß:
Scheduling shared continuous resources on many-cores. SPAA 2014: 128-137 - Victor Bushkov, Dmytro Dziuma, Panagiota Fatourou, Rachid Guerraoui:
The PCL theorem: transactions cannot be parallel, consistent and live. SPAA 2014: 178-187 - Daniel Cederman, Vincenzo Gulisano, Yiannis Nikolakopoulos, Marina Papatriantafilou, Philippas Tsigas:
Brief announcement: concurrent data structures for efficient streaming aggregation. SPAA 2014: 76-78 - Jessica Chang, Samir Khuller, Koyel Mukherjee:
LP rounding and combinatorial algorithms for minimizing active and busy time. SPAA 2014: 118-127 - Khuzaima Daudjee, Shahin Kamali, Alejandro López-Ortiz:
On the online fault-tolerant server consolidation problem. SPAA 2014: 12-21 - Zahra Derakhshandeh, Shlomi Dolev, Robert Gmyr, Andréa W. Richa, Christian Scheideler, Thim Strothmann:
Brief announcement: amoebot - a new model for programmable matter. SPAA 2014: 220-222 - Dave Dice, Alex Kogan, Yossi Lev, Timothy Merrifield, Mark Moir:
Adaptive integration of hardware and software lock elision techniques. SPAA 2014: 188-197 - Dave Dice, Virendra J. Marathe, Nir Shavit:
Brief announcement: persistent unfairness arising from cache residency imbalance. SPAA 2014: 82-83 - Venmugil Elango, Fabrice Rastello, Louis-Noël Pouchet, J. Ramanujam, P. Sadayappan:
On characterizing the data movement complexity of computational DAGs for parallel execution. SPAA 2014: 296-306 - Leah Epstein, Elena Kleiman:
Scheduling selfish jobs on multidimensional parallel machines. SPAA 2014: 108-117 - Seth Gilbert, Valerie King, Seth Pettie, Ely Porat, Jared Saia, Maxwell Young:
(Near) optimal resource-competitive broadcast with jamming. SPAA 2014: 257-266 - Mohammad Taghi Hajiaghayi, Theodore Johnson, Mohammad Reza Khani, Barna Saha:
Hierarchical graph partitioning. SPAA 2014: 51-60 - William Hasenplaugh, Tim Kaler, Tao B. Schardl, Charles E. Leiserson:
Ordering heuristics for parallel graph coloring. SPAA 2014: 166-177 - Muhammad Amber Hassaan, Donald Nguyen, Keshav Pingali:
Brief announcement: parallelization of asynchronous variational integrators forshared memory architectures. SPAA 2014: 214-216 - Torsten Hoefler, Grzegorz Kwasniewski:
Automatic complexity analysis of explicitly parallel programs. SPAA 2014: 226-235 - Xiaocheng Hu, Yufei Tao, Yi Yang, Shuigeng Zhou:
Finding approximate partitions and splitters in external memory. SPAA 2014: 287-295 - Sungjin Im, Benjamin Moseley, Kirk Pruhs, Eric Torng:
Competitively scheduling tasks with intermediate parallelizability. SPAA 2014: 22-29 - Joseph Izraelevitz, Michael L. Scott:
Brief announcement: fast dual ring queues. SPAA 2014: 73-75 - Jiayang Jiang, Michael Mitzenmacher, Justin Thaler:
Parallel peeling algorithms. SPAA 2014: 319-330 - Tim Kaler, William Hasenplaugh, Tao B. Schardl, Charles E. Leiserson:
Executing dynamic data-graph computations deterministically using chromatic scheduling. SPAA 2014: 154-165 - David Klaftenegger, Konstantinos Sagonas, Kjell Winblad:
Brief announcement: queue delegation locking. SPAA 2014: 70-72 - Ioannis Koutis:
Simple parallel and distributed algorithms for spectral graph sparsification. SPAA 2014: 61-66
skipping 15 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-12 15:33 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