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 28 matches
- 1999
- Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, Adi Rosén:
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes. SPAA 1999: 1-12 - Adnan Agbaria, Yosi Ben-Asher, Ilan Newman:
Communication-Processor Tradeoffs in Limited Resources PRAM. SPAA 1999: 74-82 - Lauren M. Baptist, Thomas H. Cormen:
Multidimensional, Multiprocessor, Out-of-Core FFTs. SPAA 1999: 242-250 - Rakesh D. Barve, Jeffrey Scott Vitter:
A Simple and Efficient Parallel Disk Mergesort. SPAA 1999: 232-241 - Bruno Beauquier, Stephane Perennes, David Tóth:
All-to-All Routing and Coloring in Weighted Trees of Rings. SPAA 1999: 185-190 - Yosi Ben-Asher, Gadi Haber:
Efficient Parallel Solutions of Linear Algebraic Circuits. SPAA 1999: 212-221 - Petra Berenbrink, Tom Friedetzky, Angelika Steger:
Randomized and Adversarial Load Balancing. SPAA 1999: 175-184 - Petra Berenbrink, Marco Riedel, Christian Scheideler:
Simple Competitive Request Scheduling Strategies. SPAA 1999: 33-42 - Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller:
Tradeoffs Between Parallelism and Fill in Nested Dissection. SPAA 1999: 191-200 - Costas Busch, Maurice Herlihy:
Sorting and Counting Networks of Small Depth and Arbitrary Width. SPAA 1999: 64-73 - Siddhartha Chatterjee, Alvin R. Lebeck, Praveen K. Patnala, Mithuna Thottethodi:
Recursive Array Layouts and Fast Parallel Matrix Multiplication. SPAA 1999: 222-231 - James Demmel:
Making Sparse Matrix Computations Scalable (Invited Talk Abstract). SPAA 1999: 43 - Yefim Dinitz, Shimon Even, Roni Kupershtok, Maria Zapolotsky:
Some Compact Layouts of the Butterfly. SPAA 1999: 54-63 - Phillip B. Gibbons, John L. Bruno, Steven Phillips:
Post-Mortem Black-Box Correctness Tests for Basic Parallel Data Structures. SPAA 1999: 44-53 - Mark W. Goudreau, Kevin J. Lang, Girija J. Narlikar, Satish Rao:
BOS is Boss: A Case for Bulk-Synchronous Object Systems. SPAA 1999: 115-125 - Kostas P. Hatzis, George P. Pentaris, Paul G. Spirakis, Vasilis T. Tampakas, Richard B. Tan:
Fundamental Control Algorithms in Mobile Networks. SPAA 1999: 251-260 - Mark D. Hill, Anne Condon, Manoj Plakal, Daniel J. Sorin:
A System-Level Specification Framework for I/O Architectures. SPAA 1999: 138-147 - Karin Högstedt, Larry Carter, Jeanne Ferrante:
Selecting Tile Shape for Minimal Execution Time. SPAA 1999: 201-211 - Jaeheon Jeong, Michel Dubois:
Optimal Replacements in Caches with Two Miss Costs. SPAA 1999: 155-164 - Christof Krick, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, Matthias Westermann:
Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. SPAA 1999: 165-174 - Bradley C. Kuszmaul, Dana S. Henry, Gabriel H. Loh:
A Comparison of Scalable Superscalar Processors. SPAA 1999: 126-137 - Cheng Liao, Margaret Martonosi, Douglas W. Clark:
Experience with an Adaptive Globally-Synchronizing Clock Algorithm. SPAA 1999: 106-114 - Grégory Mounié, Christophe Rapine, Denis Trystram:
Efficient Approximation Algorithms for Scheduling Malleable Tasks. SPAA 1999: 23-32 - Silvia M. Müller:
On the Scheduling of Variable Latency Functional Units. SPAA 1999: 148-154 - Shailabh Nagar, Ajit Banerjee, Anand Sivasubramaniam, Chita R. Das:
A Closer Look at Coscheduling Approaches for a Network of Workstations. SPAA 1999: 96-105 - Girija J. Narlikar:
Scheduling Threads for Low Space Requirement and Good Locality. SPAA 1999: 83-95 - Huican Zhu, Ben Smith, Tao Yang:
Scheduling Optimization for Resource-Intensive Web Requests on Server Clusters. SPAA 1999: 13-22 - Gary L. Miller, Vijaya Ramachandran:
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '99, Saint-Malo, France, June 27-30, 1999. ACM 1999, ISBN 1-58113-124-0 [contents]
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-09-20 22:54 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