Lower bounds for algebraic computation trees, Proceedings of the fifteenth annual ACM symposium on Theory of computing , STOC '83, pp.80-86, 1983. ,
DOI : 10.1145/800061.808735
Output-sensitive results on convex hulls, extreme points, and related problems, Discrete & Computational Geometry, vol.6, issue.4, pp.369-387, 1996. ,
DOI : 10.1007/BF02712874
Derandomizing an output-sensitive convex hull algorithm in three dimensions, Computational Geometry, vol.5, issue.1, pp.27-32, 1995. ,
DOI : 10.1016/0925-7721(94)00018-Q
Quicksort without a stack, 12th MFCS, pp.283-289, 1986. ,
Quicksort, The Computer Journal, vol.5, issue.1, pp.10-15, 1962. ,
DOI : 10.1093/comjnl/5.1.10
The Ultimate Planar Convex Hull Algorithm?, SIAM Journal on Computing, vol.15, issue.1, pp.287-299, 1986. ,
DOI : 10.1137/0215021
Implicit selection, 1st SWAT, pp.14-23, 1988. ,
DOI : 10.1007/3-540-19487-8_2
Stable minimum space partitioning in linear time, BIT, vol.27, issue.4, pp.580-585, 1992. ,
DOI : 10.1007/BF01994842
Sorting multiset stably in minimum space, Acta Informatica, vol.31, pp.410-421, 1994. ,
Sorting multisets and vectors in-place, 2nd WADS, pp.473-479, 1991. ,
DOI : 10.1007/BFb0028285
Sorting and Searching in Multisets, SIAM Journal on Computing, vol.5, issue.1, pp.1-8, 1976. ,
DOI : 10.1137/0205001
Distribution-sensitive algorithms, Nordic J. Comput, vol.6, issue.2, pp.194-211, 1999. ,
DOI : 10.1007/BFb0054380