**ADDRESS**

Intertrust Technologies Corporation

920 Stewart Dr #100

Sunnyvale, CA 94085

**EDUCATION**

California Institute of Technology, Pasadena, California

B.S. in Mathematics, l969.

Stanford University, Stanford California

M.S. in Computer Science, l97l.

Ph.D. in Computer Science, minor in Mathematics, 1972.

Thesis title: An Efficient Planarity Algorithm.

Thesis advisor: Professor Robert W. Floyd.

Course advisor: Professor Donald Knuth.

**EXPERIENCE**

2014-Present, Intertrust Technologies Corporation, Sunnyvale, CA 94086

Chief Scientist

2013-2014, Microsoft, Mountain View, CA

Visiting Researcher

2002-, Hewlett Packard Corporation, Palo Alto, CA

2002-2003, Chief Scientist.

2003-2013, Senior Fellow.

2002, Compaq Computer Corporation, Houston, TX

Corporate Fellow.

1997 – 2001, Intertrust Technologies Corporation, Sunnyvale, CA 94086

Chief Scientist, Intertrust, and Senior Research Fellow, STAR Labs.

1996, Massachusetts Institute of Technology, Cambridge, MA

Visiting Scientist.

1989 – 1997, NEC Research Institute, Princeton, New Jersey

Fellow.

1989 – 1994, 2001-, Princeton University, Princeton, New Jersey

Co-Director, National Science Foundation Center for Discrete Mathematics and Theoretical Computer Science (DIMACS).

1985-, Princeton University, Princeton, New Jersey

James S. McDonnell Distinguished University Professor of Computer Science.

l98l – 1985, New York University, New York, New York

Adjunct Professor of Computer Science.

1980 – 1989, AT&T Bell Laboratories, Murray Hill, New Jersey

Member of Technical Staff.

1974 – 1980, Stanford University, Stanford, California

1974 – 1977, Assistant Professor of Computer Science.

1977 – 1980, Associate Professor of Computer Science.

1973 – 1975, University of California, Berkeley, California

Miller Research Fellow.

1972 – 1973, Cornell University, Ithaca, New York

Assistant Professor of Computer Science.

**HONORS**

Miller Research Fellowship, University of California, Berkeley, California, 1973-1975

Guggenheim Fellowship, 1978-1979

Nevanlinna Prize in Information Science, 1983

National Academy of Sciences Award for Initiatives in Research, 1984

Honorable Mention, Lanchester Prize of the Operations Research Society of America, 1984

Fellow, American Academy of Arts and Sciences, 1985

AT&T Bell Laboratories, Distinguished Member of Technical Staff, 1985

A. M. Turing Award of the Association for Computing Machinery, 1986

Member, National Academy of Sciences, 1987

Member, National Academy of Engineering, 1988

Fellow, American Association for the Advancement of Science, 1990

Member, American Philosophical Society, 1990

Foundation Fellow, Institute for Combinatorics and its Applications, 1991

Honorable Mention, Lanchester Prize of the Operations Research Society of America, 1993

Fellow, Association for Computing Machinery, 1994

Fellow, New York Academy of Sciences, 1994

Paris Kanellakis Award in Theory and Practice, Association for Computing Machinery, 1999

Blaise Pascal Medal in Mathematics and Computer Science, European Academy of Sciences, 2004

Fellow, Society for Industrial and Applied Mathematics, 2009

Edelman Award, INFORMS, member of winning HP team, 2009

Distinguished Alumni Award, California Institute of Technology, 2010

**SERVICE (partial list)**

Program committee for ACM Symposium on Theory of Computing, 1975, 1976

Program Committee for ACM Symposium on Principles of Programming Languages, 1978, 1979

Program Committee for IEEE Symposium on Foundations of Computer Science, 1983,

1985 (Chair)1987, 1989

Program Committee for ACM Symposium on Computational Geometry, 1988

Organizing Committee, Sparse Matrix Conference, Knoxville, Tennessee, 1978

Program Committee for ALENEX workshop, 2010

Program Committee for SWAT Symposium, 2010

Editor, Princeton University Press Series in Computer Science, 1985-

Program Committee for ACM-SIAM Symposium on Discrete Algorithms, 1990, 1999 (co-chair)

Editor, John Wiley Series in Discrete Mathematics, 1987-1997

Editor, Transactions on Mathematical Software, 1978-1980

Editor, Journal of the Association for Computing Machinery, 1979-1983

Editor, SIAM Journal on Computing, 1979-1983

Editor, Journal of Graph Theory, 1985-1988

Editor, Journal of Algorithms, 1983-1990

Editor, Discrete and Computational Geometry, 1985-

Editor, Journal of the American Mathematical Society, 1986-1991

Editor, European Journal of Combinatorics, 1988-1991

Correspondent, Mathematical Intelligencer, 1991-

ACM Grace Murray Hopper Award Subcommittee, 1981-1985; Chair, 1984

Steering committee, SIAM special interest and activities group in discrete mathematics, 1984-1987

Member-at-large, AAAS Section A (mathematics) committee, 1985-1989

National Advisory Board, Computer Professionals for Social Responsibility, 1987-

Board of Governors, Institute for Mathematics and its Applications, 1988-1991

Fiscal Operational Responsibility Subcommittee of the Strategic Planning Committee, ACM,

1988-1990

Committee, Mathematical Sciences; Status and Future Directions, National Research Council,

1989-1990

Computer Science and Engineering Peer Committee, National Academy of Engineering,

1989-1992

Class Membership Committee, National Academy of Sciences, 1991, 1992

External Review Committee, Dept. of Computer Science, Duke University, 1996

Co-Director, DIMACS, 1989-

Co-P.I., Center for Computational Intractability, 2008-

**PATENTS**

J. Bentley, D. Sleator, and R. E. Tarjan, U. S. Patent 4,796,003, Data Compaction, 1989.

B. Pinkas, S. Haber, R. E. Tarjan, and T. Sander, U. S. Patent 7,149,899, Establishing a Secure Channel with a Human User, 2006.

J. Horning, W. Sibert, R. E. Tarjan, U. Maheshwari, W. Horne, A. Wright, L. Matheson, and S. Owicki, U. S. Patent 7,430,670, Software self-defense systems and methods, Sept. 30, 2008.

W. Horne, L. Matheson, C. Sheehan, and R. E. Tarjan, U. S. Patent 7,581,103, Software self-checking systems and methods, 2009.

Y. Zhou, A. Kothari, R. Swaminathan, R. E. Tarjan, and A. Zhang, U.S. Patent 7,594,016, Calculating numbers of servers for tiers of a multi-tiered system, 2009.

R. E. Tarjan, B. Zhang, and Y. Zhou, U. S. Patent 7,680,641, Identifying a minimum cut and/or a maximum flow using balancing of vertex excesses, 2010.

W. Horne, U. Maheshwari, R. E. Tarjan, J. Horning, W. Sibert, L. Matheson, A. Wright, and S. Owicki, U. S. patent 7,739,511, Systems and methods for watermarking software and other media, 2010.

Y. Zhou, R. E. Tarjan, and B. Zhang, U. S. Patent 7,742,906, Balancing collections of vertices in a network, 2010.

W. Horne, U. Maheshwari, R. E. Tarjan, J. Horning, W. Sibert, L. Matheson, A. Wright, and S. Owicki, U. S. Patent 7,770,016, Systems and methods for watermarking software and other media, 2010.

J. Horning, W. Sibert, R. E. Tarjan, U. Maheshwari, W. Horne, A. Wright, L. Matheson, and S. Owicki, U. S. Patent 7.779.270, Software self-defense systems and methods, 2010.

J. Horning, W. Sibert, R. Tarjan, U. Maheshwari, W. Horne, A. Wright, L. Matheson, and S. Owicki, U.S. Patent 7,779,394, Software self-defense systems and methods, 2010.

N. Mishra, R. Schreiber, and R. E. Tarjan, U. S. Patent 7,818,272, Method for discovery of clusters of objects in an arbitrary undirected graph using a difference between a fraction of internal connections and maximum fraction of connections by an outside object, 2010.

J. Horning, W. Sibert, R. E. Tarjan, U. Maheshwari, W. Horne, A. Wright, L. Matheson, and S. Owicki, U. S. Patent 7,823,135, Software self-defense systems and methods, 2010.

Y. Zhou, A. Kothari, K. Chauduri, R. Swaminathan, and R. E. Tarjan, U. S. Patent 7,886,055, Allocating resources in a system having multiple tiers, 2011.

W. Horne, L. Matheson, C. Sheehan, and R. E. Tarjan, U. S. Patent 8,001,388, Software self-checking systems and methods, 2011.

W. Horne, U. Maheshwari, R. E. Tarjan, J. J. Horning, W. O. Sibert, L. R. Matheson, A. K. Wright, and S. S. Owicki, U. S. Patent 8140850, Systems and methods for watermarking software and other media, 2012.

R. S. Screiber, A. Ene, N. Milosavljevic, R. E. Tarjan, and M. Shah, U. S. Patent 8209742, Computer-implemented method for obtaining a biclique cover in a bipartite dataset, 2012.

B. Pinkas, S. Haber, R. E. Tarjan, and T. Sander, U. S. Patent 8220036, Establishing a secure channel with a human user, 2012.

W. Horne, U. Maheshwari, R. E. Tarjan, J. J. Horning, W. O. Sibert, L. R. Matheson, A. K. Wright, and S. S. Owicki, U. S. Patent 8335924, Systems and methods for watermarking software and other media, 2012.

W. G. Horne, L. R. Matheson, C. Sheehan, and R. E. Tarjan, U. S. Patent 8352747, Software self-checking systems and methods, 2013.

W. Horne, U. Maheshwari, R. E. Tarjan, J. J. Horning, W. O. Sibert, L. R. Matheson, A. K. Wright, and S. S. Owicki, U. S. Patent 8370634, Systems and methods for watermarking software and other media, 2013.

W. G. Horne, L. R. Matheson, C. Sheehan, and R. E. Tarjan, U. S. Patent 8387022, Software self-checking systems and methods, 2013.

M. C. Vargas-Magana, C. A. Santos, C. Valencia, L. H. Ramshaw, R. E. Tarjan, I. Lopez-Sanchez, and M. T. Gonzalez Diaz, International Patent 20130290049, Cost entity matching, 2013.

**PUBLICATIONS**

**BOOKS**

R. E. Tarjan, Data Structures and Network Algorithms, CBMS 44, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.

G. Polya, R. E. Tarjan, D. R. Woods Notes on Introductory Combinatorics, Birkhäuser, Boston, MA, 1983.

**REFEREED JOURNAL ARTICLES AND BOOK CHAPTERS**

J. Hopcroft and R. E. Tarjan, “A V2 algorithm for determining isomorphism of planar graphs,” Information Processing Letters 1(1971), pp. 32-34.

C. R. Miller and R. E. Tarjan, “An analytical positive manifold algorithm for use with latent class analysis,” Multivariate Behavioral Research (1971), pp. 363-372.

J. Hopcroft and R. E. Tarjan, “Planarity testing in V log V steps: extended abstract,” IFIP Congress 71: Foundations of Information Processing, TA-2, North-Holland, Amsterdam (1971), pp. 18-22.

R. E. Tarjan, “Determining whether a groupoid is a group,” Information Processing Letters 1 (1972), pp. 120-124.

R. E. Tarjan, “Sorting using networks of queues and stacks,” Journal ACM 19 (1972), pp. 341-346.

R. E. Tarjan, “Depth-first search and linear graph algorithms,” SIAM Journal on Computing 1 (1972), pp. 146-160; preliminary version in Conf. Record Twelfth Annual Symp. on Switching and Automata Theory (1971), pp. 114-121.

J. Hopcroft and R. E. Tarjan, “Isomorphism of planar graphs (working paper)” Complexity of Computer Computations, R.E.Miller and J.W. Thatcher, eds., Plenum Press, New York (1972), pp. 131-152.

J. Hopcroft and R. E. Tarjan, “A V log V algorithm for isomorphism of triconnected planar graphs,” Journal of Computer and System Sciences 7 (1973), pp. 323-331.

M. Blum, R. Floyd, V. Pratt, and R. Rivest, and R. E. Tarjan, “Time bounds for selection,” Journal of Computer and System Sciences 7 (1973), pp. 448-461.

J. Hopcroft and R. E. Tarjan, “Algorithm 447: Efficient algorithms for graph manipulation,” Communications ACM 16 (1973), pp. 372-378.

J. Hopcroft and R. E. Tarjan, “Dividing a graph into triconnected components,” SIAM Journal on Computing 2 (1973), pp. 135-158.

R. E. Tarjan, “Enumeration of the elementary circuits of a directed graph,” SIAM Journal on Computing 2 (1973), pp. 211-216.

R. E. Tarjan, “A note on finding the bridges of a graph,” Information Processing Letters 2 (1974), pp. 160-161.

R. E. Tarjan, “Finding dominators in directed graphs,” SIAM Journal on Computing 3 (1974), pp. 62-89; preliminary version in Proc. Seventeenth Annual Princeton Conf. on Inf. Sciences and Systems (1973), pp. 414-418.

R. E. Tarjan, “A new algorithm for finding weak components,” Information Processing Letters 3 (1974), pp. 13-15.

J. Hopcroft and R. E. Tarjan, “Efficient planarity testing,” Journal ACM 21 (1974), pp. 549-568.

R. E. Tarjan, “A good algorithm for edge-disjoint branching,” Information Processing Letters 3 (1974), pp. 52-53.

R. E. Tarjan, “Testing flow graph reducibility,” Journal of Computer and System Sciences 9 (1974), pp. 355-365; preliminary version in Proc. Fifth Annual ACM Symp.on Theory of Computing (1973), pp. 96-107.

R. E. Tarjan, “Efficiency of a good but not linear set union algorithm,” Journal ACM 22 (1975), pp. 215-225.

R. Read and R. E. Tarjan, “Bounds on backtrack algorithms for listing cycles, paths, and spanning trees,” Networks 5 (1975), pp. 237-252.

J. Misra and R. E. Tarjan, “Optimal chain partitions of trees,” Information Processing Letters 4 (1975), pp. 24-26.

S. Even and R. E. Tarjan, “Network flow and testing graph connectivity,” SIAM Journal on Computing 4 (1975), pp. 507-518.

S. Goodman, S. Hedetniemi, and R. E. Tarjan, “b-matchings in trees,” SIAM Journal on Computing 5 (1976), pp. 104-108.

D. Rose, R. E. Tarjan and G. Lueker, “Algorithmic aspects of vertex elimination on graphs,” SIAM Journal on Computing 5 (1976), pp. 266-283.

R. E. Tarjan, “Edge-disjoint spanning trees and depth-first search,” Acta Informatica 6 (1976), pp. 17l-185.

G. Ehrlich, S. Even, and R. E. Tarjan, “Intersection graphs of curves in the plane,” Journal of Combinatorial Theory 21 (1976), pp. 8-20.

S. Even and R. E. Tarjan, “A combinatorial problem which is complete in polynomial space,” Journal ACM 23 (1976), pp. 710-719; preliminary version in Proc. Seventh Annual ACM Symp. on Theory of Computing (1975), pp. 66-71.

R. E. Tarjan, “Graph theory and Gaussian elimination,” Sparse Matrix Computations, J.R. Bunch and D.J. Rose, eds., Academic Press, New York (1976), pp. 3-22.

R. E. Tarjan, “Iterative algorithms for global flow analysis,” Algorithms and Complexity: New Directions and Recent Results, J. F. Traub, ed., Academic Press, New York (1976), pp. 71-102.

K. Eswaran and R. E. Tarjan, “Augmentation problems,” SIAM Journal on Computing 5 (1976), pp. 653-665.

M. R. Garey, D. S. Johnson, and R. E. Tarjan, “The planar Hamiltonian circuit problem is NP-complete,” SIAM Journal on Computing 5 (1976), pp. 704-714.

D. Cheriton and R. E. Tarjan, “Finding minimum spanning trees,” SIAM Journal on Computing 5 (1976), pp. 724-742.

S. Even and R. E. Tarjan, “Computing an st-numbering,” Theoretical Computer Science 2 (1976), pp. 339-344.

G. Markowsky and R. E. Tarjan, “Lower bounds on the lengths of node sequences in directed graphs,” Discrete Mathematics 16 (1976), pp. 329-337.

R. E. Tarjan, “Finding optimum branchings,” Networks 7 (1977), pp. 24-35.

R. E. Tarjan, “Graph algorithms in chemical computation,” Transactions of American Chemical Society 46 (1977), pp. 1-20.

W. Paul, R. E. Tarjan, and J. Celoni, “Space bounds for a game on graphs,” Math. Systems Theory 10 (1977), pp. 239-251; preliminary version in Proc. Eighth Annual ACM Symp. on Theory of Computing (1976), pp. 149-160.

R. E. Tarjan and A. Trojanowski, “Finding a maximum independent set,” SIAM Journal on Computing 6 (1977), pp. 537-546.

D. Rose and R. E. Tarjan, “Algorithmic aspects of vertex elimination on directed graphs,” SIAM Journal of Applied Mathematics 34 (1978), pp. 176-197.

R. E. Tarjan, “Complexity of monotone networks for computing conjunctions,” Annals of Discrete Mathematics 2 (1978), pp. 121-133.

R. E. Tarjan, “Complexity of combinatorial algorithms,” SIAM Review 20 (1978), pp. 443-456.

M. R. Garey, D. S. Johnson, F. P. Preparata, and R. E. Tarjan, “Triangulating a simple polygon,” Information Processing Letters 7 (1978), pp. 175-179.

W. Paul and R. E. Tarjan, “Time-space trade-offs in a pebble game,” Acta Informatica 10 (1978), 111-115; preliminary version in Automata, Languages, and Programming, Fourth Colloquium (1977), University of Turku, Finland, pp. 365-369.

M. R. Garey and R. E. Tarjan, “A linear-time algorithm for finding all feedback vertices,” Information Processing Letters 7 (1978), pp. 274-276.

R. Lipton and R. E. Tarjan, “A separator theorem for planar graphs,” SIAM Journal of Applied Mathematics 36 (1979), pp. 177-189; preliminary version in Proc. Conf. on Theoretical Comp. Science (1977), University of Waterloo, Waterloo, Ontario, Canada, pp. 1-10.

R. E. Tarjan, “A class of algorithms which require non-linear time to maintain disjoint sets,” Journal of Computer and System Sciences 19 (1979), pp. 110-127.

M. R. Brown and R. E. Tarjan, “A fast merging algorithm,” Journal ACM 26 (1979), pp. 211-226.

B. Aspvall, M. F. Plass, and R. E. Tarjan, “A linear-time algorithm for testing the truth of certain quantified Boolean formulas,” Information Processing Letters 8 (1979), pp. 121-123.

R. Lipton, D. Rose and R. E. Tarjan, “Generalized nested dissection,” SIAM Journal on Numerical Analysis 16 (1979), pp. 346-358.

T. Lengauer and R. E. Tarjan, “A fast algorithm for finding dominators in a flow graph,” Transactions on Programming Languages and Systems I (1979), pp. 121-141.

R. E. Tarjan, “Applications of path compression on balanced trees,” Journal ACM 26(1979), pp. 690-715.

R. E. Tarjan and A. C. Yao, “Storing a sparse table,” Communications ACM 22 (1979), pp. 606-611.

D. J. Rose, A. Sherman, R. E. Tarjan, and G. Whitten, “Algorithms and software for in-core factorization of sparse symmetric positive definite matrices,” Computers and Structures 10 (1979), pp. 411-418.

R. Lipton and R. E. Tarjan, “Applications of a planar separator theorem,” SIAM Journal on Computing 9 (1980), pp. 615-627; preliminary version in Proc.18th Annual Symp. on Foundations of Comp. Science (1977), pp. 162-170.

P. J. Downey, R. Sethi, and R. E. Tarjan, “Variations on the common subexpression problem,” Journal ACM 27 (1980), pp. 758-771.

J. R. Gilbert, T. Lengauer, and R. E. Tarjan, “The pebbling problem is complete in polynomial space,” SIAM Journal on Computing 9 (1980), pp. 513-524; preliminary version in Proceedings Eleventh Annual ACM Symposium on Theory of Computing (1979), pp. 237-248.

M. R. Brown and R. E. Tarjan, “Design and analysis of a data structure for representing sorted lists,” SIAM Journal on Computing 9 (1980), pp. 594-614.

E. Coffman, M. R. Garey, D. S. Johnson and R. E. Tarjan, “Performance bounds for level-oriented two-dimensional packing algorithms,” SIAM Journal on Computing 9 (1980), pp. 808-826.

T. Lengauer and R. E. Tarjan, “The space complexity of pebble games on trees,” Information Processing Letters 10 (1980), pp. 184-188.

R. Karp and R. E. Tarjan, “Linear expected-time algorithms for connectivity problems,” Journal of Algorithms 1 (1980), pp. 374-393; preliminary version in Proc. Twelfth Annual ACM Symp. on Theory of Computing (1980), pp. 368-377.

R. E. Tarjan, “A unified approach to path problems,” Journal ACM 28 (1981), pp. 577-593.

R. E. Tarjan, “Fast algorithms for solving path problems,” Journal ACM 28 (1981), pp. 594-614.

M. R. Garey, D. S. Johnson, B. Simons, and R. E. Tarjan, “Scheduling unit-time tasks with arbitrary release times and deadlines,” SIAM Journal on Computing 10 (1981), pp. 256-269.

E. Reingold and R. E. Tarjan, “On a greedy heuristic for complete matching,” SIAM Journal on Computing 10 (1981), pp. 676-681.

R. E. Tarjan, Review of Graphs and Networks by B.Carre, SIAM Reviews 23 (1981), p. 397.

T. Lengauer and R. E. Tarjan, “Asymptotically tight bounds on time-space trade-offs in a pebble game,” Journal ACM 29 (1982), pp. 1087-1130.

J. Reif and R. E. Tarjan, “Symbolic program analysis in almost-linear time,” SIAM Journal on Computing 11 (1982), pp. 81-93.

J. Valdes, R. E. Tarjan, and E. Lawler, “The recognition of series-parallel digraphs,” SIAM Journal on Computing 11 (1982), pp. 298-313; preliminary version in Proc. Eleventh Annual ACM Symp. on Theory of Computing (1979), pp. 1-12.

R. E. Tarjan, “A hierarchical clustering algorithm using strong components,” Information Processing Letters 14 (1982), pp. 26-29.

R. E. Tarjan, “Sensitivity analysis of minimum spanning trees and shortest path trees,” Information Processing Letters XIV (1982), pp. 30-33; Corrigendum, ibid. 23 (1986), p. 219.

M. R. Garey, D. S. Johnson, R. E. Tarjan, and M. Yannakakis, “Scheduling opposing forests,” SIAM Journal on Algebraic and Discrete Methods 4 (1983), pp. 72-93.

R. E. Tarjan, “This weak’s citation classic: depth-first search and linear graph algorithms,” Current Contents/Engineering, Technology and Applied Sciences 14 (1983), p. 20.

D. Sleator and R. E. Tarjan, “A data structure for dynamic trees,” J. Computer and System Sciences, 26 (1983), 362-391; preliminary version in Proc. Thirteenth Annual Symp. on Theory of Computing (1981), pp. 114-122.

R. E. Tarjan, “Updating a balanced search tree in O(1) rotations,” Information Processing Letters 16 (1983), pp. 253-257.

R. E. Tarjan, “An improved algorithm for hierarchical clustering algorithm using strong components,” Information Processing Letters 17 (1983), pp. 37-41.

R. E. Tarjan, “Space-efficient implementations of graph search methods,” ACM Trans. on Math. Software 9 (1983), pp. 326-329.

J. Feigenbaum and R. E. Tarjan, “Two new kinds of biased search trees,” Bell System Tech. J. LXII (1983), pp. 3139-3158.

R. E. Tarjan and J. van Leeuwen, “Worst-case analysis of set union algorithms,” Journal ACM XXXI (1984), pp. 245-281.

H. N. Gabow and R. E. Tarjan, “Efficient algorithms for a family of matroid intersection problems,” J. Algorithms V (1984), pp. 80-131.

D. Harel and R. E. Tarjan, “Fast algorithms for finding nearest common ancestors,” SIAM Journal on Computing XIII (1984), pp. 338-355.

R. E. Tarjan, “A simple version of Karzanov’s blocking flow algorithm,” Operations Research Letters II (1984), pp. 265-268.

J. W. Suurballe and R. E. Tarjan, “A quick method for finding shortest pairs of paths,” Networks 14 (1984) pp. 325-336.

R. E. Tarjan and M. Yannakakis, “Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs,” SIAM J. Computing 13 (1984), pp. 566-579; Addendum, ibid. 14 (1985), pp. 254-255.

P. Rosenstiehl and R. E. Tarjan, “Gauss codes, planar Hamiltonian graphs, and stack-sortable permutations,” J. Algorithms 5 (1984), pp. 375-390.

R. E. Tarjan, “Input-output decomposition of dynamic systems is NP-complete,” IEEE Trans. on Automatic Control AC-29 (1984) pp. 863-864.

J. Gilbert, J. Hutchinson, and R. E. Tarjan, “A separator theorem for graphs of bounded genus,” J. Algorithms 5 (1984) pp. 391-407.

D. D. Sleator and R. E. Tarjan, “Amortized efficiency of list update and paging rules,” Comm. ACM 28 (1985), pp. 202-208.

R. E. Tarjan, “Amortized computational complexity,” SIAM J. Alg. and Disc. Meth. 6 (1985), pp. 306-318.

S. Bent, D. Sleator, and R. E. Tarjan, “Biased search trees,” SIAM J. Computing 14 (1985), pp. 545-568.

R. E. Tarjan, “Problems 85-1 and 85-2: two bottleneck optimization problems,” J. Algorithms 6 (1985), pp. 283-284.

F. R. K. Chung, W. Paul, R. Reischuk, and R. E. Tarjan, “Coding strings by pairs of strings,” SIAM J. Alg. Disc. Meth. VI (1985), 445-461; preliminary version in Congressus Numeratium 39 (1983), pp. 183-191.

D. D. Sleator and R. E. Tarjan, “Self-adjusting binary search trees,” Journal ACM 32 (1985), pp. 652-686.

H. Gabow and R. E. Tarjan, “A linear-time algorithm for a special case of disjoint set union,” J. Comp. Sys. Sci. 30 (1985), pp. 209-221; preliminary version in Proc. 15th Annual ACM Symp. on Theory of Computing (1983), pp. 246-251.

R. E. Tarjan, “Decomposition by clique separators,” Discrete Math. 55 (1985), pp. 221-232.

R. E. Tarjan, “Shortest path algorithms,” Graph Theory with Applications to Algorithms and Computer Science, Y. Alavi, et al., eds., John Wiley, New York, 1985, pp. 753-759.

R. E. Tarjan and U. Vishkin, “An efficient parallel biconnectivity algorithm,” SIAM J. Comput. 14 (1985), pp. 862-874.

J. Roskind and R. E. Tarjan, “A note on finding minimum-cost edge-disjoint spanning trees,” Math. of Op. Res. 10 (1985), pp. 701-708.

R. Bonic, R. Paige, and R. E. Tarjan, “A linear time solution to the single function coarsest partition problem,” Theoretical Comp. Sci. 40 (1985), pp. 67-84.

R. E. Tarjan, “Sequential access in splay trees takes linear time,” Combinatorica 5 (1985), pp. 367-378.

F. R. K. Chung, M. R. Garey, and R. E. Tarjan, “Strongly connected orientations of mixed multigraphs,” Networks 15 (1985), pp. 477-484.

D. Sleator and R. E. Tarjan, `”Self-adjusting heaps,” SIAM J. Comput. 15 (1986), pp. 52-69.

M. L. Fredman, R. Sedgewick, D. D. Sleator, and R. E. Tarjan, “The pairing heap: a new form of self-adjusting heap,” Algorithmica 1 (1986), pp. 111-129.

J. L. Bentley, D. D. Sleator, R. E. Tarjan, and V. K. Wei, “A locally adaptive data compression scheme,” Comm. ACM 29 (1986), pp. 320-330; preliminary version in Proc. 22nd Allerton Conference on Control, Communication, and Computing (1984), pp. 233-242.

R. E. Tarjan, “Two streamlined depth-first search algorithms,” Fundamenta Informaticae IX (1986), pp. 85-94.

R. E. Tarjan, “Algorithms for maximum network flow,” Math. Prog. Study 26 (1986), pp.1-11.

H. Gajewska and R. E. Tarjan, “Deques with heap order,” Information Processing Letters 22 (1986), pp. 197-200.

N. Sarnak and R. E. Tarjan, “Planar point location using persistent search trees,” Comm. ACM 29 (1986), pp. 669-679; preliminary version in Combinatorial Mathematics: Proceedings of the Third International Conference, G. S. Bloom, R. L. Graham, and J. Malkevitch, editors, Annals of the New York Academy of Sciences, 533(1989), pp. 352-362.

K. Hoffman, K. Mehlhorn, P. Rosenstiehl, and R. E. Tarjan, “Sorting Jordan sequences in linear time using level-linked search trees,” Information and Control 68(1986), pp. 170-184.

P. Rosenstiehl and R. E. Tarjan, “Rectilinear planar layouts and bipolar orientations of planar graphs,” Discrete and Computational Geometry 1 (1986), pp. 343-354.

H. N. Gabow, Z. Galil, T. Spencer, and R. E. Tarjan, “Efficient algorithms for finding minimum spanning trees in undirected and directed graphs,” Combinatorica 6 (1986), pp. 109-122.

R. E. Tarjan, “Algorithm design,” Comm. ACM 30 (1987), pp. 204-213 (Turing Award Lecture); also Bit 10 (1987), pp. 1417-1429 (in Japanese) and Informatie 29 (1987), pp. 789-797 (in Dutch).

J. R. Gilbert and R. E. Tarjan, “The analysis of a nested dissection algorithm,” Numerische Mathematik 50. (1987), pp. 377-404.

L. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. E. Tarjan, “Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons,” Algorithmica 2 (1987), pp. 209-233.

M. L. Fredman and R. E. Tarjan “Fibonacci heaps and their uses in improved network optimization algorithms,” J. Assoc. Comput. Mach. 34 (1987), pp. 596-615; preliminary version in Proc. 25th Annual IEEE Symp. on Found. of Comp. Sci. (1984), pp. 338-346.

R. Paige and R. E. Tarjan, “Three partition refinement algorithms,” SIAM J. Comput. 16 (1987), pp. 973-989.

D. D. Sleator, R. E. Tarjan, and W. P. Thurston, “Rotation distance,” Open Problems in Communication and Computation, T. M. Cover and B. Gopinath, eds., Springer-Verlag, New York, 1987, pp. 130-137.

R. E. Tarjan and C. J. Van Wyk, “An O(n log log n)-time algorithm for triangulating a simple polygon,” SIAM J. Comput. 17 (1988), pp. 143-178; Erratum, Ibid. p. 1061.

M. R. Garey, R. E. Tarjan, and G. T. Wilfong, “One-processor scheduling with symmetric earliness and tardiness penalties,” Math. of Operations Research 13 (1988), pp. 330-348.

H. N. Gabow and R. E. Tarjan, “A linear-time algorithm for finding a minimum spanning pseudoforest,” Information Processing Letters 27 (1988), pp. 259-263.

D. D. Sleator, R. E. Tarjan, and W. P. Thurston, “Rotation distance, triangulations, and hyperbolic geometry,” J. Amer. Math. Soc. 1 (1988), pp. 647-682; preliminary version in Proc. Eighteenth Annual ACM Symp. on Theory of Computing (1986), pp. 122-135.

H. N. Gabow, and R. E. Tarjan, “Algorithms for two bottleneck optimization problems,” J. Algorithms 9 (1988), pp. 411-417.

J. R. Driscoll, H. N. Gabow, R. Shrairman, and R. E. Tarjan, “Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation,” Comm. ACM 33 (1988), pp. 1343-1354.

A. V. Goldberg and R. E. Tarjan, “A new approach to the maximum flow problem,” Journal ACM 35 (1988), pp. 921-940; preliminary version in Proc. Eighteenth Annual ACM Symp. on Theory of Computing (1986), pp. 136-146.

R. E. Tarjan and J. Westbrook, “Amortized analysis of algorithms for set union with backtracking,” SIAM J. Comput. 18 (1989), pp. 1-11.

G. Gallo, M. D. Grigoriadis, and R. E. Tarjan, “A fast parametric maximum flow algorithm and applications,” SIAM J. Comput. 18 (1989), pp. 30-55.

J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan, “Making data structures persistent,” J. Comp. Sys. Sci. 38 (1989), pp. 86-124; preliminary version in Proc. Eighteenth Annual ACM Symp. on Theory of Computing (1986), pp. 109-121.

D. Ginat, D. D. Sleator, and R. E. Tarjan, “A tight amortized bound for path reversal,” Information Processing Letters 31 (1989), pp. 3-5.

A. V. Goldberg and R. E. Tarjan, “A parallel algorithm for finding a blocking flow in an acyclic network,” Information Processing Letters, 31 (1989), pp. 265-271.

R. K. Ahuja, J. B. Orlin, and R. E. Tarjan, “Improved time bounds for the maximum flow problem,” SIAM J. Comput. 18 (1989), pp. 939-954.

H. N. Gabow and R. E. Tarjan, “Faster scaling algorithms for network problems,” SIAM J. Comput. 18 (1989), pp. 1013-1036.

K. L. Clarkson R. E. Tarjan, and C. J. Van Wyk, “A fast Las Vegas algorithm for triangulating a simple polygon,” Discrete and Computational Geometry 4 (1989), pp. 423-432; preliminary version in Proc. Fourth Annual ACM Symp. on Computational Geometry (1988), pp. 18-22.

A. V. Goldberg and R. E. Tarjan, “Finding minimum-cost circulations by canceling negative cycles,” J. Assoc. Comput. Mach. 36 (1989), pp. 873-886; preliminary version in Proc. Twentieth Annual ACM Symp. on Theory of Comput. (1988), pp. 388-397.

R. K. Ahuja, K. Mehlhorn, J. B. Orlin, and R. E. Tarjan, “Faster algorithms for the shortest path problem,” J. Assoc. Comput. Mach. 37 (1990), pp. 213-223.

A. V. Goldberg and R. E. Tarjan, “Finding minimum-cost circulations by successive approximation,” Math. of Oper. Res. 15 (1990), pp. 430-466.

K. Y. Fung, T. M. Nicholl, R. E. Tarjan, and C. J. Van Wyk, “Simplified linear-time Jordan sorting and polygon clipping,” Information Processing Letters 35 (1990), pp. 85-92.

A. V. Goldberg, E. Tardos, and R. E. Tarjan, “Network flow algorithms,” Paths, Flows, and VLSI-Layout, B. Korte, L. Lovász, H.J. Prömel, and A. Schriver, eds., Springer-Verlag, Berlin (1990) pp. 101-164.

R. E. Tarjan, “Efficient maximum flow algorithms,” Jber. d. Dt. Math.-Verein., Jubiläumstagung 1990, pp. 342-348.

P. Gibbons, R. Karp, V. Ramachandran, D. Soroker, and R. E. Tarjan, “Transitive compaction in parallel via branchings,” J. Algorithms 12 (1991), pp. 110-125.

R. E. Tarjan, “Efficiency of the primal network simplex algorithm for the minimum-cost circulation problem,” Math. of Oper. Res., 16 (1991), pp. 272-291.

A. V. Goldberg, M. D. Grigoriadis, and R. E. Tarjan, “Use of dynamic trees in a network simplex algorithm for the maximum flow problem,” Math. Prog. 50. (1991), pp. 277-290.

H.N. Gabow and R. E. Tarjan, “Faster scaling algorithms for general graph matching problems,” J. Assoc. Comput. Mach., 38 (1991), pp. 815-853.

N.E. Young, J.B. Orlin, and R. E. Tarjan, “Faster parametric shortest path and minimum balance algorithms,” Networks 21 (1991), pp. 205-221.

K. Clarkson, R. Cole, and R. E. Tarjan, “Randomized parallel algorithms for trapezoidal diagrams,’” Internat. Journal of Computational Geometry Applications 2 (1992), pp. 117-133; also 7th Annual Symposium on Computational Geometry (1991), pp. 152-161.

R. K. Ahuja, A. V. Goldberg, J. B. Orlin, and R. E. Tarjan, “Finding minimum-cost flows by double scaling,” Math. Prog. 53 (1992), pp. 243-266.

D.G. Kirkpatrick, M.M. Klawe, and R. E. Tarjan, “Polygon triangulation in O(n log log n) time with simple data structures,” Discrete and Computational Geometry 7 (1992), pp. 329-346; preliminary version in Proc. Sixth Annual ACM Symposium on Computational Geometry (1990), pp. 34-43.

B. Mishra and R. E. Tarjan, “A linear time algorithm for finding an ambitus,” Algorithmica 7 (1992), pp. 521-554.

D. Eppstein, G.F. Italiano, R. Tamassia, R. E. Tarjan, J. Westbrook, and M. Yung “Maintenance of a minimum spanning forest in a dynamic plane graph,” J. of Algorithms 13 (1992), pp. 33-54.

R. E. Tarjan and J. Westbrook, “Maintaining bridge-connected and biconnected components on-line,” Algorithmica 7 (1992), pp. 433-464.

D. D. Sleator, R. E. Tarjan, and W. P. Thurston, “Short encodings of evolving structures,” SIAM J. Discrete Math. 5 (1992), pp. 428-450.

J. Cai, R. Paige, and R. E. Tarjan, “More efficient bottom-up multi-pattern matching in trees,” Theoretical Computer Science 106 (1992), pp. 21-60.

B. Dixon, M. Rauch, and R. E. Tarjan, “Verification and sensitivity analysis of minimum spanning trees in linear time,” SIAM J. Computing 21 (1992), pp. 1184-1192.

H. Booth and R. E. Tarjan, “Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network,” J. of Algorithms 15 (1993), pp. 416-446.

J. Cai, X. Han, and R. E. Tarjan, “An O(m log n)-time algorithm for the maximal planar subgraph problem,” SIAM J. Comput. 22 (1993), pp. 1142-1162.

R. Sundar and R. E. Tarjan, “Unique binary search tree representations and equality-testing of sets and sequences,” SIAM J. Comput. 23 (1994), pp. 24-44; preliminary version in Proc. Twenty-Second Annual ACM Symposium on Theory of Computing (1990), pp. 18-25.

M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan, “Dynamic perfect hashing: upper and lower bounds,” SIAM J. Comput. 23 (1994), pp. 738-761; preliminary version in Proc. 29th Annual IEEE Symp. on Foundations of Computer Science (1988), pp. 524-531.

R. K. Ahuja, J. B. Orlin, C. Stein, and R. E. Tarjan, “Improved algorithms for bipartite network flow,” SIAM J. Comput. 23 (1994), pp. 906-923.

J. R. Driscoll, D. D. K. Sleator, and R. E. Tarjan, “Fully persistent lists with catenation,” J. Assoc. Comput. Mach. 41 (1994), pp. 943-959; preliminary version in Proc. Second Annual ACM-SIAM Symposium on Discrete Algorithms (1991), pp. 89-99.

V. King, S. Rao, and R. E. Tarjan, “A faster deterministic maximum flow algorithm,” J. Algorithms 17 (1994), pp. 447-474; preliminary version in Proc. Third Annual ACM-SIAM Symp. on Discrete Algorithms (1992), pp. 157-164.

A. L. Buchsbaum and R. E. Tarjan, “Confluently persistent deques via data structural bootstrapping,” J. Algorithms 18 (1995), pp. 513-547; preliminary version in Proc. Fourth Annual ACM-SIAM Symp. on Discrete Algorithms (1993), pp. 155-164.

D. R. Karger, P. Klein, and R. E. Tarjan, “A randomized linear-time algorithm to find minimum spanning trees,” J. Assoc. Comput. Mach. 42 (1995), pp. 321-328.

A. L. Buchsbaum, R. Sundar, and R. E. Tarjan, “Lazy structure sharing for query optimization,” Acta Informatica 32 (1995), pp. 255-270.

X. Han, P. Kelsen, V. Ramachandran, and R. E. Tarjan, “Computing minimal spanning subgraphs in linear time,” SIAM J. Comput. 24 (1995), pp. 1332-1358; preliminary version in Proc. Third Annual ACM-SIAM Symp. on Discrete Algoritms (1992), pp. 146-156.

A. L. Buchsbaum, R. Sundar, and R. E. Tarjan, “Data structural bootstrapping, linear path compression, and catenable heap-ordered double-ended queues,” SIAM J. Comput. 24 (1995), pp. 1190-1206; preliminary version in Proc. 33rd Annual IEEE Symp. on Foundations of Computer Science (1992), pp. 40-49.

L. R. Matheson and R. E. Tarjan, “Analysis of multigrid methods on massively parallel computers: architectural implications,” J. Parallel and Distributed Computing 33 (1996) pp. 33-43

L. R. Matheson and R. E. Tarjan, “Dominating sets in planar graphs,” European J. Combinatorics 17 (1996), pp. 565-568.

L. R. Matheson and R. E. Tarjan, “Parallelism in multigrid methods: how much is too much?” Int. J. of Parallel Programming 24 (1996), pp. 397-432.

B. Dixon and R. E. Tarjan, “Optimal parallel verification of minimum spanning trees in logarithmic time,” Algorithmica 17 (1997), pp. 11-18.

S. E. Dorward, L. R. Matheson, and R. E. Tarjan, “Toward efficient unstructured multigrid preprocessing,” International J. of Supercomputing Applications and High Performance Computing, 11 (1997), pp. 12-33.

R. E. Tarjan, “Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm,” Mathematical Programming, Series B, 78(1997), pp. 105-304.

L. R. Matheson and Robert E. Tarjan, “Culturally Induced Information Impactedness: A prescription for failure in software ventures,” J. Management Information Systems 15 (1998), pp. 23-39.

B. Ghosh, F. T. Leighton, B. M. Maggs, S. Muthukrishnan, C. G. Plaxton, R. Rajaraman, A. W. Richa, R. E. Tarjan, and D. Zuckerman, “Tight Analyses of Two Local Load Balancing Algorithms,” SIAM J. Computing 29 (1999) pp. 29-65; preliminary version in Proc. Twenty-Seventh Annual ACM Symp. on Theory of Computing (1995), pp. 548-558.

H. Kaplan, R. Shamir, and R. E. Tarjan, “Tractability of parameterized completion problems on chordal, strongly chordal and proper interval graphs,” SIAM J. Computing 28 (1999) pp. 1906-1922.

H. Kaplan and R. E. Tarjan, “Purely functional, real-time deques with catenation via recursive slow-down,” J. Assoc. Comput. Mach. 46 (1999), pp. 577-603.

H. Kaplan, R. Shamir, and R. E. Tarjan, “A faster and simpler algorithm for sorting signed permutations by reversals,” SIAM J. Computing 29 (1999), pp. 880-892.

H. Kaplan, C. Okasaki, and R. E. Tarjan, “Simple confluently persistent catenable lists,” SIAM J. Computing, 30 (2000), pp. 965-977; extended abstract in Proc.6th Scandinavian Workshop on Algorithm Theory (1998), pp. 119-130.

H. N. Gabow, H. Kaplan, and R. E. Tarjan, “Unique maximum matching algorithms,” J. Algorithms 40 (2001), pp. 159-183; preliminary version in Proc. 31st Annual ACM Symposium on Theory of Computing (1999), pp. 70-78.

S. Haber, B. Horne, J. Pato, T. Sander, and R. E. Tarjan, “If privacy is the problem, is DRM the answer?”, Digital Rights Management: Technological, Economic, Legal and Political Aspects, E. Becker, W. Buhse, D. Gunnewig, and N. Rump, eds., Lecture Notes in Computer Science 2270, Springer-Verlag, Berlin, 2003, pp. 224-233.

G. Flake, R. Tarjan, and K. Tsioutsiouliklis, “Graph clustering and minimum cut trees,” Internet Mathematics 1 (2004), pp. 355-378.

L. Georgiadis, R. E. Tarjan, and R. F. Werneck, “Finding dominators in practice,” J. Graph Algorithms and Applications, 10 (2006), pp. 69-94.

R. Mendelson, R. E. Tarjan, M. Thorup, and U. Zwick, “Melding priority queues,” ACM Trans. on Algorithms 2 (2006), pp. 535-556; also Proc. 9th Scandinavian Workshop on Algorithm Theory (2004), pp. 223-235.

K. Chanduri, A. Kothari, R. Pendavigh, R. Swaminathan, R. E. Tarjan, and Y. Zhou, “Server allocation algorithms for tiered systems,” Algorithmica 48 (2007), pp. 129-146; preliminary version in Proc. 11th International Computing and Combinatories Conference (2005), Springer Lecture Notes in Computer Science 3595, pp. 632-643.

H. Kaplan and R. E. Tarjan, “Thin heaps, thick heaps,” ACM Transactions on Algorithms, Vol. 4, No. 1 (March 2008), Article No. 3.

R. E. Tarjan and R. F. Werneck, “Dynamic trees in practice,” ACM J. on Experimental Algorithmics, to appear; preliminary version in Workshop on Experimental Algorithms (2007), pp. 80-93.

B. Haeupler and R. E. Tarjan, “Finding a feasible flow in a strongly connected network,” Operations Research Letters, Vol. 36, No. 4 (July 2008), pp. 397-398.

A . Buchsbaum, L. Georgiadis, H. Kaplan, A. Rogers, R. E. Tarjan, and J. Westbrook, “Linear-time algorithms for dominators and other path evaluation problems,” SIAM J. Computing, Vol. 38, No. 4 (2008), pp. 1533-1573.

B. V. Cherkassky, L. Georgiadis, A. V. Goldberg, R. E. Tarjan, and R. F. Werneck, “Shortest-path feasibility algorithms: an experimental evaluation,” ACM J. on Experimental Algorithmics, Vol. 14 (2009), Section 2, Article 7.

R. E. Tarjan and R. F. Werneck, “Dynamic trees in practice,” ACM J. on Experimental Algorithmics, Vol. 14 (2009), Section 4, Article 5.

J. Ward, B. Zhang, S. Jain, C. Fry, T. Olavson, H. Mishal, J. Amaral, D. Beyer, A. Brecht, B. Cargille, R. Chadinha, K. Chou, G. DeNyse, Qi Feng, C. Pandovani, S. Raj, K. Sunderbruch, R. E. Tarjan, K. Venkatraman, J. Woods, and J. Zhou, “HP transforms product portfolio management with operations research,’ Interfaces, Vol. 40, No. 1 (2010), pp. 17-32.

L. Georgiadis, H. Kaplan, N. Shafrir, R. E. Tarjan, and R. Werneck, “Data structures for mergeable trees,” ACM Transactions on Algorithms, Vol. 7, No. 2 (2011), Article 14.

B. Haeupler, S. Sen, and R. E. Tarjan, “Rank-pairing heaps,” SIAM J. Computing, Vol. 40, No. 6 (2011), pp. 1463-1485; preliminary version in Proc. European Symposium on Algorithms (2009), pp. 659-670.

B. Haeupler, T. Kavitha, R. Mathew, S. Sen, and R. E. Tarjan, “Incremental cycle detection, topological ordering, and strong component maintenance,” ACM Transactions on Algorithms, Vol.8, No. 1 (2012), Article 3.

P. K. Agarwal, L. Arge, H. Kaplan, E. Molad, R. E. Tarjan, and K. Yi, “An optimal dynamic data structure for stabbing-semigroup queries,” SIAM J. Comput., Vol. 41, No. 1 (2012), pp. 104-127.

H. Kaplan, R. E. Tarjan, and U. Zwick, “Soft heaps simplified,” SIAM J. Computing, Vol. 42, No. 4 (2013), pp. 1660-1673.

W. Fraczak, L. Georgiadis, A. Miller, and R. E. Tarjan, “Finding dominators via disjoint set union,” J. Discrete Algorithms, Vol. 23 (2013), pp. 2-20.

B. Haeupler, S. Sen, and R. E. Tarjan, “Rank-balanced trees,” ACM Trans. on Algorithms, to appear; preliminary version in WADS 2009, pp. 351-362.

S. Sen and R. E. Tarjan, “Deletion without rebalancing in multiway search trees,” ACM Trans. on Databases, to appear; preliminary version in ISAAC 2009, pp. 832-841.

L. Georgiadis and R. E. Tarjan, “Dominator tree certification and independent spanning trees,” J. Assoc. Comput. Mach., submitted.

**DISSERTATIONS SUPERVISED**

Jacobo Valdez, “Parsing flowcharts and series-parallel graphs,” Stanford University, 1978.

Thomas Lengauer, “Upper and lower bounds on space-time Trade-offs,” Stanford University, 1979.

Gregory Nelson, “Techniques for program verification,” Stanford University, 1980.

Bengt Aspvall, “Efficient algorithms for certain satisfiability and linear programming problems,” Stanford University, 1980.

Daniel Sleator, “An ο (nm log n) algorithm for maximum network flow,” Stanford University, 1981.

John Gilbert, “Graph separator theorems and sparse Gaussian elimination,” Stanford University, 1981.

Donald Woods, “Drawing planar graphs,” Stanford University, 1981.

Samuel Bent, “Dynamic weighted data structures,” Stanford University, 1982.

Neil Sarnak, “Persistent data structures,” New York University, 1986.

Joan Lucas, “Structure and properties of the rotation graph of binary trees,” Princeton University, 1987 (jointly supervised with A. S. LaPaugh).

Warren Smith, “Studies in computational geometry motivated by mesh generation,” Princeton

University, 1989 (jointly supervised with J. H. Conway).

Jeffrey Westbrook, “Algorithms and data structures for dynamic graph problems,” Princeton

University, 1989.

Heather Booth, “Fast algorithms on graphs and trees,” Princeton University, 1991.

Xiaofeng Han, “An algorithmic approach to extremal graph problems,” Princeton University, 1991.

Neal Young, “Competitive paging and dual-guided weighted caching and matching algorithms,” Princeton University, 1991.

Adam L. Buchsbaum, “Data-structural bootstrapping and catenable deques,” Princeton

University, 1993.

Brandon Dixon, “Minimum spanning tree verification, fast priority queues, and massively parallel factoring,” Princeton University, 1993.

Monika Rauch, “Fully dynamic graph algorithms and their data structures,” Princeton University, 1993.

Ramesh Sitaraman, “Communication and fault tolerance in parallel computers,” Princeton University, 1993.

Lesley R. Matheson, “Multigrid algorithms on massively parallel computers,” Princeton University, 1994.

Haim Kaplan, “Purely functional lists,” Princeton University, 1997.

Peter Yianilos, “Topics in computational hidden state modeling,” Princeton University, 1997.

Kostas Tsioutsiouliklis, “Maximum flow techniques for network clustering,” Princeton University,

2002.

Loukas Georgiadis, Linear-Time Algorithms for Dominators and Related Problems, 2005.

Renato F. Werneck, Design and Analysis of Data Structures for Dynamic Trees, 2006.

Sidhhartha Sen, New Systems and Algorithms for Scalable Fault Tolerance, 2013.