Stable Minimum Space Partitioning in Linear Time (1992)
by
Jyrki Katajainen
,
Tomi Pasanen
| Citations: | 15 - 4 self |
BibTeX
@MISC{Katajainen92stableminimum,
author = {Jyrki Katajainen and Tomi Pasanen},
title = {Stable Minimum Space Partitioning in Linear Time},
year = {1992}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In the stable 0-1 sorting problem the task is to sort an array of n elements with two distinct values such that equal elements retain their relative input order.
Citations
| 151 | Programming Pearls - Bentley - 1986 |
| 29 | An implicit binomial queue with constant insertion time - Carlsson, Munro, et al. - 1988 |
