Selected papers that cite this one
- Mikhail J. Atallah, Danny Z. Chen, and Hubert Wagener. An optimal parallel algorithm for the visibility of a simple polygon from a point. Journal of the ACM, 38(3):516-533, July 1991.
- Timothy M. Chan. Deterministic algorithms for 2-d convex programming and 3-d online linear programming. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 464-472, New Orleans, Louisiana, 5-7 January 1997.
- Timothy M. Chan. Deterministic algorithms for 2-d convex programming and 3-d online linear programming. Journal of Algorithms, 27(1):147-166, April 1998.
- Anmol Mathur and Edward M. Reingold. Generalized Kraft's inequality and discrete k-modal search. SIAM Journal on Computing, 25(2):420-447, April 1996.
- Claudio Mirolo. Convex minimization on a grid and applications. Journal of Algorithms, 26(2):209-237, February 1998.
- Sandeep Sen. Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems. Theoretical Computer Science, 188(1-2):59-78, 30 November 1997.
- Boris S. Veroy. Optimal search algorithm for extrema of a discrete periodic bimodal function. Journal of Complexity, 5(2):238-250, June 1989.