Optimal time-space trade-offs for non-comparison-based sorting
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Improved upper bounds for time-space trade-offs for selection
Nordic Journal of Computing
Comparison-based time-space lower bounds for selection
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Constant-Working-Space Algorithms for Image Processing
Emerging Trends in Visual Computing
Comparison-based time-space lower bounds for selection
ACM Transactions on Algorithms (TALG)
Computing the visibility polygon using few variables
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Reprint of: Memory-constrained algorithms for simple polygons
Computational Geometry: Theory and Applications
Hi-index | 0.00 |