Opening book details…
Can I read Constant Time Parallel Sorting: an Empirical View on EtoBox?
Constant Time Parallel Sorting: an Empirical View by William Gasarch; Evan Golub; Clyde Kruskal is a Computer Science article available to read on EtoBox.
What is Constant Time Parallel Sorting: an Empirical View about?
Consider the following problem: If you want to sort n numbers in k (a constant) rounds then how many comparisons-per-round do you need? This problem has been studied carefully and there exist several algorithms and some lower bounds for it. Many of the algorithms are non-constructive. We have embarked on an empirical study of most of the algorithms in the literature, including the non-constructive ones. This paper is an exposition of what we have found. One of our conclusions is that non-constructive algorithms can be useful.
Who reads Constant Time Parallel Sorting: an Empirical View?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- William Gasarch; Evan Golub; Clyde Kruskal
- Publisher
- Elsevier Science; Elsevier ; Elsevier Inc.; Elsevier BV (ISSN 0022-0000)
- Published
- 2003
- Language
- EN
- Field
- Computer Science (Physical Sciences)
More by William Gasarch; Evan Golub; Clyde Kruskal
Browse all works by William Gasarch; Evan Golub; Clyde Kruskal