Houston / Washington D.C. / Guggenheim / Las Vegas / Waterloo / Washington / D. C. / Warsaw / Boston / Palo Alto / Ithaca / Berlin / Cambridge / Knoxville / Santos / Springer-Verlag / Pomona / Philadelphia / Amsterdam / Pasadena / Hakone / New York / Sunnyvale / /
Company
Plenum Press / IEEE Computer Society Press / Compaq Computer Corporation / R. Sedgewick D. D. / Bell Laboratories / J. Management Information Systems / J. Comp / S. W. Bent D. D. / B. Pinkas S. A. / J. L. Bentley D. D. / D. Ginat D. D. / IBM / J. R. Driscoll D. D. K. / N. Sarnak D. D. / Digital Rights Management / AT&T Bell Laboratories / SIAM Journal / Hewlett Packard Corporation / InterTrust Technologies Corporation / &T Bell Laboratories / /
Country
Finland / Netherlands / Japan / Canada / Jordan / United States / / /
Facility
Stanford University / University of Waterloo / EXPERIENCE Cornell University / University of California / NEC Research Institute / Princeton University / New York University / EDUCATION California Institute of Technology / Massachusetts Institute of Technology / Duke University / University of Turku / Cornell University / /
IndustryTerm
parametric maximum flow algorithms / parallel algorithms / minimum mean cycle algorithms / faster and simpler algorithm / point location using persistent search trees / self-checking systems / parallel biconnectivity algorithm / randomized linear-time algorithm / depth-first search algorithms / chemical computation / graph search methods / connected network / simpler algorithm / primal network simplex algorithm / linear time solution / k-best solutions / hierarchical clustering algorithm / Web-Graph / linear time algorithm / maximum flow algorithms / software ventures / parallel algorithm / path feasibility algorithms / biased search trees / acyclic network / linear set union algorithm / path algorithms / combinatorial algorithms / parametric maximum flow algorithm / allocation algorithms / analytical positive manifold algorithm / linear-time algorithm / multiway search trees / improved network optimization algorithms / linear-work parallel algorithm / search trees / depth-first search / nested dissection algorithm / linear-time algorithms / self-adjusting search trees / set union algorithms / binary search tree representations / social networks / dynamic graph algorithms / maximum matching algorithms / partition refinement algorithms / expected-time algorithms / activities / linear graph algorithms / faster deterministic maximum flow algorithm / binary search trees / minimum balance algorithms / self-defense systems / planarity algorithm / flow algorithm / network simplex algorithm / monotone networks / Internet Mathematics / balanced search tree / flow algorithms / /
Organization
National Research Council / SERVICE Program committee / Massachusetts Institute of Technology / Society for Industrial and Applied Mathematics / American Philosophical Society / Cornell University / Strategic Planning Committee / International Congress / Program Committee for ACM Symposium / American Mathematical Society / American Academy of Arts and Sciences / Computer Science and Engineering Peer Committee / Institute for Combinatorics / Fellow / Fiscal Operational Responsibility Subcommittee / Operations Research Society of America / National Academy of Sciences / Organizing Committee / Program Committee for SWAT Symposium / American Chemical Society / Princeton University Department of Computer Science / National Advisory Board / American Association for the Advancement of Science / Board of Governors / NEC Research Institute / Class Membership Committee / Society of America / Program Committee for IEEE Symposium / European Academy of Sciences / Princeton University / University of Turku / Program Committee for ALENEX / Duke University / New York Academy of Sciences / National Science Foundation Center for Discrete Mathematics and Theoretical Computer Science / J. Assoc. / California Institute of Technology / External Review Committee / Committee for ACM-SIAM Symposium / University of California / Berkeley / Institute for Mathematics / University of Waterloo / Association for Computing Machinery / Congress / New York University / New York / National Academy of Engineering / Stanford University / Steering committee / /
Person
Y. Shiloach / C. J. Van Wyk / S. Muthukrishnan / L. R. Matheson / B. Haeupler / Donald Woods / Murray Hill / Donald Knuth / C. G. Plaxton / Cai / D. I. August / T. Kavitha / S. Dorward / M. R. Brown / G.W. Flake / Daniel Sleator / Mathematical Intelligencer / D. Zuckerman / James S. McDonnell / C. Sheehan / E. Tardos / R. Swaminathan / H. N. Gabow / R. F. Werneck / R. Schreiber / B. Dixon / Ramesh Sitaraman / R. Paige / N. Milosavljevic / A. L. Buchsbaum / A. Kothari / K. Y. Fung / U. Zwick / A. V. Goldberg / T. Lengauer / W. Thatcher / John Wiley / Neil Sarnak / Discrete / M. Thorup / N. Shafir / M. D. Grigoriadis / P. Klein / E. Molad / D.G. Kirkpatrick / Robert W. Floyd / V. King / R. Mendelson / Stanford California / R. Shamir / K. Clarkson / N. Mishra / B. Mishra / L. Matheson / S. G. Mitchell / H. Booth / V. Pratt / R. Sundar / Heather Booth / P. Rosenstiehl / X. Han / S. Sen / D. Matula / Gregory Nelson / R. Tarjan / I. Stanton / K. Mehlhorn / Monika Rauch / K. Chanduri / B. Orlin / R. E. Tarjan / T. M. Nicholl / G. Gallo / A. Byde / P. N. Klein / F. Zane / S. E. Dorward / R. Floyd / V / R. Bonic / F. T. Leighton / Lesley R. Matheson / R. Cole / Adam L. Buchsbaum / W. P. Thurston / A. Goldberg / Haim Kaplan / A. Ene / T. Kelly / D. Soroker / H. Kaplan / D. Leven / Brandon Dixon / R. Mathew / K. Hoffman / Samuel Bent / Peter Yianilos / B. M. Maggs / Thomas Lengauer / V. Ramachandran / Warren Smith / R. Rivest / Grace Murray Hopper / C. Okasaki / B. Cherkassky / W. Horne / U. Vishkin / N. Salazar / Y. Zhou / M. Rauch / M. Sharir / Van Wyk / T. Sander / Robert E. Tarjan / C. Stein / Symposium / S. Rao / Jacobo Valdez / M.M. Klawe / Joan Lucas / S. Triantafyllis / R. Rajaraman / Neal Young / P. Kelsen / V / R. Pendavigh / A. W. Richa / B. Horne / P. Rao / Blaise Pascal Medal / K. Tsioutsiouliklis / Heide / Jeffrey Westbrook / R. Werneck / L. Georgiadis / R. Karp / V / T. G. Shamoon / N. Shafrir / John Gilbert / D. R. Karger / D. D. Sleator / / /
Position
Visiting Scientist / Associate Professor of Computer Science / Professor / Professor of Computer Science / Editor / Chief Scientist / Correspondent / Adjunct Professor of Computer Science / Member of Technical Staff / Course advisor / Co-Director / Thesis advisor / co-chair / Chair / King / /
Product
Shafrir / Galil / /
ProgrammingLanguage
K / /
ProvinceOrState
California / Ontario / Texas / New Jersey / Tennessee / Pennsylvania / Massachusetts / New York / /
PublishedMedium
Journal of the American Mathematical Society / SIAM Journal on Computing / European Journal of Combinatorics / Theory of Computing / Theoretical Computer Science / Lecture Notes in Computer Science / /
SportsLeague
Stanford University / /
Technology
dynamic graph algorithms / network simplex algorithm / Software Technology / linear set union algorithm / linear graph algorithms / Shortest path feasibility algorithms / Planarity algorithms / improved network optimization algorithms / faster and simpler algorithm / Las Vegas algorithm / minimum mean cycle algorithms / set union algorithms / parametric maximum flow algorithm / search algorithms / time algorithm / Faster scaling algorithms / Shortest path algorithms / level-oriented two-dimensional packing algorithms / ESA / minimum balance algorithms / Two linear-time algorithms / hierarchical clustering algorithm / V2 algorithm / Load Balancing / linear-work parallel algorithm / Three partition refinement algorithms / paging / randomized linear-time algorithm / analytical positive manifold algorithm / Linear-Time Algorithms / Linear time algorithms / parallel algorithm / Network Algorithms / faster deterministic maximum flow algorithm / Cryptography / Network flow algorithms / linear time algorithm / Linear expected-time algorithms / Multigrid algorithms / planarity algorithm / good algorithm / primal network simplex algorithm / maximum flow algorithms / Server allocation algorithms / parametric maximum flow algorithms / improved algorithm / parallel biconnectivity algorithm / Graph algorithms / nested dissection algorithm / caching / linear-time algorithm / maximum matching algorithms / blocking flow algorithm / /
R. E. Tarjan 4 Curriculum Vitae Robert Endre Tarjan January 5, 2010