default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGad M. Landau
Person information
- affiliation: University of Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j80]Amihood Amir, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Reconstructing parameterized strings from parameterized suffix and LCP arrays. Theor. Comput. Sci. 981: 114230 (2024)- 2023
- [j79]Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol
:
Double String Tandem Repeats. Algorithmica 85(1): 170-187 (2023) - [c80]Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau:
Order-Preserving Squares in Strings. CPM 2023: 13:1-13:19 - [i15]Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau:
Order-Preserving Squares in Strings. CoRR abs/2302.00724 (2023) - 2022
- [c79]Amihood Amir, Concettina Guerra, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays. SPIRE 2022: 55-69 - 2021
- [j78]Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Top Tree Compression of Tries. Algorithmica 83(12): 3602-3628 (2021) - [c78]Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau:
Lower Bounds for the Number of Repetitions in 2D Strings. SPIRE 2021: 179-192 - [i14]Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau:
Lower Bounds for the Number of Repetitions in 2D Strings. CoRR abs/2105.14903 (2021) - 2020
- [j77]Amihood Amir, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Two-dimensional maximal repetitions. Theor. Comput. Sci. 812: 49-61 (2020) - [j76]Sung Gwan Park, Magsarjav Bataa, Amihood Amir, Gad M. Landau, Kunsoo Park:
Finding patterns and periods in Cartesian tree matching. Theor. Comput. Sci. 845: 181-197 (2020) - [c77]Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Double String Tandem Repeats. CPM 2020: 3:1-3:13 - [c76]Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau:
On Indeterminate Strings Matching. CPM 2020: 14:1-14:14
2010 – 2019
- 2019
- [c75]Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park:
Cartesian Tree Matching and Indexing. CPM 2019: 16:1-16:14 - [c74]Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Top Tree Compression of Tries. ISAAC 2019: 4:1-4:18 - [c73]Magsarjav Bataa, Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park:
Finding Periods in Cartesian Tree Matching. IWOCA 2019: 70-84 - [i13]Philip Bille, Inge Li Gørtz, Pawel Gawrychowski, Gad M. Landau, Oren Weimann:
Top Tree Compression of Tries. CoRR abs/1902.02187 (2019) - [i12]Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park:
Cartesian Tree Matching and Indexing. CoRR abs/1905.08974 (2019) - 2018
- [j75]Xinrui Zhou, Amihood Amir, Concettina Guerra, Gad M. Landau, Jarek Rossignac:
EDoP Distance Between Sets of Incomplete Permutations: Application to Bacteria Classification Based on Gene Order. J. Comput. Biol. 25(11): 1193-1202 (2018) - [j74]Amihood Amir, Mika Amit, Gad M. Landau, Dina Sokol:
Period recovery of strings over the Hamming and edit distances. Theor. Comput. Sci. 710: 2-18 (2018) - [j73]Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann:
The nearest colored node in a tree. Theor. Comput. Sci. 710: 66-73 (2018) - [c72]Amihood Amir, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Two-Dimensional Maximal Repetitions. ESA 2018: 2:1-2:14 - [c71]Pawel Gawrychowski, Gad M. Landau, Wing-Kin Sung, Oren Weimann:
A Faster Construction of Greedy Consensus Trees. ICALP 2018: 63:1-63:14 - [c70]Pawel Gawrychowski, Gad M. Landau, Tatiana Starikovskaya:
Fast Entropy-Bounded String Dictionary Look-Up with Mismatches. MFCS 2018: 66:1-66:15 - [i11]Pawel Gawrychowski, Gad M. Landau, Tatiana Starikovskaya:
Fast entropy-bounded string dictionary look-up with mismatches. CoRR abs/1806.09646 (2018) - 2017
- [j72]Amihood Amir, Alberto Apostolico, Travis Gagie, Gad M. Landau:
String cadences. Theor. Comput. Sci. 698: 4-8 (2017) - [j71]Mika Amit, Maxime Crochemore, Gad M. Landau, Dina Sokol:
Locating maximal approximate runs in a string. Theor. Comput. Sci. 700: 45-62 (2017) - [i10]Pawel Gawrychowski, Gad M. Landau, Wing-Kin Sung, Oren Weimann:
A Faster Construction of Phylogenetic Consensus Trees. CoRR abs/1705.10548 (2017) - 2016
- [j70]Alberto Apostolico, Concettina Guerra, Gad M. Landau, Cinzia Pizzi:
Sequence similarity measures based on bounded hamming distance. Theor. Comput. Sci. 638: 76-90 (2016) - [j69]Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Longest common extensions in trees. Theor. Comput. Sci. 638: 98-107 (2016) - [j68]Amihood Amir, Alberto Apostolico, Tirza Hirst, Gad M. Landau, Noa Lewenstein, Liat Rozenberg:
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings. Theor. Comput. Sci. 656: 146-159 (2016) - [c69]Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann:
The Nearest Colored Node in a Tree. CPM 2016: 25:1-25:12 - [c68]Amihood Amir, Mika Amit, Gad M. Landau, Dina Sokol:
Period Recovery over the Hamming and Edit Distances. LATIN 2016: 55-67 - [r2]Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park:
Similarity Between Compressed Strings. Encyclopedia of Algorithms 2016: 1977-1981 - [i9]Amihood Amir, Alberto Apostolico, Travis Gagie, Gad M. Landau:
String Cadences. CoRR abs/1610.03337 (2016) - 2015
- [j67]Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann:
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. Algorithmica 73(3): 571-588 (2015) - [j66]Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Tree compression with top trees. Inf. Comput. 243: 166-177 (2015) - [j65]Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau:
Computing the Burrows-Wheeler transform in place and in small space. J. Discrete Algorithms 32: 44-52 (2015) - [j64]Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann:
Random Access to Grammar-Compressed Strings and Trees. SIAM J. Comput. 44(3): 513-539 (2015) - [j63]Amihood Amir, Alberto Apostolico, Gad M. Landau, Ely Porat, Oren Sar Shalom:
A PTAS for the Square Tiling Problem. Theor. Comput. Sci. 562: 33-45 (2015) - [c67]Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Longest Common Extensions in Trees. CPM 2015: 52-64 - [c66]Pooya Davoodi, John Iacono, Gad M. Landau, Moshe Lewenstein:
Range Minimum Query Indexes in Higher Dimensions. CPM 2015: 149-159 - 2014
- [j62]Erik D. Demaine, Gad M. Landau, Oren Weimann:
On Cartesian Trees and Range Minimum Queries. Algorithmica 68(3): 610-625 (2014) - [j61]Christina Otto, Mathias Möhl, Steffen Heyne, Mika Amit, Gad M. Landau, Rolf Backofen, Sebastian Will:
ExpaRNA-P: simultaneous exact pattern matching and folding of RNAs. BMC Bioinform. 15: 6602 (2014) - [j60]Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat:
Range LCP. J. Comput. Syst. Sci. 80(7): 1245-1253 (2014) - [j59]Mika Amit, Rolf Backofen, Steffen Heyne, Gad M. Landau, Mathias Möhl, Christina Otto, Sebastian Will:
Local Exact Pattern Matching for Non-FixedRNA Structures. IEEE ACM Trans. Comput. Biol. Bioinform. 11(1): 219-230 (2014) - [j58]Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein:
Detecting approximate periodic patterns. Theor. Comput. Sci. 525: 60-67 (2014) - [c65]Amihood Amir, Alberto Apostolico, Tirza Hirst, Gad M. Landau, Noa Lewenstein, Liat Rozenberg:
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded Strings. SPIRE 2014: 45-51 - [i8]Danny Hermelin, Gad M. Landau, Yuri Rabinovich, Oren Weimann:
Binary Jumbled Pattern Matching via All-Pairs Shortest Paths. CoRR abs/1401.2065 (2014) - [i7]Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Longest Common Extensions in Trees. CoRR abs/1412.1254 (2014) - 2013
- [j57]Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann:
Unified Compression-Based Acceleration of Edit-Distance Computation. Algorithmica 65(2): 339-353 (2013) - [j56]Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann:
On approximating string selection problems with outliers. Theor. Comput. Sci. 498: 107-114 (2013) - [c64]Mika Amit, Maxime Crochemore, Gad M. Landau:
Locating All Maximal Approximate Runs in a String. CPM 2013: 13-27 - [c63]Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau:
A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform. CPM 2013: 74-82 - [c62]Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann:
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. ESA 2013: 517-528 - [c61]Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Tree Compression with Top Trees. ICALP (1) 2013: 160-171 - [i6]Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann:
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. CoRR abs/1301.6127 (2013) - [i5]Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Tree Compression with Top Trees. CoRR abs/1304.5702 (2013) - 2012
- [j55]Hideo Bannai, Travis Gagie, Tomohiro I, Shunsuke Inenaga, Gad M. Landau, Moshe Lewenstein:
An efficient algorithm to test square-freeness of strings compressed by straight-line programs. Inf. Process. Lett. 112(19): 711-714 (2012) - [c60]Mika Amit, Rolf Backofen, Steffen Heyne, Gad M. Landau, Mathias Möhl, Christina Schmiedl, Sebastian Will:
Local Exact Pattern Matching for Non-fixed RNA Structures. CPM 2012: 306-320 - [c59]Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann:
On Approximating String Selection Problems with Outliers. CPM 2012: 427-438 - [c58]Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein:
Detecting Approximate Periodic Patterns. MedAlg 2012: 1-12 - [c57]Christina Schmiedl, Mathias Möhl, Steffen Heyne, Mika Amit, Gad M. Landau, Sebastian Will, Rolf Backofen:
Exact Pattern Matching for RNA Structure Ensembles. RECOMB 2012: 245-260 - [i4]Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann:
On Approximating String Selection Problems with Outliers. CoRR abs/1202.2820 (2012) - 2011
- [j54]Gad M. Landau, Avivit Levy, Ilan Newman:
LCS approximation via embedding into locally non-repetitive strings. Inf. Comput. 209(4): 705-716 (2011) - [j53]Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann:
Fast RNA structure alignment for crossing input structures. J. Discrete Algorithms 9(1): 2-11 (2011) - [j52]Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg:
Haplotype Inference Constrained by Plausible Haplotype Data. IEEE ACM Trans. Comput. Biol. Bioinform. 8(6): 1692-1699 (2011) - [j51]Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim:
Efficient algorithms for consensus string problems minimizing both distance sum and radius. Theor. Comput. Sci. 412(39): 5239-5246 (2011) - [c56]Gad M. Landau:
Algorithms on Grammar-Compressed Strings. CPM 2011: 1 - [c55]Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat:
Range LCP. ISAAC 2011: 683-692 - [c54]Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann:
Random Access to grammar-Compressed Strings. SODA 2011: 373-389 - [c53]Brona Brejová, Gad M. Landau, Tomás Vinar:
Fast Computation of a String Duplication History under No-Breakpoint-Reuse - (Extended Abstract). SPIRE 2011: 144-155 - 2010
- [c52]Gad M. Landau, Dekel Tsur, Oren Weimann:
Indexing a Dictionary for Subset Matching Queries. Algorithms and Applications 2010: 158-169 - [c51]Amihood Amir, Alberto Apostolico, Gad M. Landau, Oren Sar Shalom:
A PTAS for the Square Tiling Problem. SPIRE 2010: 118-126 - [c50]Zvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe Lewenstein:
Restricted LCS. SPIRE 2010: 250-257 - [i3]Philip Bille, Gad M. Landau, Oren Weimann:
Random Access to Grammar Compressed Strings. CoRR abs/1001.1565 (2010) - [i2]Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann:
Unified Compression-Based Acceleration of Edit-Distance Computation. CoRR abs/1004.1194 (2010)
2000 – 2009
- 2009
- [j50]Oren Kapah, Gad M. Landau, Avivit Levy, Nitsan Oz:
Interchange rearrangement: The element-cost model. Theor. Comput. Sci. 410(43): 4315-4326 (2009) - [j49]Paolo Ferragina, Gad M. Landau:
Foreword. Theor. Comput. Sci. 410(51): 5299 (2009) - [c49]Gad M. Landau, Avivit Levy, Ilan Newman:
LCS Approximation via Embedding into Local Non-repetitive Strings. CPM 2009: 92-105 - [c48]Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann:
Fast RNA Structure Alignment for Crossing Input Structures. CPM 2009: 236-248 - [c47]Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg:
Haplotype Inference Constrained by Plausible Haplotype Data. CPM 2009: 339-352 - [c46]Erik D. Demaine, Gad M. Landau, Oren Weimann:
On Cartesian Trees and Range Minimum Queries. ICALP (1) 2009: 341-353 - [c45]Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim:
Consensus Optimizing Both Distance Sum and Radius. SPIRE 2009: 234-242 - [c44]Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann:
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression. STACS 2009: 529-540 - [i1]Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann:
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression. CoRR abs/0902.2649 (2009) - 2008
- [j48]Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park:
Computing similarity of run-length encoded strings with affine gap penalty. Theor. Comput. Sci. 395(2-3): 268-282 (2008) - [j47]Maxime Crochemore, Danny Hermelin, Gad M. Landau, Dror Rawitz, Stéphane Vialette:
Approximating the 2-interval pattern problem. Theor. Comput. Sci. 395(2-3): 283-297 (2008) - [c43]Gad M. Landau:
Approximate Runs - Revisited. SPIRE 2008: 2 - [c42]Oren Kapah, Gad M. Landau, Avivit Levy, Nitsan Oz:
Interchange Rearrangement: The Element-Cost Model. SPIRE 2008: 224-235 - [c41]Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Inuka Jayasekera, Gad M. Landau:
Conservative String Covering of Indeterminate Strings. Stringology 2008: 108-115 - [e2]Paolo Ferragina, Gad M. Landau:
Combinatorial Pattern Matching, 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008, Proceedings. Lecture Notes in Computer Science 5029, Springer 2008, ISBN 978-3-540-69066-5 [contents] - [r1]Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park:
Similarity between Compressed Strings. Encyclopedia of Algorithms 2008 - 2007
- [j46]Rolf Backofen, Shihyen Chen, Danny Hermelin, Gad M. Landau, Mikhail A. Roytberg, Oren Weimann, Kaizhong Zhang:
Locality and Gaps in RNA Comparison. J. Comput. Biol. 14(8): 1074-1087 (2007) - [j45]Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur:
Optimal spaced seeds for faster approximate string matching. J. Comput. Syst. Sci. 73(7): 1035-1044 (2007) - [j44]Gad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson:
Two algorithms for LCS Consecutive Suffix Alignment. J. Comput. Syst. Sci. 73(7): 1095-1117 (2007) - [j43]Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol:
Dynamic text and static pattern matching. ACM Trans. Algorithms 3(2): 19 (2007) - [c40]Gad M. Landau, Dekel Tsur, Oren Weimann:
Indexing a Dictionary for Subset Matching Queries. SPIRE 2007: 195-204 - 2006
- [j42]Shiri Dori, Gad M. Landau:
Construction of Aho Corasick automaton in linear time for integer alphabets. Inf. Process. Lett. 98(2): 66-72 (2006) - [j41]Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson:
On the Complexity of Sparse Exon Assembly. J. Comput. Biol. 13(5): 1013-1027 (2006) - [c39]Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann:
Local Alignment of RNA Sequences with Arbitrary Scoring Schemes. CPM 2006: 246-257 - [c38]Gad M. Landau:
Can dist tables be merged in linear time - An Open Problem. Stringology 2006: 1 - 2005
- [j40]Nadav Efraty, Gad M. Landau:
Sparse Normalized Local Alignment. Algorithmica 43(3): 179-194 (2005) - [j39]Amihood Amir, Gad M. Landau:
Foreword. Discret. Appl. Math. 146(2): 123 (2005) - [j38]Gad M. Landau, Laxmi Parida, Oren Weimann:
Gene Proximity Analysis across Whole Genomes via PQ Trees1. J. Comput. Biol. 12(10): 1289-1306 (2005) - [c37]Gad M. Landau, Laxmi Parida, Oren Weimann:
Using PQ Trees for Comparative Genomics. CPM 2005: 128-143 - [c36]Shiri Dori, Gad M. Landau:
Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets. CPM 2005: 168-177 - [c35]Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson:
On the Complexity of Sparse Exon Assembly. CPM 2005: 201-218 - [c34]Maxime Crochemore, Danny Hermelin, Gad M. Landau, Stéphane Vialette:
Approximating the 2-Interval Pattern Problem. ESA 2005: 426-437 - [c33]Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur:
Optimal Spaced Seeds for Faster Approximate String Matching. ICALP 2005: 1251-1262 - [c32]Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park:
Computing Similarity of Run-Length Encoded Strings with Affine Gap Penalty. SPIRE 2005: 315-326 - [c31]Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann:
Normalized Similarity of RNA Sequences. SPIRE 2005: 360-369 - [c30]Yoan José Pinzón Ardila, Costas S. Iliopoulos, Gad M. Landau, Manal Mohamed:
Approximation algorithm for the cyclic swap problem. Stringology 2005: 190-200 - 2004
- [j37]Ayelet Butman, Revital Eres, Gad M. Landau:
Scaled and permuted string matching. Inf. Process. Lett. 92(6): 293-297 (2004) - [j36]Revital Eres, Gad M. Landau, Laxmi Parida:
Permutation Pattern Discovery in Biosequences. J. Comput. Biol. 11(6): 1050-1060 (2004) - [j35]Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps:
Two-dimensional pattern matching with rotations. Theor. Comput. Sci. 314(1-2): 173-187 (2004) - [c29]Gad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson:
Two Algorithms for LCS Consecutive Suffix Alignment. CPM 2004: 173-193 - [c28]Nadav Efraty, Gad M. Landau:
Sparse Normalized Local Alignment. CPM 2004: 333-346 - [c27]Ayelet Butman, Revital Eres, Gad M. Landau:
Permuted and Scaled String Matching. SPIRE 2004: 72-73 - [c26]Gad M. Landau, Ofer Levi, Steven Skiena:
Alphabet Permutation for Differentially Encoding Text. SPIRE 2004: 216-217 - 2003
- [j34]Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson:
Sparse LCS Common Substring Alignment. Inf. Process. Lett. 88(6): 259-270 (2003) - [j33]Amihood Amir, Gad M. Landau, Dina Sokol:
Inplace 2D matching in compressed images. J. Algorithms 49(2): 240-261 (2003) - [j32]Amihood Amir, Alberto Apostolico, Gad M. Landau, Giorgio Satta:
Efficient text fingerprinting via Parikh mapping. J. Discrete Algorithms 1(5-6): 409-421 (2003) - [j31]Maxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson: