= Robert Tarjan
{c}
{wiki}
= Robert Endre Tarjan
{c}
{synonym}
= R. Endre Tarjan
{c}
{synonym}
= Robert E. Tarjan
{c}
{synonym}
<Robert Tarjan> is a <computer scientist> whose work connects efficient <graph algorithms>, <data structures> and rigorous analysis. His contributions include algorithms for <lowest common ancestors> and, with collaborators, <splay trees> and <Fibonacci heaps>.<Robert Tarjan in the Hertz Foundation profiles>[Biography, graph algorithms and data structures]{ref}
His work on <amortized analysis> explains why an individual operation can be expensive while a whole sequence remains efficient. The accounting assigns the cost of occasional restructuring across the sequence instead of assuming each operation has the same worst-case cost. <Splay trees> make this distinction particularly concrete: moving recently accessed nodes changes the tree while supporting strong bounds over a sequence of accesses.<Amortized Computational Complexity by Robert Endre Tarjan>[Sections 1–2, total sequence cost and amortization]{ref}
Homepage: https://www.cs.princeton.edu/~ret/
Institutional profile: https://www.hertzfoundation.org/people/robert-tarjan/
\Image[https://www.hertzfoundation.org/wp-content/uploads/2025/07/Robert-Tarjan-900x900-1.jpg]
{title=Robert Tarjan}
{width=220}
Back to article page
