Stable set and multiset operations in optimal time and space
Bing-Chao Huang, Michael Allen Langston · 1988
The focus of this paper is on demonstrating the existence of methods for stably performing set and multiset operations on sorted files of data in both optimal time and optimal extra space. It is already known that stable merging and stable duplicate-key extraction permit such methods. The major new results reported herein are these