Zvi Galil (Hebrew: צבי גליל; born June 26, 1947) is an Israeli-American computer scientist.

[2][8] From 1995-2007, he served as the dean of the Columbia University Fu Foundation School of Engineering & Applied Science.

[10] At Columbia, he was appointed the Julian Clarence Levi Professor of Mathematical Methods and Computer Science in 1987, and the Morris and Alma A. Schapiro Dean of Engineering in 1995.

[14][16][17] Inside Higher Education noted that OMSCS "suggests that institutions can successfully deliver high-quality, low-cost degrees to students at scale".

[18] The Chronicle of Higher Education noted that OMSCS "may have the best chance of changing how much students pay for a traditional degree".

[21][22] He now serves as the Frederick G. Storey Chair in Computing and Executive Advisor to Online Programs at Georgia Tech.

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

Galil's real-time algorithms are the fastest possible for string matching and palindrome recognition, and they work even on the most basic computer model, the multi-tape Turing machine.

[29] With other computer scientists, he designed a constant-time linear-work randomized search algorithm to be used when the pattern preprocessing is given.

[30] With his students, Galil designed more than a dozen currently-fastest algorithms for exact or approximate, sequential or parallel, and one- or multi-dimensional string matching.

[41] In 2012, The University of Waterloo awarded Galil with an honorary Doctor of Mathematics degree for his "fundamental contributions in the areas of graph algorithms and string matching.