18 Facts About Zvi Galil

Zvi Galil is an Israeli-American computer scientist.

Zvi Galil has served as the dean of the Columbia University School of Engineering and as president of Tel Aviv University from 2007 through 2009.

Zvi Galil has been credited with coining the terms stringology and sparsification.

Zvi Galil has published over 200 scientific papers and is listed as an ISI highly cited researcher.

Zvi Galil then spent a year working as a post-doctorate researcher at IBM's Thomas J Watson Research Center in Yorktown Heights, New York.

In 2007, Zvi Galil succeeded Itamar Rabinovich as president of Tel Aviv University.

Zvi Galil was named as the dean of Georgia Tech's college of computing on April 9,2010.

At Georgia Tech, together with Udacity founder Sebastian Thrun, Zvi Galil conceived of the college of computing's online Master of Science in computer science program, and he led the faculty creation of the program.

Zvi Galil stepped down as dean and returned to a regular faculty position in June 2019.

Zvi Galil now serves as the Frederick G Storey Chair in Computing and Executive Advisor to Online Programs at Georgia Tech.

In 1982, Zvi Galil founded the Columbia University Theory Day and organized the event for the first 15 years.

From 1983 to 1987, Zvi Galil served as the chairman of ACM SIGACT, an organization that promotes research in theoretical computer science.

Zvi Galil served as managing editor of SIAM Journal on Computing from 1991 to 1997 and editor in chief of Journal of Algorithms from 1988 to 2003.

Zvi Galil's research is in the areas of algorithms, particularly string and graph algorithms.

Zvi Galil has conducted research in experimental design with Jack Kiefer.

Zvi Galil worked with Dany Breslauer to design a linear-work, O parallel algorithm for string matching, and they later proved it to have the best possible time complexity among linear work algorithms.

Zvi Galil worked with other computer scientists to develop several currently-fastest graph algorithms.

In 1979, together with Ofer Gabber, Zvi Galil solved the previously open problem of constructing a family of expander graphs with an explicit expansion ratio, useful in the design of fast graph algorithms.