Prof. Robert Tarjan, A.M. Turing Award winner and the James S. McDonnell Distinguished University Professor of Computer Science at Princeton University paid a visit to the Institute for Interdisciplinary Information Sciences (IIIS) on April 6-16, 2012. Prof. Tarjan also spoke at the 119th lecture of the “Tsinghua Global Vision Lectures”on April 12 at Lecture Hall, FIT Building and met face-to-face with students.
Prof. Tarjan speaks at the “Tsinghua Global Vision Lectures”.
Prof. Tarjan is a world-renowned computer scientist. His main research areas are the design and analysis of data structures and graph and network algorithms. He has also done work in computational complexity and security. He is a member of the National Academy of Sciences, the National Academy of Engineering, the American Philosophical Society, and the American Academy of Arts and Sciences. He was awarded the Nevanlinna Prize in Informatics in 1982 and the Turing Award in 1986 with Prof. John Hopcroft for fundamental achievements in the design and analysis of algorithms and data structures.
Prof. Yao hosts the lecture.
Prof. Trajan’s lecture on search tree attracted big audience. The search tree is a classical and ubiquitous data structure, fundamental to databases and many other computer applications. Prof. Tarjan introduces the research progress of on AVL tree and the recent work that has produced a new framework for defining and analyzing balanced search trees, a new kind of balanced tree with especially nice properties, and a way to maintain balance by rebalancing only on insertion, not on deletion.
Prof. Yao presents a Tsinghua souvenir plate to Prof. Tarjan.
Prof. Tarjan took questions on search model, lazy deletion and other topics from the audience. Following the lecture, Prof. Yao presented a Tsinghua souvenir plate to Prof. Tarjan.
Audience at the lecture
