![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.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 39 matches
- 1994
- Micah Adler, John W. Byers:
AT2 Bounds for a Class of VLSI Problems and String Matching. SPAA 1994: 140-146 - Hagit Attiya
, Roy Friedman:
Programming DEC-Alpha Based Multiprocessors the Easy Way (Extended Abstract). SPAA 1994: 157-166 - Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg:
Scheduling Trees using FIFO Queues: A Control-Memory Tradeoff. SPAA 1994: 85-93 - Jehoshua Bruck
, Ching-Tien Ho, Shlomo Kipnis, Derrick Weathersby:
Efficient Algorithms for All-to-All Communications in Multi-Port Message-Passing Systems. SPAA 1994: 298-309 - Donald D. Chinn, Frank Thomson Leighton, Martin Tompa:
Minimal Adaptive Routing on the Mesh with Bounded Queue Size. SPAA 1994: 354-363 - Rainer Feldmann, Peter Mysliwietz, Burkhard Monien:
Studying Overheads in Massively Parallel MIN/MAX-Tree Evaluation. SPAA 1994: 94-103 - Perry Fizzano, David R. Karger
, Clifford Stein, Joel Wein:
Job Scheduling in Rings. SPAA 1994: 210-219 - Bhaskar Ghosh, S. Muthukrishnan:
Dynamic Load Balancing in Parallel and Distributed Networks by Random Matchings (Extended Abstract). SPAA 1994: 226-235 - Phillip B. Gibbons, Ephraim Korach:
On Testing Cache-Coherent Shared Memories. SPAA 1994: 177-188 - Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran:
Efficient Low-Contention Parallel Algorithms. SPAA 1994: 236-247 - Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie:
An W(log log n) Lower Bound for Routing in Optical Networks. SPAA 1994: 147-156 - Leslie Ann Goldberg, Yossi Matias, Satish Rao:
An Optical Simulation of Shared Memory. SPAA 1994: 257-267 - John Greiner:
A Comparison of Parallel Algorithms for Connected Components. SPAA 1994: 16-25 - Himanshu Gupta, P. Sadayappan:
Communication Efficient Matrix Multiplication on Hypercubes. SPAA 1994: 320-329 - Shay Halperin, Uri Zwick:
An Optimal Randomized Logarithmic Time Connectivity algorithm for the EREW PRAM (Extended Abstract). SPAA 1994: 1-10 - Susan Hinrichs, Corey Kosak, David R. O'Hallaron, Thomas Stricker, Riichiro Take:
An Architecture for Optimal All-to-All Personalized Communication. SPAA 1994: 310-319 - Doug Ierardi:
2d-Bubblesorting in Average time O(N lg N). SPAA 1994: 36-45 - Smaragda Konstantinidou:
Segment Router: A Novel Router Design for Parallel Computers. SPAA 1994: 364-373 - Clyde P. Kruskal, Kevin J. Rappoport:
Bandwidth-Based Lower Bounds on Slowdown for Efficient Emulations of Fixed-Connection Networks. SPAA 1994: 132-139 - Mauro Leoncini:
How Much Can We Speedup Gaussian Elimination with Pivoting? SPAA 1994: 290-297 - Hui Li, Kenneth C. Sevcik:
Parallel Sorting by Over Partitioning. SPAA 1994: 46-56 - Pangfeng Liu, Sandeep N. Bhatt:
Experiences with Parallel N-Body Simulation. SPAA 1994: 122-131 - Michael Mitzenmacher:
Bounds on the Greedy Routing Algorithm for Array Networks. SPAA 1994: 346-353 - Andrea Pietracaprina, Geppino Pucci
, Jop F. Sibeyn:
Constructive Deterministic PRAM Simulation on a Mesh-Connected Computer. SPAA 1994: 248-256 - Margaret Reid-Miller:
List Ranking and List Scan on the Cray C-90. SPAA 1994: 104-113 - John H. Reif:
O(log² n) Time Efficient Parallel Factorization of Dense, Sparse Separable, and Banded Matrices. SPAA 1994: 278-289 - John H. Reif, Stephen R. Tate:
Dynamic Parallel Tree Contraction (Extended Abstract). SPAA 1994: 114-121 - Todd E. Rockoff:
SIMD Instruction Cache. SPAA 1994: 67-75 - John E. Savage:
A Model for Multi-Grained Parallelism (Extended Abstract). SPAA 1994: 330-335 - Eric J. Schwabe, Ian M. Sutherland:
Improved Parity-Declustered Layouts for Disk Arrays. SPAA 1994: 76-84
skipping 9 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.dagstuhl.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-08-21 18:17 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