A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Optimizing stable in-place merging
Theoretical Computer Science
Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) comparisons
Journal of Experimental Algorithmics (JEA)
Context-free languages can be accepted with absolutely no space overhead
Information and Computation
A simple algorithm for in-place merging
Information Processing Letters
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
Computational Geometry: Theory and Applications
An in-place algorithm for Klee's measure problem in two dimensions
Information Processing Letters
Space-efficient geometric divide-and-conquer algorithms
Computational Geometry: Theory and Applications
Line-segment intersection made in-place
Computational Geometry: Theory and Applications
A Simple Algorithm for Stable Minimum Storage Merging
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
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
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
Context-free languages can be accepted with absolutely no space overhead
Information and Computation
A simple algorithm for in-place merging
Information Processing Letters
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
Ratio based stable in-place merging
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Sorting by merging or merging by sorting?
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
In-Place algorithms for computing (layers of) maxima
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
On optimal and efficient in place merging
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
In-place randomized slope selection
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Line-segment intersection made in-place
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
| Hi-index | 5.23 |