Zvi Galil

Zvi Galil
Born (1947-06-26) June 26, 1947[1]
Tel Aviv, Mandatory Palestine[1]
Fields Computer science, mathematics
Institutions IBM Thomas J. Watson Research Center
Tel Aviv University
Columbia University
Georgia Institute of Technology
Alma mater Tel Aviv University
Cornell
Doctoral advisor John Hopcroft[2][3]
Doctoral students Mordechai Ben-Ari, Moti Yung, Stuart Haber, David Eppstein, Raffaele Giancarlo, Kunsoo Park, Giuseppe F. Italiano, Matthew K. Franklin, Amir Ben-Amram, Alain Mayer, Jonathan Katz, Sabah Al-Binali, Amir Averbuch, Dany Breslauer, Oded Margalit, Adam Young, Xiangdong Yu[2][3]
Notable awards ACM Fellow, NAE Member, American Academy of Arts and Sciences Fellow

Zvi Galil (Hebrew: צבי גליל‎‎; born 1947) is an Israeli computer scientist and mathematician. He is the dean of the Georgia Institute of Technology College of Computing.[4] 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.[5][6] He has published over 170 scientific papers[7] and is listed as an ISI highly cited researcher.[8]

Early life and education

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

Academic administrator

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] From 1995-2007, he served as the dean of the Fu Foundation School of Engineering & Applied Science. In this position he oversaw the renaming 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]

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

Galil served as the President of Tel Aviv University starting in 2007,[12] but resigned and returned to the faculty in 2009.[13] He was named as the dean of Georgia Tech's College of Computing on April 9, 2010.[4]

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:

Awards and honors

In 1995, he 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,"[14] 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."[15][16] In 2005 he was selected as a Fellow of the American Academy of Arts and Sciences.[17] In 2009 the Columbia Society of Graduates awarded him the Great Teacher Award.[18] 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."[19]

References

  1. 1 2 3 4 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. 1 2 "Theory of Computation Ph.D. Genealogy Database".
  3. 1 2 3 Zvi Galil at the Mathematics Genealogy Project
  4. 1 2 "Institute names next College of Computing Dean" (Press release). Georgia Institute of Technology. 2010-04-09. Retrieved 2010-04-09.
  5. ↑ "Introduction to Stringology". The Prague Stringology Club. Czech Technical University in Prague. Retrieved May 14, 2012.
  6. ↑ 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. Retrieved May 14, 2012.
  7. ↑ "Zvi Galil". The DBLP Computer Science Bibliography. Digital Bibliography & Library Project. Retrieved 2016-03-24.
  8. ↑ "ISI Highly Cited Researchers Version 1.1: Zvi Galil". ISI Web of Knowledge. Retrieved 2011-06-27.
  9. ↑ "On converting on-line algorithms into real-time and on real-time algorithms for string-matching and palindrome recognition". ACM SIGACT News. 7 (4). doi:10.1145/990502.990505.
  10. ↑ Arenson, Karen W. (1997-10-01). "Chinese Tycoon Gives Columbia $26 Million". New York Times. Retrieved 2010-04-20.
  11. ↑ "Front matter". ACM SIGACT News. 19 (1). Fall 1987.
  12. ↑ "Computer expert nominated for TAU presidency". Jerusalem Post. November 5, 2006..
  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. ↑ ACM Fellow Award / Zvi Galil
  15. ↑ "Dr. Zvi Galil". NAE Members. National Academy of Engineering. Retrieved May 11, 2012.
  16. ↑ "Zvi Galil Elected to National Academy of Engineering". Columbia News. Columbia University. Retrieved May 11, 2012.
  17. ↑ Academy Elects 225th Class of Fellows and Foreign Honorary Members, American Association for the Advancement of Science, April 26, 2005.
  18. ↑ "Zvi Galil School of Computer Science".
  19. ↑ 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 - version of the 9/30/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.