![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 35 matches
- 1998
- Micah Adler, Wolfgang Dittrich, Ben H. H. Juurlink, Miroslaw Kutylowski, Ingo Rieping:
Communication-Optimal Parallel Minimum Spanning Tree Algorithms (Extended Abstract). SPAA 1998: 27-36 - Micah Adler, Christian Scheideler:
Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). SPAA 1998: 259-268 - Micah Adler, Ramesh K. Sitaraman
, Arnold L. Rosenberg, Walter Unger:
Scheduling Time-Constrained Communication in Linear Networks. SPAA 1998: 269-278 - Nimar S. Arora, Robert D. Blumofe, C. Greg Plaxton:
Thread Scheduling for Multiprogrammed Multiprocessors. SPAA 1998: 119-129 - Stephan Balev, Patrice Quinton, Sanjay V. Rajopadhye, Tanguy Risset:
Linear Programming Models for Scheduling Systems of Affine Recurrence Equations - A Comparative Study. SPAA 1998: 250-258 - Hannah Bast:
Dynamic Scheduling With Incomplete Information. SPAA 1998: 182-191 - Petra Berenbrink, Tom Friedetzky, Ernst W. Mayr:
Parallel Continuous Randomized Load Balancing (Extended Abstract). SPAA 1998: 192-201 - Guy E. Blelloch, Margaret Reid-Miller:
Fast Set Operations Using Treaps. SPAA 1998: 16-26 - Ying Chen, Marianne Winslett, Yong Cho, Szu-Wen Kuo:
Automatic Parallel I/O Performance Optimization in Panda. SPAA 1998: 108-118 - Guang-Ien Cheng, Mingdong Feng, Charles E. Leiserson, Keith H. Randall, Andrew F. Stark:
Detecting Data Rase in Cilk Programs That use Locks. SPAA 1998: 298-309 - David Wai-Lok Cheung, Kan Hu, Shaowei Xia:
Asynchronous Parallel Algorithm for Mining Association Rules on a Shared-Memory MultiPprocessors. SPAA 1998: 279-288 - Johanne Cohen:
Broadcasting, Multicasting and Gossiping in Trees Under the All-Port Line Model. SPAA 1998: 164-171 - David E. Culler:
High Performance Clusters (Abstract): State of the Art and Challenges Ahead. SPAA 1998: 3 - Artur Czumaj:
Recovery Time of Dynamic Allocation Processes. SPAA 1998: 202-211 - Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari:
Blocking in Parallel Multisearch Problems (Extended Abstract). SPAA 1998: 98-107 - Shimon Even, S. Muthukrishnan, Mike Paterson, Süleyman Cenk Sahinalp:
Layout of the Batcher Bitonic Sorter (Extended Abstract). SPAA 1998: 172-181 - Matteo Frigo, Victor Luchangco:
Computation-Centric Memory Models. SPAA 1998: 240-249 - Hector Garcia-Molina, Wilburt Labio, Janet L. Wiener, Yue Zhuge:
Distributed and Parallel Computing Issues in Data Warehousing (Abstract). SPAA 1998: 77 - Rajnish Ghughal, Abdelillah Mokkedem, Ratan Nalumasu, Ganesh Gopalakrishnan:
Using "Test Model-Checking" to Verify the Runway-PA8000 Memory Model. SPAA 1998: 231-239 - Christopher Ho, Heidi E. Ziegler, Michel Dubois:
In-Memory Directories: Eliminating the Cost of Directories in CC-NUMAs. SPAA 1998: 222-230 - Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis, Moti Yung:
"Dynamic-Fault-Prone BSP": A Paradigm for Robust Computations in Changing Environments. SPAA 1998: 37-46 - Ambrose Kofi Laing, Robert Cypher:
Deadlock-Free Routing in Arbitrary Networks via the Flattest Common Supersequence Method. SPAA 1998: 55-66 - Philip D. MacKenzie, Vijaya Ramachandran:
Computational Bounds for Fundamental Problems on General-Purpose Parallel Models. SPAA 1998: 152-163 - Udi Manber:
How to Find It: Research Issues in Distributed Search (Abstract). SPAA 1998: 4 - Michael Mitzenmacher:
Analyses of Load Stealing Models Based on Differential Equations. SPAA 1998: 212-221 - S. Muthukrishnan, Rajmohan Rajaraman:
An Adversarial Model for Distributed Dynamic Load Balancing. SPAA 1998: 47-54 - Manoj Plakal, Daniel J. Sorin, Anne Condon, Mark D. Hill:
Lamport Clocks: Verifying a Directory Cache-Coherence Protocol. SPAA 1998: 67-76 - Sunil Prabhakar, Divyakant Agrawal, Amr El Abbadi:
Efficient Disk Allocation for Fast Similarity Searching. SPAA 1998: 78-87 - Sanguthevar Rajasekaran:
A Framework for Simple Sorting Algorithms on Parallel Disk Systems (Extended Abstract). SPAA 1998: 88-97 - Kai Shen, Xiangmin Jiao, Tao Yang:
Elimination Forest Guided 2D Sparse LU Factorization. SPAA 1998: 5-15
skipping 5 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-07-25 06:18 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