Stable minimum space partitioning in linear time
Authors:
- 1 December 1992
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 32 (4) , 580-585
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- An optimal adaptive in-place sorting algorithmLecture Notes in Computer Science, 1991
- Stable in situ sorting and minimum data movementBIT Numerical Mathematics, 1990
- An implicit binomial queue with constant insertion time1988
- Stable unmerging in linear time and constant spaceInformation Processing Letters, 1987
- A generalized, one-way, stackless quicksortBIT Numerical Mathematics, 1987
- Programming pearlsCommunications of the ACM, 1986
- Quicksort for Equal KeysIEEE Transactions on Computers, 1985
- Sorting and Searching in MultisetsSIAM Journal on Computing, 1976