- Algorithms
- Complexity Theory
- Cryptography
- +۳ مورد دیگر
Zvi Galil is a distinguished academic and former Dean of Computing at Georgia Institute of Technology (2010-2019). He holds the title of Storey Chair and serves as Executive Advisor for Online Programs. His academic journey includes leadership roles at Columbia University (Fu Foundation School of Engineering Dean, 1995-2007) and Tel Aviv University (President, 2007-2009). He earned degrees in Applied Mathematics from Tel Aviv University and a PhD in Computer Science from Cornell University. Galil’s research focuses on algorithms, complexity theory, cryptography, and stringology. He has authored over 200 papers and edited 5 books, with contributions to graph algorithms, parallel computing, and data structures. He is a Fellow of the ACM and American Academy of Arts and Sciences, and a member of the National Academy of Engineering. His work has influenced fields like online education through initiatives like OMSCS (Georgia Tech’s Online Master of Science in Computer Science). Educations: BS and MS (summa cum laude), Applied Mathematics, Tel Aviv University PhD, Computer Science, Cornell University His research trends span dynamic graph algorithms, real-time string processing, and scalable graph isomorphism techniques. He has also contributed to foundational areas like suffix trees and text indexing. His awards include the Columbia Great Teacher Award (2009) for pedagogical excellence. Awards: ACM Fellow Member, American Academy of Arts and Sciences Member, National Academy of Engineering Columbia Society of Graduates Great Teacher Award Galil advises on online education programs and collaborates with the Algorithms and Randomness Center (ARC) at Georgia Tech. He has held editorial roles at major journals and advised Oxford University Press on computer science publications.











