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 33 matches
- 1997
- Micah Adler, Phillip B. Gibbons, Vijaya Ramachandran, Yossi Matias:
Modeling Parallel Bandwidth: Local vs. Global Restrictions. SPAA 1997: 94-105 - Dominique Barth, Pierre Fraigniaud:
Approximation Algorithms for Structured Communication Problems. SPAA 1997: 180-188 - Petra Berenbrink, Friedhelm Meyer auf der Heide, Klaus Schröder:
Allocating Weighted Jobs in Parallel. SPAA 1997: 302-310 - Guy E. Blelloch, Phillip B. Gibbons, Girija J. Narlikar, Yossi Matias:
Space-Efficient Scheduling of Parallelism with Synchronization Variables. SPAA 1997: 12-23 - Guy E. Blelloch, Margaret Reid-Miller:
Pipelining with Futures. SPAA 1997: 249-259 - Brent N. Chun, Alan M. Mainwaring, Saul Schleimer, Daniel Shawcross Wilkerson:
System Area Network Mapping. SPAA 1997: 116-126 - Gene Cooperman, Michael Tselman:
Using Tadpoles to Reduce Memory and Communication Requirements for Exhaustive, Breadth-First Search Using Distributed Computers. SPAA 1997: 231-238 - Suprakash Datta, Ramesh K. Sitaraman:
The Performance of Simple Routing Algorithms That Drop Packets. SPAA 1997: 159-169 - Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson:
Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms. SPAA 1997: 106-115 - Giovanni Della-Libera, Nir Shavit:
Reactive Diffracting Trees. SPAA 1997: 24-32 - Mingdong Feng, Charles E. Leiserson:
Efficient Detection of Determinacy Races in Cilk Programs. SPAA 1997: 1-11 - Michele Flammini, Christian Scheideler:
Simple, Efficient Routing Schemes for All-Optical Networks. SPAA 1997: 170-179 - Melanie L. Fulgham, Lawrence Snyder:
Triplex: A Multi-Class Routing Algorithm. SPAA 1997: 127-138 - Zvi Galil, Jong Geun Park, Kunsoo Park:
Three-Dimensional Pattern Matching. SPAA 1997: 53-62 - Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran:
Can Shared-Memory Model Serve as a Bridging Model for Parallel Computation? SPAA 1997: 72-83 - Jonathan C. Hardwick:
Implementation and Evaluation of an Efficient Parallel Delaunay Triangulation Algorithm. SPAA 1997: 239-248 - Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis:
Efficient Computations on Fault-Prone BSP Machines. SPAA 1997: 84-93 - Ludek Kucera:
Bounds to the Throughput of an Interconnection Network. SPAA 1997: 139-148 - Mauro Leoncini, Giovanni Manzini, Luciano Margara:
On the Parallel Complexity of Matrix Factorization Algorithms. SPAA 1997: 63-71 - Nimrod Megiddo, Vivek Sarkar:
Optimal Weighted Loop Fusion for Parallel Programs. SPAA 1997: 282-291 - Michael Mitzenmacher:
On the Analysis of Randomized Load Balancing Schemes. SPAA 1997: 292-301 - Leonid Oliker, Rupak Biswas:
Efficient Load Balancing and Data Remapping for Adaptive Grid Calculations. SPAA 1997: 33-42 - C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa:
Accessing Nearby Copies of Replicated Objects in a Distributed Environment. SPAA 1997: 311-320 - Parthasarathy Ranganathan, Vijay S. Pai, Sarita V. Adve:
Using Speculative Retirement and Larger Instruction Windows to Narrow the Performance Gap Between Memory Consistency Models. SPAA 1997: 199-210 - Loren Schwiebert:
Deadlock-Free Oblivious Wormhole Routing with Cyclic Dependencies. SPAA 1997: 149-158 - Jop F. Sibeyn:
Better Trade-Offs for Parallel List Ranking. SPAA 1997: 221-230 - Horst D. Simon, Andrew Sohn, Rupak Biswas:
HARP: A Fast Spectral Partitioner. SPAA 1997: 43-52 - Aman Singla, Umakishore Ramachandran, Jessica K. Hodgins:
Temporal Notions of Synchronization and Consistency in Beehive. SPAA 1997: 211-220 - Andrew Sohn, Yuetsu Kodama, Jui Ku, Mitsuhisa Sato, Hirofumi Sakane, Hayato Yamana, Shuichi Sakai, Yoshinori Yamaguchi:
Fine-Grain Multithreading with the EM-X Multiprocessor. SPAA 1997: 189-198 - Xinan Tang, Jing Wang, Kevin B. Theobald, Guang R. Gao:
Thread Partitioning and Scheduling Based on Cost Model. SPAA 1997: 272-281
skipping 3 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-11-25 01:42 CET 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