SearchSkip to Search Results
- 1Comparison based algorithms
- 1Instruction-level parallelism
- 1Lower bounds
- 1Partial order
Technical report TR88-01. A great deal of effort has been directed towards determining the minimum number of binary comparisons sufficient to produce various partial orders given some partial order. For example, the sorting problem considers the minimum number of comparisons sufficient to...
Technical report TR07-02. Most contemporary processors offer some version of Single Instruction Multiple Data (SIMD) machinery -- vector registers and instructions to manipulate data stored in such registers. The central idea of this paper is to use these SIMD resources to improve the...