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
Space-efficient planar convex hull algorithms
Theoretical Computer Science - Latin American theorotical informatics
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
Computational Geometry: Theory and Applications
Space-efficient geometric divide-and-conquer algorithms
Computational Geometry: Theory and Applications
Line-segment intersection made in-place
Computational Geometry: Theory and Applications
Constant-Working-Space Algorithms for Image Processing
Emerging Trends in Visual Computing
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
Computational Geometry: Theory and Applications
Radix sorting with no extra space
ESA'07 Proceedings of the 15th annual European conference on Algorithms
In-Place algorithms for computing (layers of) maxima
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
Line-segment intersection made in-place
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
An in-place min-max priority search tree
Computational Geometry: Theory and Applications
Hi-index | 0.00 |