Остановите войну!
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
- 2009
- Heiner Ackermann, Simon Fischer, Martin Hoefer, Marcel Schöngens:
Distributed algorithms for QoS load balancing. SPAA 2009: 197-203 - Sarita V. Adve:
Memory models: a case for rethinking parallel languages and hardware. SPAA 2009: 45 - Kunal Agrawal, Anne Benoit, Fanny Dufossé, Yves Robert:
Mapping filtering streaming applications with communication costs. SPAA 2009: 19-28 - Marcos Kawazoe Aguilera, Ram Swaminathan:
Remote storage with byzantine servers. SPAA 2009: 280-289 - Hagit Attiya, Eshcar Hillel, Alessia Milani:
Inherent limitations on disjoint-access parallel implementations of transactional memory. SPAA 2009: 69-78 - Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda, Prasad Raghavendra:
Buffer management for colored packets with deadlines. SPAA 2009: 319-327 - Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz:
Communication-optimal parallel and sequential Cholesky decomposition: extended abstract. SPAA 2009: 245-252 - MohammadHossein Bateni, Lukasz Golab, Mohammad Taghi Hajiaghayi, Howard J. Karloff:
Scheduling to minimize staleness and stretch in real-time data warehouses. SPAA 2009: 29-38 - Matthias Baumgart, Christian Scheideler, Stefan Schmid:
A DoS-resilient information system for dynamic data management. SPAA 2009: 300-309 - Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri:
Brief announcement: low depth cache-oblivious sorting. SPAA 2009: 121-123 - Aydin Buluç, Jeremy T. Fineman, Matteo Frigo, John R. Gilbert, Charles E. Leiserson:
Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks. SPAA 2009: 233-244 - George C. Caragea, A. Beliz Saybasili, Xingzhi Wen, Uzi Vishkin:
Brief announcement: performance potential of an easy-to-program PRAM-on-chip prototype versus state-of-the-art processor. SPAA 2009: 163-165 - Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs:
Speed scaling of processes with arbitrary speedup curves on a multiprocessor. SPAA 2009: 1-10 - Bernadette Charron-Bost, Antoine Gaillard, Jennifer L. Welch, Josef Widder:
Routing without ordering. SPAA 2009: 145-153 - Bogdan S. Chlebus, Dariusz R. Kowalski:
Locally scalable randomized consensus for synchronous crash failures. SPAA 2009: 290-299 - Aleksandar Dragojevic, Yang Ni, Ali-Reza Adl-Tabatabai:
Optimizing transactions for captured memory. SPAA 2009: 214-222 - Raphael Eidenbenz, Roger Wattenhofer:
Brief announcement: selfishness in transactional memory. SPAA 2009: 41-42 - Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks:
On the complexity of the regenerator placement problem in optical networks. SPAA 2009: 154-162 - Patrik Floréen, Joel Kaasinen, Petteri Kaski, Jukka Suomela:
An optimal local approximation algorithm for max-min linear programs. SPAA 2009: 260-269 - Pierre Fraigniaud, Amos Korman:
On randomized representations of graphs using short labels. SPAA 2009: 131-137 - Matteo Frigo, Pablo Halpern, Charles E. Leiserson, Stephen Lewin-Berlin:
Reducers and other Cilk++ hyperobjects. SPAA 2009: 79-90 - Gero Greiner, Tim Nonner, Alexander Souza:
The bell is ringing in speed-scaled multiprocessor scheduling. SPAA 2009: 11-18 - Bruce Hendrickson:
Emerging challenges and opportunities in parallel computing: the cretaceous redux? SPAA 2009: 130 - Weirong Jiang, Viktor K. Prasanna:
Field-split parallel architecture for high performance multi-match packet classification using FPGAs. SPAA 2009: 188-196 - Flavio Paiva Junqueira, Benjamin C. Reed:
The life and times of a zookeeper. SPAA 2009: 46 - Idit Keidar, Dmitri Perelman:
On avoiding spare aborts in transactional memory. SPAA 2009: 59-68 - Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicolaou, Alexander A. Shvartsman:
At-most-once semantics in asynchronous shared memory. SPAA 2009: 43-44 - Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe:
Competitive buffer management for multi-queue switches in qos networks using packet buffering algorithms. SPAA 2009: 328-336 - Fabian Kuhn:
Weak graph colorings: distributed algorithms and applications. SPAA 2009: 138-144 - Fabian Kuhn, Thomas Locher, Rotem Oshman:
Gradient clock synchronization in dynamic networks. SPAA 2009: 270-279
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-12 01:29 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