World's Best Scientists 2026 revealed!

D-Index & Metrics

Engineering and Technology

D-Index
63
Citations
13025
World Ranking
1798
National Ranking
583

Overview

Zvi Galil is affiliated with the Georgia Institute of Technology in the United States. Their research contributions span several fields within computer science, with a particular focus on artificial intelligence, computer vision and pattern recognition, and educational psychology. The primary area of study centers on computer science, supported by work in developmental and educational psychology, education, and computer science applications.

The research topics addressed by Galil include:

  • 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

Galil has published papers in various venues, demonstrating an interdisciplinary approach that combines theoretical computer science with education technology and data management. The most frequent publication venues are:

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

Recent selected publications include:

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

Galil's collaborative work involves several frequent co-authors, which reflect the interdisciplinary and collaborative nature of their research. These co-authors include:

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

The topics Galil has investigated cover a range of computational and educational challenges, combining algorithmic theory with practical approaches to online learning and intelligent educational systems. Their engagement with advanced graph neural networks and algorithms indicates a focus on both foundational and applied computer science research relevant to data-driven and adaptive learning environments.

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

  • Efficient algorithms for finding maximum matching in graphs

    Zvi Galil

  • Explicit constructions of linear-sized superconcentrators

    Ofer Gabber;Zvi Galil

  • Sparsification—a technique for speeding up dynamic graph algorithms

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

  • Pattern matching algorithms

    Alberto Apostolico;Zvi Galil

  • Data structures and algorithms for disjoint set union problems

    Zvi Galil;Giuseppe F. Italiano

  • Proceedings of the 30th IEEE symposium on Foundations of computer science

    Zvi Galil;E. K. Blum

  • NP completeness of finding the chromatic index of regular graphs

    Daniel Leven;Zvi Galil

  • Dynamic graph algorithms

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

  • An improved algorithm for approximate string matching

    Zvi Galil;Kunsoo Park

  • On the exponent of the all pairs shortest path problem

    Noga Alon;Zvi Galil;Oded Margalit

  • Sparse dynamic programming I: linear cost functions

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

  • Combinatorial Algorithms on Words

    Alberto Apostolico;Zvi Galil

  • Data structures and algorithms for approximate string matching

    Z. Galil;R. Giancarlo

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

    Zvi Galil;Silvio Micali;Harold Gabow

  • Improved string matching with k mismatches

    Z Galil;R Giancarlo

  • Highly parallelizable problems

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

  • Speeding up dynamic programming with application to molecular biology

    Zvi Galil;Raffaele Giancarlo

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

    Zvi Galil

  • Dynamic dictionary matching

    Amihood Amir;Martin Farach;Zvi Galil;Raffaele Giancarlo

  • Finding the Vertex Connectivity of Graphs

    Zvi Galil

  • An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database

    Zvi Galil

  • Sparse dynamic programming II: convex and concave cost functions

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

  • A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort

    Zvi Galil;Nimrod Megiddo

  • Explicit constructions of linear size superconcentrators

    Ofer Gabber;Zvi Galil

  • Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model (Extended Abstract)

    Zvi Galil;Zvi Galil;Stuart Haber;Moti Yung

  • Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs

    Zvi Galil;Silvio Micali;Harold Gabow

Frequent Co-Authors

Giuseppe F. Italiano
Giuseppe F. Italiano Guido Carli Free International University for Social Studies
Moti Yung
Moti Yung Columbia University
Raffaele Giancarlo
Raffaele Giancarlo University of Palermo
Harold N. Gabow
Harold N. Gabow University of Colorado Boulder
David Eppstein
David Eppstein University of California, Irvine
Victor Y. Pan
Victor Y. Pan City University of New York
Noga Alon
Noga Alon Tel Aviv University
Baruch Schieber
Baruch Schieber New Jersey Institute of Technology
Nimrod Megiddo
Nimrod Megiddo IBM (United States)
Amir Averbuch
Amir Averbuch Tel Aviv University

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

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Best Scientists Citing Zvi Galil

Trending Scientists

Recently Published Articles