A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
In-Place Planar Convex Hull Algorithms
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
On the Performance of WEAK-HEAPSORT
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) comparisons
Journal of Experimental Algorithmics (JEA)
Proximity Mergesort: optimal in-place sorting in the cache-oblivious model
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Space-efficient planar convex hull algorithms
Theoretical Computer Science - Latin American theorotical informatics
An in-place sorting with O(nlog n) comparisons and O(n) moves
Journal of the ACM (JACM)
Context-free languages can be accepted with absolutely no space overhead
Information and Computation
Linear Time Constant-Working Space Algorithm for Computing the Genus of a Digital Object
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing
Context-free languages can be accepted with absolutely no space overhead
Information and Computation
Theoretical Computer Science
Computation with absolutely no space overhead
DLT'03 Proceedings of the 7th international conference on Developments in language theory
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Sorting by merging or merging by sorting?
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Sorting stably, in-place, with O(n log n) comparisons and O(n) moves
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.89 |