Остановите войну!
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 47 matches
- 2007
- Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder:
Strong-diameter decompositions of minor free graphs. SPAA 2007: 16-24 - Shivali Agarwal, Rajkishore Barik, Dan Bonachea, Vivek Sarkar, R. K. Shyamasundar, Katherine A. Yelick:
Deadlock-free scheduling of X10 computations with bounded resources. SPAA 2007: 229-240 - Deepak Ajwani, Khaled M. Elbassioni, Sathish Govindarajan, Saurabh Ray:
Conflict-free coloring for rectangle ranges using O(n.382) colors. SPAA 2007: 181-187 - Susanne Albers, Fabian Müller, Swen Schmelzer:
Speed scaling on parallel processors. SPAA 2007: 289-298 - Eric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia:
On the truthfulness and the approximation for scheduling selfish tasks. SPAA 2007: 196-197 - Baruch Awerbuch, Thomas P. Hayes:
Online collaborative filtering with nearly optimal dynamic regret. SPAA 2007: 315-319 - Yossi Azar, Iftah Gamzu, Shai Gutner:
Truthful unsplittable flow for large capacity networks. SPAA 2007: 320-329 - Woongki Baek, JaeWoong Chung, Chi Cao Minh, Christos Kozyrakis, Kunle Olukotun:
Towards soft optimization techniques for parallel cognitive applications. SPAA 2007: 59-60 - Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky:
Weakening the online adversary just enough to get optimal conflict-free colorings for intervals. SPAA 2007: 194-195 - Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari:
Optimal sparse matrix dense vector multiplication in the I/O-model. SPAA 2007: 61-70 - Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, Jelani Nelson:
Cache-oblivious streaming B-trees. SPAA 2007: 81-92 - Michael A. Bender, Cynthia A. Phillips:
Scheduling DAGs on asynchronous processors. SPAA 2007: 35-45 - Petra Berenbrink, Colin Cooper, Zengjian Hu:
Energy efficient randomised communication in unknown AdHoc networks. SPAA 2007: 250-259 - Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar:
Packing to angles and sectors. SPAA 2007: 171-180 - Jeffery A. Brown, Rakesh Kumar, Dean M. Tullsen:
Proximity-aware directory-based coherence for multi-core processor architectures. SPAA 2007: 126-134 - Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang:
Online frequency allocation in cellular networks. SPAA 2007: 241-249 - Ernie Chan, Enrique S. Quintana-Ortí, Gregorio Quintana-Ortí, Robert A. van de Geijn:
Supermatrix out-of-order scheduling of matrix operations for SMP and multi-core architectures. SPAA 2007: 116-125 - Shimin Chen, Phillip B. Gibbons, Michael Kozuch, Vasileios Liaskovitis, Anastassia Ailamaki, Guy E. Blelloch, Babak Falsafi, Limor Fix, Nikos Hardavellas, Todd C. Mowry, Chris Wilkerson:
Scheduling threads for constructive cache sharing on CMPs. SPAA 2007: 105-115 - Rezaul Alam Chowdhury, Vijaya Ramachandran:
The cache-oblivious gaussian elimination paradigm: theoretical framework, parallelization and experimental evaluation. SPAA 2007: 71-80 - Erik D. Demaine, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam:
Scheduling to minimize gaps and power consumption. SPAA 2007: 46-54 - Jack J. Dongarra, Emmanuel Jeannot, Erik Saule, Zhiao Shi:
Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems. SPAA 2007: 280-288 - John R. Douceur, Jay R. Lorch, Thomas Moscibroda:
Maximizing total upload in latency-sensitive P2P applications. SPAA 2007: 270-279 - Miroslaw Dynia, Jaroslaw Kutylowski, Friedhelm Meyer auf der Heide, Jonas Schrieb:
Local strategies for maintaining a chain of relay stations between an explorer and a base station. SPAA 2007: 260-269 - Angelo Fanelli, Michele Flammini, Luca Moscardelli:
On the convergence of multicast games in directed networks. SPAA 2007: 330-338 - Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker:
Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier. SPAA 2007: 1-7 - Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar:
Local MST computation with short advice. SPAA 2007: 154-160 - Timothy Furtak, José Nelson Amaral, Robert Niewiadomski:
Using SIMD registers and instructions to enable instruction-level parallelism in sorting algorithms. SPAA 2007: 348-357 - Benoît Hudson, Gary L. Miller, Todd Phillips:
Sparse parallel Delaunay mesh refinement. SPAA 2007: 339-347 - Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe:
A tight bound on online buffer management for two-port shared-memory switches. SPAA 2007: 358-364 - Robert Krauthgamer:
On triangulation of simple networks. SPAA 2007: 8-15
skipping 17 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-06-01 07:23 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