Zvi Galil – Communications of the ACM

Research and Advances Oct 1 2022

Creating a Revolutionary Academic Program

Overcoming the inherent challenges.

Computing Applications

student in a graduate's cap on a laptop computer display, illustration

Author Archives

Opinion Aug 1 2020

OMSCS: The Revolution Will Be Digitized

Lessons learned from the first five years of Georgia Tech's Online Master of Science in Computer Science program.

Computing Profession

OMSCS initials and binary code, illustration

Research and Advances Apr 1 2016

40 Years of Suffix Trees

Tracing the first four decades in the life of suffix trees, their many incarnations, and their applications.

Computing Profession

Research and Advances Sep 1 1979

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

It is shown how to modify the Boyer-Moore string matching algorithm so that its worst case running time is linear even when multiple occurrences of the pattern are present in the text.

Shape the Future of Computing

ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.

Get Involved