MIT OpenCourseWare
  • OCW home
  • Course List
  • about OCW
  • Help
  • Feedback
  • Support MIT OCW

Readings

Readings

Fredman, Michael L., and Robert Endre Tarjan. "Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms." Journal of the ACM 34, no. 3 (July 1987): 596-615.

Cherkassky, Boris V., Andrew V. Goldberg, Craig Silverstein. "Buckets, Heaps, Lists, and Monotone Priority Queues." SIAM Journal on Computing 28, no. 4: 1326-1346.

Chazelle, B. "A Minimum Spanning Tree Algorithm with Inverse-Ackerman Type Complexity." NECI Research Tech Report 99-099.

van Emde Boas Priority Queues

Boas, van Emde. "Design and Implementation of an Efficient Priority Queue." Math Syst Th 10 (1977).

Thorup, Mikkel. "On RAM Priority Queues."  SODA . 1996.

Splay Trees

Sleator, Daniel, and Robert Tarjan. "Self-adjusting Binary Search Trees." Journal of the ACM 32, no. 3 (July 1985): 652-686 .

Sleator, Daniel. A splay tree animation.

A Suffix Tree Animation

Sarnak, Neil, and Robert E. Tarjan. "Planar Point Location Using Persistent Search Trees." Communications of the ACM 29, no. 7 (July 1986): 669-679.

Holm, Jacob, Kristian de Lichtenberg, and Mikkel Thorup. "Poly-logarithmic Deterministic Fully-dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-edge, and Biconnectivity." STOC 98. Proceedings of the thirtieth annual ACM symposium on Theory of computing, pages 79-89.

Goldberg, Andrew V., and Robert E. Tarjan. "A New Approach to the Maximum-Flow Problem." J ACM 35, no. 4 (Oct. 1988): 921-940.

Textbooks

Goemans, Michel. Course notes for Advanced Algorithms, particularly linear programming. The source for the plurality of material for this course.

Bertsimas, Dimitris, and John N. Tsitsiklis. Introduction to Linear Optimization. Belmont, MA: Athena Scientific, February 1997. ISBN: 1886529191.

Cormen, Leiserson, and Rivest. Introduction to Algorithms. Cambridge, MA: MIT Press, 1990. ISBN: 0262031418.
Some of each of data structures, string algorithms, network flow.

Ahuja, Magnanti, and Orlin. Network Flows. Upper Saddle River, NJ: Prentice Hall, 1993. ISBN: 013617549X.

Motwani, and Raghavan. Randomized Algorithms. Cambridge, UK: Cambridge University Press, 1995. ISBN: 0521474655.

Crochemore, and Rytter. Text Algorithms. New York, NY: Oxford University Press, 1994. ISBN: 0195086090.

Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge, UK: Cambridge University Press, 1997. ISBN: 0521585198.

Borodin, Alan, and Ran El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998. ISBN: 0521563925.