Zvi Galil

Zvi Galil (Hebrew: צבי גליל‎; born June 26, 1947) is an Israeli-American computer scientist and mathematician. Galil served as the President of Tel Aviv University from 2007 through 2009. From 2010 to 2019, he was the dean of the Georgia Institute of Technology College of Computing.[3] His research interests include the design and analysis of algorithms, computational complexity and cryptography. He has been credited with coining the terms stringology and sparsification.[4][5] He has published over 200 scientific papers[6] and is listed as an ISI highly cited researcher.[7]

Zvi Galil
Galil in 2010
Born (1947-06-26) June 26, 1947[1]
Tel Aviv, Mandatory Palestine[1]
Nationality
Alma mater
Awards
Scientific career
Fields
Institutions
Doctoral advisorJohn Hopcroft[2]
Doctoral students

Early life and education

Zvi Galil was born in Tel Aviv in Mandatory Palestine in 1947. He completed both his B.Sc. (1970) and his M.Sc. (1971) in Applied Mathematics, both summa cum laude, at Tel Aviv University before earning his Ph.D. in Computer Science at Cornell in 1975 under the supervision of John Hopcroft.[2] He then spent a year working as a post-doctorate researcher at IBM's Thomas J. Watson Research Center in Yorktown Heights, New York.[8]

Career

From 1976 until 1995 he worked in the computer science department of Tel Aviv University, serving as its chair from 1979 to 1982. In 1982 he joined the faculty of Columbia University, serving as the chair of the Computer Science Department from 1989-1994.[1][8] From 1995-2007, he served as the dean of the Fu Foundation School of Engineering & Applied Science.[9] In this position, he oversaw the naming of the school in honor of Chinese businessman Z. Y. Fu after a large donation was given in his name.[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.[1]

Galil served as the President of Tel Aviv University starting in 2007 (following Itamar Rabinovich),[11] but resigned and returned to the faculty in 2009, and was succeeded by Joseph Klafter.[12][13] He was named as the dean of Georgia Tech's College of Computing on April 9, 2010.[3] At Georgia Tech, together with Udacity founder Sebastian Thrun, Galil conceived of the College of Computing’s Online Master of Science in Computer Science (OMSCS) program, and he led the faculty creation of the program.[14] OMSCS went on to become the largest online master’s program in computer science in the United States.[15] Galil stepped down as dean and returned to a regular faculty position in June 2019.[16][17]

Professional service

In 1982, Galil founded the Columbia University Theory Day and organized the event for the first 15 years. It still exists as the New York Area Theory Day.[18] From 1983 to 1987, Galil served as the chairman of ACM SIGACT, an organization that promotes research in theoretical computer science.[19] He 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.

Research

Galil's research is in the areas of algorithms, particularly string and graph algorithms, complexity, cryptography and experimental design. Among his most highly cited work are the following:

  • Gabber, O.; Galil, Z. (1981). "Explicit constructions of linear-sized superconcentrators". Journal of Computer and System Sciences. 22 (3): 407–420. doi:10.1016/0022-0000(81)90040-4.
  • Gabow, H. N.; Galil, Z.; Spencer, T.; Tarjan, R. E. (1986). "Efficient algorithms for finding minimum spanning trees in undirected and directed graphs". Combinatorica. 6 (2): 109–122. doi:10.1007/BF02579168. S2CID 35618095.
  • Galil, Z. (1986). "Efficient algorithms for finding maximum matching in graphs". ACM Computing Surveys. 18 (1): 23–38. doi:10.1145/6462.6502. S2CID 207746409.
  • Galil, Z.; Park, K. "An improved algorithm for approximate string matching". Proceedings of 16th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science. 372. Springer-Verlag. doi:10.1007/BFb0035772.

Awards and honors

In 1995, Galil was inducted as a Fellow of the Association for Computing Machinery for "fundamental contributions to the design and analysis of algorithms and outstanding service to the theoretical computer science community,"[20] and in 2004, he was elected to the National Academy of Engineering for "contributions to the design and analysis of algorithms and for leadership in computer science and engineering."[21][22] In 2005, he was selected as a Fellow of the American Academy of Arts and Sciences.[23] In 2008, Columbia University established the Zvi Galil award for student life.[24] In 2009, the Columbia Society of Graduates awarded him the Great Teacher Award.[25] 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."[26]

References
  1. Eppstein, David; Italiano, Giuseppe F. (March 1999). "PREFACE: Festschrift for Zvi Galil". Journal of Complexity. 15 (1): 1–3. doi:10.1006/jcom.1998.0492.
  2. Zvi Galil at the Mathematics Genealogy Project
  3. "Institute names next College of Computing Dean" (Press release). Georgia Institute of Technology. 2010-04-09. Retrieved 2010-04-09.
  4. "Introduction to Stringology". The Prague Stringology Club. Czech Technical University in Prague. Retrieved May 14, 2012.
  5. Zvi, Galil; David Eppstein; Giuseppe F. Italiano; Amnon Nissenzweig (September 1997). "Sparsification - a technique for speeding up dynamic graph algorithms". Journal of the ACM. 44 (5): 669–696. doi:10.1145/265910.265914. S2CID 340999.
  6. "Zvi Galil". The DBLP Computer Science Bibliography. Digital Bibliography & Library Project. Retrieved 2016-03-24.
  7. "ISI Highly Cited Researchers Version 1.1: Zvi Galil". ISI Web of Knowledge. Retrieved 2011-06-27.
  8. "Zvi Galil Named Dean of Columbia's Engineering School" (Press release). Columbia University. July 14, 1995. Retrieved 2019-06-05.
  9. McCaughey, Robert (2014). A Lever Long Enough: A History of Columbia's School of Engineering and Applied Science since 1864. Columbia University Press. p. 240. ISBN 9780231166881.
  10. Arenson, Karen W. (1997-10-01). "Chinese Tycoon Gives Columbia $26 Million". The New York Times. Retrieved 2010-04-20.
  11. "Computer expert nominated for TAU presidency". The Jerusalem Post. November 5, 2006.
  12. Basch_Interactive (1980-01-01). "Presidents of Tel Aviv University | Tel Aviv University | Tel Aviv University". English.tau.ac.il. Retrieved 2020-02-18.
  13. Ilani, Ofri; Kashti, Or (2009-07-02). "Tel Aviv University president quits / Sources: Galil was forced out of office". Haaretz. Retrieved 2011-06-27.
  14. Lewin, Tamar (August 13, 2013). "Master's Degree Is New Frontier of Study Online". The New York Times. Retrieved 2017-10-09.
  15. Galil, Zvi. "OMSCS: The Revolution Will Be Digitized". cacm.acm.org. Retrieved 2020-07-27.
  16. "College's Skyrocketing Stature, Global Impact Highlight Galil's Legacy". Georgia Tech College of Computing. April 16, 2019. Retrieved 2019-06-05.
  17. "Georgia Tech Alumni Magazine, Vol. 95 No. 3, Fall 2019". Issuu. Retrieved 2020-04-21.
  18. "New York Area Theory Day". www.cs.columbia.edu. Retrieved 2020-06-03.
  19. "Front matter". ACM SIGACT News. 19 (1). Fall 1987.
  20. ACM Fellow Award / Zvi Galil
  21. "Dr. Zvi Galil". NAE Members. National Academy of Engineering. Retrieved May 11, 2012.
  22. "Zvi Galil Elected to National Academy of Engineering". Columbia News. Columbia University. Retrieved May 11, 2012.
  23. Academy Elects 225th Class of Fellows and Foreign Honorary Members, American Association for the Advancement of Science, April 26, 2005
  24. "Zvi Galil Award". Columbia College. Retrieved 2019-06-05.
  25. "Quigley, Galil To Receive Great Teacher Awards". Columbia College Today. September 2009. Retrieved 2019-06-05.
  26. Smyth, Pamela. "University of Waterloo to award eight honorary degrees at spring convocation". Waterloo Communications. University of Waterloo. Retrieved May 11, 2012.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.