Journal of the ACM Bibliography

Selected papers that cite this one

• Ravindra K. Ahuja, James B. Orlin, Clifford Stein, and Robert E. Tarjan. Improved algorithms for bipartite network flow. SIAM Journal on Computing, 23(5):906-933, October 1994.

• Baruch Awerbuch, Yossi Azar, Amos Fiat, and Tom Leighton. Making commitments in the face of uncertainty: How to pick a winner almost every time (extended abstract). In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 519-530, Philadelphia, Pennsylvania, 22-24 May 1996.

• Jon L. Bentley and Robert Sedgewick. Fast algorithms for sorting and searching strings. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 360-369, New Orleans, Louisiana, 5-7 January 1997.

• Gerth Stolting Brodal and Chris Okasaki. Optimal purely functional priority queues Journal of Functional Programming, 6(6):839-857, November 1996.

• Joseph Cheriyan and Torben Hagerup. A randomized maximum-flow algorithm. SIAM Journal on Computing, 24(2):203-226, April 1995.

• Joseph Cheriyan, Torben Hagerup, and Kurt Mehlhorn. An o(n^3)-time maximum-flow algorithm. SIAM Journal on Computing, 25(6):1144-1170, December 1996.

• Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, and Ioannis G. Tollis. Dynamic graph drawings: Trees, series-parallel digraphs, and planar ST-digraphs. SIAM Journal on Computing, 24(5):970-1001, October 1995.

• David Cohen and Michael L. Fredman. Weighted binary trees for concurrent searching. Journal of Algorithms, 20(1):87-112, January 1996.

• Ye. Dinitz and J. Westbrook. Maintaining the classes of 4-edge-connectivity in a graph on-line. Algorithmica, 20(3):242-276, March 1998.

• Michael J. Fischer and Michael S. Paterson. Fishspear: A priority queue algorithm. Journal of the ACM, 41(1):3-30, January 1994.

• Greg N. Frederickson. A data structure for dynamically maintaining rooted trees. Journal of Algorithms, 24(1):37-65, July 1997.

• M. L. Fredman, D. S. Johnson, L. A. McGeoch, and G. Ostheimer. Data structures for traveling salesmen. Journal of Algorithms, 18(3):432-479, May 1995.

• Michael T. Goodrich, Mark Orletsky, and Kumar Ramaiyer. Methods for achieving fast query times in point location data structures. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 757-766, New Orleans, Louisiana, 5-7 January 1997.

• Kurt Hoffman, Kurt Mehlhorn, Pierre Rosenstiehl, and Robert E. Tarjan. Sorting Jordan sequences in linear time using level-linked search trees. Information and Control, 68(1-3):170-184, January/February/March 1986.

• Sandy Irani and Steve Seiden. Randomized algorithms for metrical task systems. Theoretical Computer Science, 194(1-2):163-182, 10 March 1998.

• L. Malmi. A New Method for Updating and Rebalancing Tree-Type Main Memory Dictionaries Nordic Journal of Computing, 3(2):111-130, Summer 1996.

• S. V. Nagaraj. Optimal binary search trees. Theoretical Computer Science, 188(1-2):1-44, 30 November 1997. Tutorial.

• Steven Seiden. Unfair problems and randomized algorithms for metrical task systems. Accepted for publication in Information and Computation. Final manuscript received for publication May 31, 1998, 1998.

• Murray Sherk. Self-adjusting k-ary search trees. Journal of Algorithms, 19(1):25-44, July 1995.

• Ashok Subramanian. An explanation of splaying. Journal of Algorithms, 20(3):512-525, May 1996.

• Rajamani Sundar and Robert E. Tarjan. Unique binary-search-tree representations and equality testing of sets and sequences. SIAM Journal on Computing, 23(1):24-44, February 1994.

• Vijay K. Vaishnavi. On k-dimensional balanced binary trees. Journal of Computer and System Sciences, 52(2):328-348, April 1996.

Shortcuts: