Journal of the ACM Bibliography

Selected papers that cite this one

• Richa Agarwala and David Fernández-Baca. Weighted search in the plane. Information Processing Letters, 54(2):97-100, 28 April 1995.

• Richa Agarwala and David Fernández-Baca. Weighted multidimensional search and its application to convex optimization. SIAM Journal on Computing, 25(1):83-99, February 1996.

• Pankaj K. Agarwal and Pavan K. Desikan. An efficient algorithm for terraine simplification. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 139-147, New Orleans, Louisiana, 5-7 January 1997.

• Miklos Ajtai and Nimrod Megiddo. A deterministic poly(log log n)-time n-processor algorithm for linear programming in fixed dimension. SIAM Journal on Computing, 25(6):1171-1195, December 1996.

• Noga Alon and Nimrod Megiddo. Parallel linear programming in fixed dimension almost surely in constant time. Journal of the ACM, 41(2):422-434, March 1994.

• P. Bose, D. Bremner, and M. van Kreveld. Determining the castability of simple polyhedra. Algorithmica, 19(1/2):84-113, September/October 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.

• 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.

• Bernard Chazelle and Ji\v{r}í Matou\v{s}ek. On linear-time deterministic algorithms for optimization problems in fixed dimension. Journal of Algorithms, 21(3):579-597, November 1996.

• Kenneth L. Clarkson. Las Vegas algorithms for linear and integer programming when the dimension is small. Journal of the ACM, 42(2):488-499, March 1995.

• Edith Cohen and Nimrod Megiddo. Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs. Journal of the ACM, 40(4):791-830, September 1993.

• Peter Damaschke. An optimal parallel algorithm for digital curve segmentation. Theoretical Computer Science, 178(1-2):225-236, 30 May 1997.

• Christian A. Duncan, Michael T. Goodrich, and Edgar A. Ramos. Efficient approximation and optimization algorithms for computational metrology. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 121-130, New Orleans, Louisiana, 5-7 January 1997.

• Jeff Erickson. Better lower bounds for halfspace emptiness. In 37th Annual Symposium on Foundations of Computer Science, pages 472-481, Burlington, Vermont, 14-16 October 1996. IEEE.

• Bernd Gärtner. A subexponential algorithm for abstract optimization problems. SIAM Journal on Computing, 24(5):1018-1035, October 1995.

• Alexander T. Ishii, Charles E. Leiserson, and Marios C. Papaefthymiou. Optimizing two-phase, level-clocked circuitry. Journal of the ACM, 44(1):148-199, January 1997.

• Shreesh Jadhav, Asish Mukhopadhyay, and Binay Bhattacharya. An optimal algorithm for the intersection radius of a set of convex polygons. Journal of Algorithms, 20(2):244-267, March 1996.

• M. Luby. Introduction to special issue on randomized and derandomized algorithms. Algorithmica, 16(4/5):359-366, October/November 1996.

• Wolfgang Maass. Bounds for the computational power and learning complexity of analog neural nets. SIAM Journal on Computing, 26(3):708-732, June 1997.

• Ji\v{r}í Matou\v{s}ek. Derandomization in computational geometry. Journal of Algorithms, 20(3):545-580, May 1996.

• J. Matou\v{s}ek, M. Sharir, and E. Welzl. A subexponential bound for linear programming. Algorithmica, 16(4/5):498-516, October/November 1996.

Shortcuts: