Gad M. Landau

4.2k total citations
108 papers, 1.8k citations indexed

About

Gad M. Landau is a scholar working on Artificial Intelligence, Molecular Biology and Computational Theory and Mathematics. According to data from OpenAlex, Gad M. Landau has authored 108 papers receiving a total of 1.8k indexed citations (citations by other indexed papers that have themselves been cited), including 92 papers in Artificial Intelligence, 59 papers in Molecular Biology and 40 papers in Computational Theory and Mathematics. Recurrent topics in Gad M. Landau's work include Algorithms and Data Compression (92 papers), DNA and Biological Computing (41 papers) and semigroups and automata theory (31 papers). Gad M. Landau is often cited by papers focused on Algorithms and Data Compression (92 papers), DNA and Biological Computing (41 papers) and semigroups and automata theory (31 papers). Gad M. Landau collaborates with scholars based in Israel, United States and Italy. Gad M. Landau's co-authors include Uzi Vishkin, Amihood Amir, Jeanette P. Schmidt, Dina Sokol, Michal Ziv-Ukelson, Alberto Apostolico, Baruch Schieber, Maxime Crochemore, Oren Weimann and Eugene W. Myers and has published in prestigious journals such as Nucleic Acids Research, Bioinformatics and Methods in enzymology on CD-ROM/Methods in enzymology.

In The Last Decade

Gad M. Landau

103 papers receiving 1.7k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Gad M. Landau Israel	23	1.5k	949	559	489	168	108	1.8k
Alberto Apostolico United States	25	1.8k 1.2×	1.1k 1.2×	708 1.3×	407 0.8×	219 1.3×	117	2.2k
Raffaele Giancarlo Italy	24	1.1k 0.8×	907 1.0×	369 0.7×	315 0.6×	214 1.3×	89	1.7k
Amihood Amir United States	26	1.5k 1.0×	782 0.8×	712 1.3×	493 1.0×	184 1.1×	159	1.9k
Maxime Crochemore France	25	2.0k 1.3×	961 1.0×	1.1k 2.0×	601 1.2×	206 1.2×	147	2.5k
Roberto Grossi Italy	20	1.4k 0.9×	624 0.7×	394 0.7×	466 1.0×	387 2.3×	97	1.7k
Giovanni Manzini Italy	26	1.9k 1.3×	1.2k 1.3×	611 1.1×	459 0.9×	445 2.6×	86	2.5k
Thomas G. Szymanski United States	18	1.0k 0.7×	388 0.4×	504 0.9×	485 1.0×	412 2.5×	42	1.8k
Veli Mäkinen Finland	20	1.0k 0.7×	897 0.9×	206 0.4×	282 0.6×	184 1.1×	78	1.7k
Simon J. Puglisi Finland	17	720 0.5×	603 0.6×	171 0.3×	207 0.4×	145 0.9×	84	1.0k
Venkatesh Raman India	22	970 0.6×	357 0.4×	1.0k 1.9×	201 0.4×	639 3.8×	111	1.9k

Countries citing papers authored by Gad M. Landau

Since Specialization

Citations

This map shows the geographic impact of Gad M. Landau's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Gad M. Landau with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Gad M. Landau more than expected).

Fields of papers citing papers by Gad M. Landau

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Gad M. Landau. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Gad M. Landau. The network helps show where Gad M. Landau may publish in the future.

Co-authorship network of co-authors of Gad M. Landau

This figure shows the co-authorship network connecting the top 25 collaborators of Gad M. Landau. A scholar is included among the top collaborators of Gad M. Landau based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Gad M. Landau. Gad M. Landau is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Landau, Gad M., et al.. (2024). Conceptions Connected to Early Academic Studies in Computer Science: Focusing on Students, Lecturers, and Parents. Education Sciences. 14(12). 1282–1282. 1 indexed citations

Amir, Amihood, et al.. (2023). Reconstructing parameterized strings from parameterized suffix and LCP arrays. Theoretical Computer Science. 981. 114230–114230.

Gawrychowski, Paweł, et al.. (2020). On Indeterminate Strings Matching.. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 14. 3 indexed citations

Gawrychowski, Paweł, et al.. (2018). Fast Entropy-Bounded String Dictionary Look-Up with Mismatches.. arXiv (Cornell University). 1 indexed citations

Crochemore, Maxime, et al.. (2017). Locating maximal approximate runs in a string. Theoretical Computer Science. 700. 45–62.

Gawrychowski, Paweł, Gad M. Landau, Shay Mozes, & Oren Weimann. (2016). The Nearest Colored Node in a Tree. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Amir, Amihood, et al.. (2016). Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings. Theoretical Computer Science. 656. 146–159. 5 indexed citations

Amir, Amihood, Alberto Apostolico, Gad M. Landau, et al.. (2014). Range LCP. Journal of Computer and System Sciences. 80(7). 1245–1253. 7 indexed citations

Ferragina, Paolo & Gad M. Landau. (2008). Combinatorial pattern matching : 19th annual symposium, CPM 2008, Pisa, Italy, June 18-20, 2008 : proceedings. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 2 indexed citations

10.

Antoniou, Pavlos, et al.. (2008). Conservative String Covering of Indeterminate Strings.. Research Portal (King's College London). 108–115. 6 indexed citations

11.

Backofen, Rolf, Danny Hermelin, Gad M. Landau, et al.. (2007). Locality and Gaps in RNA Comparison. Journal of Computational Biology. 14(8). 1074–1087. 8 indexed citations

12.

Iliopoulos, Costas S., et al.. (2005). Approximation algorithm for the cyclic swap problem. 190–200. 2 indexed citations

13.

Amir, Amihood, Gad M. Landau, & Dina Sokol. (2003). Inplace 2D matching in compressed images. Symposium on Discrete Algorithms. 853–862. 5 indexed citations

14.

Crochemore, Maxime, Gad M. Landau, & Michal Ziv-Ukelson. (2003). A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices. SIAM Journal on Computing. 32(6). 1654–1673. 75 indexed citations

15.

Landau, Gad M., Baruch Schieber, & Michal Ziv-Ukelson. (2003). Sparse LCS Common Substring Alignment. Information Processing Letters. 88(6). 259–270. 8 indexed citations

16.

Amir, Amihood, Gad M. Landau, & Dina Sokol. (2000). Inplace run-length 2d compressed search. Symposium on Discrete Algorithms. 817–818. 6 indexed citations

17.

Landau, Gad M. & Michal Ziv-Ukelson. (2000). On the shared substring alignment problem. Symposium on Discrete Algorithms. 804–814. 3 indexed citations

18.

Amir, Amihood, et al.. (1999). Indexing and Dictionary Matching with One Error. 181–192. 10 indexed citations

19.

Landau, Gad M. & Uzi Vishkin. (1988). Fast string matching with k differences. Journal of Computer and System Sciences. 37(1). 63–78. 92 indexed citations

20.

Landau, Gad M., et al.. (1985). Distributed Algorithms in Synchronous Broadcasting Networks (Extended Abstract). International Colloquium on Automata, Languages and Programming. 363–372. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact