I&C 2014
Constant-time sorting
Abstract
We present an algorithm for sorting an arbitrary number of arbitrary-length integers in constant time on a random access machine (RAM). The algorithm forms a Straight Line Program (SLP).
Authors
Keywords
Context
- Venue
- Information and Computation
- Archive span
- 1987-2026
- Indexed papers
- 3021
- Paper id
- 1027928209218997465