An optimal parallel algorithm to construct a deap
From MaRDI portal
Publication:3989753
DOI10.1080/00207169208804050zbMATH Open0742.68015OpenAlexW1987437971MaRDI QIDQ3989753FDOQ3989753
Authors: Stephan Olariu, Zhaofang Wen 
Publication date: 28 June 1992
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169208804050
Recommendations
- Parallel processing of the Build Hull algorithm to address the large-scale DEA problem
- scientific article; zbMATH DE number 2107027
- Parallel algorithm for unconstrained optimization based on decomposition techniques
- An optimal parallel algorithm for the multiselection problem
- scientific article; zbMATH DE number 1294384
- scientific article; zbMATH DE number 3885226
- scientific article; zbMATH DE number 3894470
- Optimal implementation of parallel divide and conquer algorithm on de Bruijn networks
- An optimal parallel connectivity algorithm
- scientific article; zbMATH DE number 4082988
Cites Work
- Faster optimal parallel prefix sums and list ranking
- On the Expected Performance of Scanning Disks
- Title not available (Why is that?)
- Min-max heaps and generalized priority queues
- An optimally efficient selection algorithm
- Dynamic parallel memories
- A note on the construction of the data structure ``deap
- Title not available (Why is that?)
- Title not available (Why is that?)
- Priority queue administration by sublist index
Cited In (4)
This page was built for publication: An optimal parallel algorithm to construct a deap
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3989753)
