World's Best Scientists 2026 revealed!
Gad M. Landau

Gad M. Landau

D-Index & Metrics

Computer Science

D-Index
38
Citations
5626
World Ranking
10310
National Ranking
166

Overview

Gad M. Landau is affiliated with the University of Haifa in Israel and has made contributions primarily in the field of Computer Science, with a focus on multiple subfields and topics.

Landau's work spans these subfields of study:

  • Artificial Intelligence
  • Molecular Biology
  • Computational Theory and Mathematics
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition

The main topics in their research include:

  • Algorithms and Data Compression
  • Natural Language Processing Techniques
  • DNA and Biological Computing
  • Semigroups and Automata Theory
  • Network Packet Processing and Optimization
  • Advanced Image and Video Retrieval Techniques
  • Teaching and Learning Programming

Among frequent publication venues, Landau has contributed most often to:

  • Theoretical Computer Science
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Algorithmica
  • arXiv (Cornell University)
  • SSRN Electronic Journal

Selected recent papers authored or coauthored by Landau include:

  • Finding patterns and periods in Cartesian tree matching, 2020, Theoretical Computer Science
  • On Indeterminate Strings Matching., 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Double String Tandem Repeats, 2022, Algorithmica
  • Reconstructing parameterized strings from parameterized suffix and LCP arrays, 2023, Theoretical Computer Science
  • Top Tree Compression of Tries, 2021, Algorithmica

Landau has frequently collaborated with the following researchers:

  • Amihood Amir
  • Samah Ghazawi
  • Shoshana Marcus
  • Dina Sokol
  • Paweł Gawrychowski

Best Publications

  • Fast parallel and serial approximate string matching

    G. M. Landau;U. Vishkin

  • Fast string matching with k -differences

    Gad M. Landau;Uzi Vishkin

  • Efficient String Matching With K Mismatches

    G M Landau;U Vishkin

  • Incremental String Comparison

    Gad M. Landau;Eugene W. Myers;Jeanette P. Schmidt

  • A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices

    Maxime Crochemore;Gad M. Landau;Michal Ziv-Ukelson

  • Parallel construction of a suffix tree with applications

    A. Apostolico;C. Iliopoulos;G. M. Landau;B. Schieber

  • An algorithm for approximate tandem repeats.

    Gad M. Landau;Jeanette P. Schmidt;Dina Sokol

  • Introducing efficient parallelism into approximate string matching and a new serial algorithm

    G M Landau;U Vishkin

  • An Algorithm for Approximate Tandem Repeats

    Gad M. Landau;Jeanette P. Schmidt

  • Efficient pattern matching with scaling

    Amihood Amir;Gad M. Landau;Uzi Vishkin;Uzi Vishkin

  • Random Access to Grammar-Compressed Strings and Trees

    Philip Bille;Gad M. Landau;Rajeev Raman;Kunihiko Sadakane

  • Sequence complexity profiles of prokaryotic genomic sequences: a fast algorithm for calculating linguistic complexity.

    Olga G. Troyanskaya;Ora Arbell;Yair Koren;Gad M. Landau;Gad M. Landau

  • Efficient string matching in the presence of errors

    Gad M. Landau;Uzi Vishkin

  • Pattern Matching with Swaps

    Amihood Amir;Yonatan Aumann;Gad M. Landau;Moshe Lewenstein

  • An efficient algorithm for the All Pairs Suffix-Prefix Problem

    Dan Gusfield;Gad M. Landau;Baruch Schieber

  • An Extension of the Vector Space Model for Querying XML Documents via XML Fragments 1

    David Carmel;Nadav Efraty;Gad M. Landau;Yoelle S. Maarek

  • Identifying periodic occurrences of a template with applications to protein structure

    Vincent A. Fischetti;Gad M. Landau;Peter H. Sellers;Jeanette P. Schmidt

  • Text Indexing and Dictionary Matching with One Error

    Amihood Amir;Dmitry Keselman;Gad M. Landau;Moshe Lewenstein

  • Matching for Run-Length Encoded Strings

    Alberto Apostolico;Gad M Landau;Steven Skiena

  • Random access to grammar-compressed strings

    Philip Bille;Gad M. Landau;Rajeev Raman;Kunihiko Sadakane

  • On Cartesian Trees and Range Minimum Queries

    Erik D. Demaine;Gad M. Landau;Oren Weimann

  • On Cartesian Trees and Range Minimum Queries

    Erik D. Demaine;Gad M. Landau;Gad M. Landau;Oren Weimann

Frequent Co-Authors

Amihood Amir
Amihood Amir Bar-Ilan University
Uzi Vishkin
Uzi Vishkin University of Maryland, College Park
Maxime Crochemore
Maxime Crochemore King's College London
Rolf Backofen
Rolf Backofen University of Freiburg
Baruch Schieber
Baruch Schieber New Jersey Institute of Technology
Costas S. Iliopoulos
Costas S. Iliopoulos King's College London
Vincent A. Fischetti
Vincent A. Fischetti Rockefeller University
Ruth Nussinov
Ruth Nussinov National Institutes of Health
Kunihiko Sadakane
Kunihiko Sadakane University of Tokyo
Steven Skiena
Steven Skiena Stony Brook 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:

Related Online Degrees & Career Pathways

Expanding your computer science education can open up a wide range of career opportunities in tech-driven industries. Many students are now choosing accredited programs that offer the flexibility of remote learning without sacrificing quality. For those interested in interdisciplinary skills, there are excellent accredited online electrical engineering programs that offer strong foundations in both hardware and software concepts.

If you’re seeking a more specialized path, pursuing the data science learning path can help you gain expertise in big data, machine learning, and AI—fields with high employer demand and lucrative salaries. Alternatively, online physics degrees can prepare you for technical careers that blend scientific theory with computational skills.

For those looking to quickly boost employability, consider certifications that pay well. These streamlined programs can provide targeted skills and impressive salary gains without the time investment of a traditional degree. No matter your area of interest, online study offers numerous flexible pathways in the evolving tech landscape.

Best Scientists Citing Gad M. Landau

Trending Scientists