2026 Zvi Galil: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	63	2803	2720	1383	1332	203	12567

Research.com Recognitions

2005 - Fellow of the American Academy of Arts and Sciences
2004 - Member of the National Academy of Engineering For contributions to the design and analysis of algorithms and for leadership in computer science and engineering.
1995 - ACM Fellow For fundamental contributions to the design and analysis of algorithms and outstanding service to the theoretical computer science community.

Overview

Zvi Galil is affiliated with the Georgia Institute of Technology in the United States. Their research spans multiple areas within computer science, with a focus on intelligent tutoring systems, innovative teaching methods, and graph theory and algorithms. Their work also addresses topics related to online learning analytics and higher education research studies.

Their recent publications include:

OMSCS, 2020, Communications of the ACM
Creating a revolutionary academic program, 2022, Communications of the ACM
Efficient Graph Isomorphism Query Processing using Degree Sequences and Color-Label Distributions, 2022, 2022 IEEE 38th International Conference on Data Engineering (ICDE)

Frequent co-authors in their work include:

Umakishore Ramachandran
Geonmo Gu
Yehyun Nam
Kunsoo Park
Giuseppe F. Italiano

They have published mainly in the following venues:

Communications of the ACM
2022 IEEE 38th International Conference on Data Engineering (ICDE)

Their primary field of study is Computer Science, with subfields including artificial intelligence, developmental and educational psychology, computer science applications, education, and computer vision and pattern recognition.

Key topics covered in their research are:

Intelligent Tutoring Systems and Adaptive Learning
Innovative Teaching and Learning Methods
Online Learning and Analytics
Higher Education Research Studies
Graph Theory and Algorithms
Data Management and Algorithms
Advanced Graph Neural Networks

Zvi Galil has been recognized with several awards, including:

Fellow of the American Academy of Arts and Sciences, 2005
Member of the National Academy of Engineering, 2004, for contributions to the design and analysis of algorithms and for leadership in computer science and engineering
ACM Fellow, 1995, for fundamental contributions to the design and analysis of algorithms and outstanding service to the theoretical computer science community

Best Publications

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

H N Gabow;Z Galil;Z Galil;T Spencer;R E Tarjan

721
Citations
Efficient algorithms for finding maximum matching in graphs

Zvi Galil

634
Citations
Explicit constructions of linear-sized superconcentrators

Ofer Gabber;Zvi Galil

546
Citations
Sparsification—a technique for speeding up dynamic graph algorithms

David Eppstein;Zvi Galil;Giuseppe F. Italiano;Amnon Nissenzweig

542
Citations
Data structures and algorithms for disjoint set union problems

Zvi Galil;Giuseppe F. Italiano

281
Citations
Time-space-optimal string matching

Zvi Galil;Zvi Galil;Joel I. Seiferas

258
Citations
NP completeness of finding the chromatic index of regular graphs

Daniel Leven;Zvi Galil

256
Citations
Dynamic graph algorithms

Camil Demetrescu;David Eppstein;Zvi Galil;Giuseppe F. Italiano

235
Citations
An improved algorithm for approximate string matching

Zvi Galil;Kunsoo Park

233
Citations
Dynamic Graph Algorithms

Unknown

216
Citations
On the exponent of the all pairs shortest path problem

Noga Alon;Zvi Galil;Oded Margalit

213
Citations
Sparse dynamic programming I: linear cost functions

David Eppstein;Zvi Galil;Raffaele Giancarlo;Giuseppe F. Italiano

212
Citations
Combinatorial Algorithms on Words

Alberto Apostolico;Zvi Galil

202
Citations
Data structures and algorithms for approximate string matching

Z. Galil;R. Giancarlo

192
Citations
An O (EV log V) algorithm for finding a maximal weighted matching in general graphs

Zvi Galil;Silvio Micali;Harold Gabow

176
Citations
Improved string matching with k mismatches

Z Galil;R Giancarlo

163
Citations
Sparsification-a technique for speeding up dynamic graph algorithms

D. Eppstein

162
Citations
Highly parallelizable problems

O. Berkman;Dany Breslauer;Zvi Galil;Baruch Schieber

160
Citations
Speeding up dynamic programming with application to molecular biology

Zvi Galil;Raffaele Giancarlo

149
Citations
On improving the worst case running time of the Boyer-Moore string matching algorithm

Zvi Galil

145
Citations
Optimal parallel algorithms for string matching

Zvi Galil

122
Citations
Lower bounds on communication complexity

Pavol Duris;Zvi Galil;Georg Schnitger

82
Citations

Frequent Co-Authors

Moti Yung Columbia University

Giuseppe F. Italiano Guido Carli Free International University for Social Studies

David Eppstein University of California, Irvine

Raffaele Giancarlo University of Palermo

Harold N. Gabow University of Colorado Boulder

Victor Y. Pan City University of New York

Arnold L. Rosenberg University of Massachusetts Amherst

Noga Alon Tel Aviv University

Danny Dolev Hebrew University of Jerusalem

Wojciech Rytter University of Warsaw

External Links

Wikipedia of Zvi Galil Personal website of Zvi Galil Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Expanding your expertise in Computer Science can open doors to a range of related online degrees and career pathways. Many students consider interdisciplinary studies, such as environmental science or engineering, to broaden their job prospects and knowledge base.

If you are looking for flexible and affordable options, there are several fully accredited programs available. For those interested in environmental science, consider researching the cheapest online environmental science degree programs, which can provide a strong foundation in sustainability and technology.

Students seeking a more technical and hands-on field may explore an online degree for mechanical engineering, or build a solid understanding of physical systems through online physics degrees. These areas often complement computer science skills, especially in engineering and research roles.

Additionally, the demand for data scientists continues to grow across industries. Choosing from reputable data science programs online can help develop your analytical and programming skills for high-demand tech careers.