Остановите войну!
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 43 matches
- 2012
- Kunal Agrawal, Jeremy T. Fineman, Jordan Krage, Charles E. Leiserson, Sivan Toledo:
Cache-conscious scheduling of streaming applications. SPAA 2012: 236-245 - Dan Alistarh, Rachid Guerraoui, Petr Kuznetsov, Giuliano Losa:
On the cost of composing shared-memory algorithms. SPAA 2012: 298-307 - James Aspnes, Hagit Attiya, Keren Censor-Hillel, Danny Hendler:
Lower bounds for restricted-use objects: extended abstract. SPAA 2012: 172-181 - John Augustine, Ioannis Caragiannis, Angelo Fanelli, Christos Kalaitzis:
Enforcing efficient equilibria in network design games via subsidies. SPAA 2012: 277-286 - Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz:
Brief announcement: strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds. SPAA 2012: 77-79 - Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz:
Communication-optimal parallel algorithm for strassen's matrix multiplication. SPAA 2012: 193-204 - Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan:
Allowing each node to communicate only once in a distributed system: shared whiteboard models. SPAA 2012: 11-17 - Guy E. Blelloch, Jeremy T. Fineman, Julian Shun:
Greedy sequential maximal independent set and matching are parallel on average. SPAA 2012: 308-317 - Guy E. Blelloch, Anupam Gupta, Kanat Tangwongsan:
Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design. SPAA 2012: 205-213 - Guy E. Blelloch, Harsha Vardhan Simhadri, Kanat Tangwongsan:
Parallel and I/O efficient set covering algorithms. SPAA 2012: 82-90 - Anastasia Braginsky, Erez Petrank:
A lock-free B+tree. SPAA 2012: 58-67 - Ho-Leung Chan, Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee, Jianqiao Zhu:
Non-clairvoyant weighted flow time scheduling with rejection penalty. SPAA 2012: 246-254 - Aparna Chandramowlishwaran, JeeWhan Choi, Kamesh Madduri, Richard W. Vuduc:
Brief announcement: towards a communication optimal fast multipole method and its implications at exascale. SPAA 2012: 182-184 - Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc:
Time vs. space trade-offs for rendezvous in trees. SPAA 2012: 1-10 - Johannes Dams, Martin Hoefer, Thomas Kesselheim:
Scheduling in wireless networks with rayleigh-fading interference. SPAA 2012: 327-335 - James Alexander Edwards, Uzi Vishkin:
Brief announcement: speedups for parallel graph triconnectivity. SPAA 2012: 190-192 - Ahmed Elnably, Peter J. Varman:
Brief announcement: application-sensitive QoS scheduling in storage servers. SPAA 2012: 185-187 - Moran Feldman, Liane Lewin-Eytan, Joseph Naor:
Hedonic clustering games. SPAA 2012: 267-276 - Elad Gidron, Idit Keidar, Dmitri Perelman, Yonathan Perez:
SALSA: scalable and low synchronization NUMA-aware algorithm for producer-consumer pools. SPAA 2012: 151-160 - Bernhard Haeupler, Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun:
Discovery through gossip. SPAA 2012: 140-149 - Stephan Holzer, Thomas Locher, Yvonne-Anne Pignolet, Roger Wattenhofer:
Deterministic multi-channel information exchange. SPAA 2012: 109-120 - Shane V. Howley, Jeremy Jones:
A non-blocking internal binary search tree. SPAA 2012: 161-171 - Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv:
Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters. SPAA 2012: 255-266 - Klaus Jansen:
A(3/2+ε) approximation algorithm for scheduling moldable and non-moldable parallel tasks. SPAA 2012: 224-235 - Barbara Kempkes, Peter Kling, Friedhelm Meyer auf der Heide:
Optimal and competitive runtime bounds for continuous, local gathering of mobile robots. SPAA 2012: 18-26 - Doug Lea:
Abstraction failures in concurrent programming. SPAA 2012: 150 - I-Ting Angelina Lee, Aamir Shafi, Charles E. Leiserson:
Memory-mapping support for reducer hyperobjects. SPAA 2012: 287-297 - Henry Lin, Frans Schalekamp:
Brief announcement: on the complexity of the minimum latency scheduling problem on the euclidean plane. SPAA 2012: 80-81 - Yujie Liu, Stephan Diestelhorst, Michael F. Spear:
Delegation and nesting in best-effort hardware transactional memory. SPAA 2012: 38-47 - Adrian Ogierman, Robert Elsässer:
The impact of the power law exponent on the behavior of a dynamic epidemic type process. SPAA 2012: 131-139
skipping 13 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 06:53 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