Journal of the ACM Bibliography

Selected papers that cite this one

• P. K. Agarwal and M. van Kreveld. Connected component and simple polygon intersection searching. Algorithmica, 15(6):626-660, June 1996.

• Lars Arge and Jeffrey Scott Vitter. Optimal dynamic interval management in external memory (extended abstract). In 37th Annual Symposium on Foundations of Computer Science, pages 560-569, Burlington, Vermont, 14-16 October 1996. IEEE.

• Prosenjit Gupta, Ravi Janardan, and Michiel Smid. A technique for adding range restrictions to generalized searching problems. Information Processing Letters, 64(5):263-269, 15 December 1997.

• Prosenjit Gupta, Ravi Janardan, and Michiel Smid. Further results on generalized intersection searching problems: Counting, reporting, and dynamization. Journal of Algorithms, 19(2):282-317, September 1995.

• John Hershberger and Subhash Suri. Off-line maintenance of planar configurations. Journal of Algorithms, 21(3):453-475, November 1996.

• Sanjiv Kapoor and Michiel Smid. New techniques for exact and approximate dynamic closest-point problems. SIAM Journal on Computing, 25(4):775-796, August 1996.

• Marc J. van Kreveld and Mark H. Overmars. Concatenable structures for decomposable problems. Information and Computation, 110(1):130-148, April 1994.

• Enrico Nardelli, Vincenzo Mastrobuoni, and Alesiano Santomo. Computing a poset from its realizer. Information Processing Letters, 64(3):149-154, 14 November 1997.

• Dan E. Willard. Application of range query theory to relational data base join and selection operations. Journal of Computer and System Sciences, 52(1):157-169, February 1996.

• Dan E. Willard. A density control algorithm for doing insertions and deletions in a sequentially ordered file in good worst-case time. Information and Computation, 97(2):150-204, April 1992.

Shortcuts: