Data structures design and analysis

Applied Filters

People

Publications

Conferences

Publication Date

8 Results for: Book/Issue: SPAA '91: Proceedings of the third annual ACM symposium on Parallel algorithms and architecturesEdit SearchSave SearchRSS

Searched The ACM Guide to Computing Literature (3,802,497 records)|Limit your search to The ACM Full-Text Collection (772,006 records)

Showing 1 - 8of8 Results

Filters

Select All

Export Citations Save to Binder

per page:

Recency

Article
Free
June 1991
Multisearch techniques for implementing data structures on a mesh-connected computer (preliminary version)
SPAA '91: Proceedings of the third annual ACM symposium on Parallel algorithms and architecturesPages 204–214https://doi.org/10.1145/113379.113398
9
223
Metrics
Total Citations9
Total Downloads223
Last 12 Months27
Last 6 weeks4
View online with eReader
PDF
Article
Free
June 1991
More time-work tradeoffs for parallel graph algorithms
- Thomas H. Spencer
SPAA '91: Proceedings of the third annual ACM symposium on Parallel algorithms and architecturesPages 81–93https://doi.org/10.1145/113379.113387
13
346
Metrics
Total Citations13
Total Downloads346
Last 12 Months30
Last 6 weeks4
View online with eReader
PDF
Article
Free
June 1991
Parallel construction of trees with optimal weighted path length
- Lawrence L. Larmore,
- Teresa M. Przytycka
SPAA '91: Proceedings of the third annual ACM symposium on Parallel algorithms and architecturesPages 71–80https://doi.org/10.1145/113379.113386
10
380
Metrics
Total Citations10
Total Downloads380
Last 12 Months41
Last 6 weeks6
View online with eReader
PDF
Article
Free
June 1991
Fast and reliable parallel hashing
- Holger Bast,
- Torben Hagerup
SPAA '91: Proceedings of the third annual ACM symposium on Parallel algorithms and architecturesPages 50–61https://doi.org/10.1145/113379.113384
32
559
Metrics
Total Citations32
Total Downloads559
Last 12 Months93
Last 6 weeks8
View online with eReader
PDF
Article
Free
June 1991
Optimal speedup for backtrack search on a butterfly network
- Abhiram Ranade
SPAA '91: Proceedings of the third annual ACM symposium on Parallel algorithms and architecturesPages 40–48https://doi.org/10.1145/113379.113383
44
293
Metrics
Total Citations44
Total Downloads293
Last 12 Months46
Last 6 weeks9
View online with eReader
PDF
Article
Free
June 1991
Large-scale sorting in parallel memories (extended abstract)
- Mark H. Nodine,
- Jeffrey Scott Vitter
SPAA '91: Proceedings of the third annual ACM symposium on Parallel algorithms and architecturesPages 29–39https://doi.org/10.1145/113379.113382
23
299
Metrics
Total Citations23
Total Downloads299
Last 12 Months39
Last 6 weeks4
View online with eReader
PDF
Article
Free
June 1991
Randomized sorting and selection on mesh-connected processor arrays (preliminary version)
SPAA '91: Proceedings of the third annual ACM symposium on Parallel algorithms and architecturesPages 17–28https://doi.org/10.1145/113379.113381
26
328
Metrics
Total Citations26
Total Downloads328
Last 12 Months59
Last 6 weeks9
View online with eReader
PDF
Article
Free
June 1991
A comparison of sorting algorithms for the connection machine CM-2
SPAA '91: Proceedings of the third annual ACM symposium on Parallel algorithms and architecturesPages 3–16https://doi.org/10.1145/113379.113380
206
3,131
Metrics
Total Citations206
Total Downloads3,131
Last 12 Months748
Last 6 weeks85
View online with eReader
PDF

Applied Filters

People

Names

Institutions

Authors

Publications

Proceedings/Book Names

All Publications

Media Formats

Publisher

Conferences

Sponsors

Conference Event

Proceedings Series

Publication Date

Multisearch techniques for implementing data structures on a mesh-connected computer (preliminary version)

More time-work tradeoffs for parallel graph algorithms

Parallel construction of trees with optimal weighted path length

Fast and reliable parallel hashing

Optimal speedup for backtrack search on a butterfly network

Large-scale sorting in parallel memories (extended abstract)

Randomized sorting and selection on mesh-connected processor arrays (preliminary version)

A comparison of sorting algorithms for the connection machine CM-2