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 46 matches
- 1989
- Yehuda Afek, Geoffrey M. Brown, Michael Merritt:
A Lazy Cache Algorithm. SPAA 1989: 209-222 - Alok Aggarwal, Ashok K. Chandra, Marc Snir:
On Communication Latency in PRAM Computations. SPAA 1989: 11-21 - Ajit Agrawal, Guy E. Blelloch, Robert L. Krawitz, C. A. Phillips:
Four Vector-Matrix Primitives. SPAA 1989: 292-302 - Fred S. Annexstein:
Fault Tolerance in Hypercube-Derivative Networks. SPAA 1989: 179-188 - Mikhail J. Atallah, S. Rao Kosaraju, Lawrence L. Larmore, Gary L. Miller, Shang-Hua Teng:
Constructing Trees in Parallel. SPAA 1989: 421-431 - Amotz Bar-Noy, Danny Peleg:
Square Meshes Are Not Always Optimal. SPAA 1989: 138-147 - Doug Baxter, Ravi Mirchandaney, Joel H. Saltz:
Run-Time Parallelization and Scheduling of Loops. SPAA 1989: 303-312 - C. P. Beigel, Clyde P. Kruskal:
Processor Networks and Interconnection Networks Without Long Wires. SPAA 1989: 42-51 - Richard Beigel, S. Rao Kosaraju, Gregory F. Sullivan:
Locating Faults in a Constant Number of Parallel Testing Rounds. SPAA 1989: 189-198 - Stephen J. Bellantoni:
Parallel RAMs with Bounded Memory Wordsize. SPAA 1989: 83-91 - Gianfranco Bilardi, Scot W. Hornick, Majid Sarrafzadeh:
Optimal VLSI Architectures for Multidimensional DFT. SPAA 1989: 265-272 - M. Y. Chan:
Embedding of d-Dimensional Grids into Optimal Hypercubes. SPAA 1989: 52-57 - Marek Chrobak, Joseph Naor:
An Efficient Parallel Algorithm for Computing a Large Independent Set in a Plan Graph. SPAA 1989: 379-387 - Jeff I. Chu, Georg Schnitger:
The Communication Complexity of Several Problems in Matrix Computation. SPAA 1989: 22-31 - Richard Cole, Ofer Zajicek:
The APRAM: Incorporating Asynchrony into the PRAM Model. SPAA 1989: 169-178 - Robert Cypher:
A Lower Bound on the Size of Shellsort Networks. SPAA 1989: 58-63 - Xiaotie Deng:
On the Parallel Complexity of Integer Programming. SPAA 1989: 110-116 - Martin Dietzfelbinger, Friedhelm Meyer auf der Heide:
An Optimal Parallel Dictionary. SPAA 1989: 360-368 - Shimon Even, Burkhard Monien:
On the Number of Rounds Necessary to Disseminate Information. SPAA 1989: 318-327 - Faith E. Fich, Avi Wigderson:
Towards Understanding Exclusive Read. SPAA 1989: 76-82 - Richard Fujimoto:
The Virtual Time Machine. SPAA 1989: 199-208 - Shaodi Gao, Michael Kaufmann, F. Miller Maley:
Advances in Homotopic Layout Compaction. SPAA 1989: 273-282 - Phillip B. Gibbons:
A More practical PRAM Model. SPAA 1989: 158-168 - Michael T. Goodrich:
Intersecting Line Segments in Parallel With an Output-Sensitive Number of Processors. SPAA 1989: 127-137 - Yijie Han:
Matching Partition a Linked List and Its Optimization. SPAA 1989: 246-253 - Scot W. Hornick, Franco P. Preparata:
Deterministic P-RAM Simulation with Constant Redundancy. SPAA 1989: 103-109 - Hermann Jung, Lefteris M. Kirousis, Paul G. Spirakis:
Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Dags with Communication Delays. SPAA 1989: 254-264 - Richard M. Karp, Yanjun Zhang:
On Parallel Evaluation of Game Trees. SPAA 1989: 409-420 - Zvi M. Kedem, Gad M. Landau, Krishna V. Palem:
Optimal Parallel Suffix-Prefix Matching Algorithm and Applications. SPAA 1989: 388-398 - Thomas F. Knight Jr.:
Technologies for Low Latency Interconnection Switches. SPAA 1989: 351-358
skipping 16 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-10-02 23:55 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