Text Indexing for Simple Regular Expressions, Bannai, H., Bille, P., Gørtz, I. L., Landau, G. M., Navarro, G., Prezza, N., Steiner, T. A. & Tarnow, S. R., 10 Jun 2025, 36th Annual Symposium on Combinatorial Pattern Matching, CPM 2025. Bonizzoni, P. & Makinen, V. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 20. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 331).
Order-Preserving Squares in Strings, Ghazawi, S., Landau, G. M. & Gawrychowski, P., Jun 2023, 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023. Bulteau, L. & Liptak, Z. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 13. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 259).
Double String Tandem Repeats, Amir, A., Butman, A., Landau, G. M., Marcus, S. & Sokol, D., Jan 2023, In: Algorithmica.85, 1, p. 170-18718 p.
Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays, Amir, A., Guerra, C., Kondratovsky, E., Landau, G. M., Marcus, S. & Sokol, D., 2022, String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Proceedings. Arroyuelo, D., Arroyuelo, D. & Poblete, B. (eds.). Springer Science and Business Media Deutschland GmbH, p. 55-6915 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13617 LNCS).
Lower Bounds for the Number of Repetitions in 2D Strings, Gawrychowski, P., Ghazawi, S. & Landau, G. M., 2021, String Processing and Information Retrieval - 28th International Symposium, SPIRE 2021, Proceedings. Lecroq, T. & Touzet, H. (eds.). Springer Science and Business Media Deutschland GmbH, p. 179-19214 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12944 LNCS).
Top Tree Compression of Tries, Bille, P., Gawrychowski, P., Gørtz, I. L., Landau, G. M. & Weimann, O., 2021, In: Algorithmica.83, 12, p. 3602-362827 p.
On Indeterminate Strings Matching, Gawrychowski, P., Ghazawi, S. & Landau, G. M., 1 Jun 2020, 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020. Gortz, I. L. & Weimann, O. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 14. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 161).
Fast entropy-bounded string dictionary look-up with mismatches, Gawrychowski, P., Landau, G. M. & Starikovskaya, T., 1 Aug 2018, 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018. Potapov, I., Worrell, J. & Spirakis, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 66. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 117).
Longest common extensions in trees, Bille, P., Gawrychowski, P., Gørtz, I. L., Landau, G. M. & Weimann, O., 25 Jul 2016, In: Theoretical Computer Science.638, p. 98-10710 p.
Similarity Between Compressed Strings, Kim, J. W., Amir, A., Landau, G. M. & Park, K., 1 Jan 2016, Encyclopedia of Algorithms, Second Edition. Springer New York, p. 1977-19815 p.
Range minimum query indexes in higher dimensions, Davoodi, P., Iacono, J., Landau, G. M. & Lewenstein, M., 2015, Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Proceedings. Vaccaro, U., Porat, E. & Cicalese, F. (eds.). Springer Verlag, p. 149-15911 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9133).
Tree compression with top trees, Bille, P., Gørtz, I. L., Landau, G. M. & Weimann, O., 2013, Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings.PART 1 ed.p. 160-17112 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7965 LNCS, no. PART 1).
Detecting Approximate Periodic Patterns, Amir, A., Apostolico, A., Eisenberg, E., Landau, G. M., Levy, A. & Lewenstein, N., 2012, Design and Analysis of Algorithms - 1st Mediterranean Conference on Algorithms, MedAlg 2012, Proceedings. Even, G. & Rawitz, D. (eds.). Springer Science and Business Media Deutschland GmbH, p. 1-1212 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7659 LNNS).
Consensus optimizing both distance sum and radius, Amir, A., Landau, G. M., Na, J. C., Park, H., Park, K. & Sim, J. S., 2009, String Processing and Information Retrieval - 16th International Symposium, SPIRE 2009, Proceedings.p. 234-2429 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5721 LNCS).
Locality and gaps in RNA comparison, Backofen, R., Chen, S., Hermelin, D., Landau, G. M., Roytberg, M. A., Weimann, O. & Zhang, K., 1 Oct 2007, In: Journal of Computational Biology.14, 8, p. 1074-108714 p.
Indexing a dictionary for subset matching queries, Landau, G. M., Tsur, D. & Weimann, O., 2007, String Processing and Information Retrieval - 14th International Symposium, SPIRE 2007, Proceedings. Springer Verlag, p. 195-20410 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4726 LNCS).
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface, Agarwal, P. K., Akutsu, T., Amihood, A., Apostolico, A., Benham, C., Benson, G., Blanchette, M., El-Mabrouk, N., Gascuel, O., Giancarlo, R., Guigo, R., Hallet, M., Huson, D., Kucherov, G., Lacey, M., Lagergren, J., Lancia, G., Landau, G. M., Lecroq, T. & Moret, B. & 22 others, Morishita, S., Mossel, E., Moulton, V., Pachter, L., Reinert, K., Rigoutsos, I., Sagot, M. F., Sankoff, D., Schbath, S., Segal, E., Semple, C., Setubal, J. C., Sharan, R., Skiena, S., Stoye, J., Ukkonen, E., Vawter, L., Valencia, A., Warnow, T., Wang, L., Casadio, R. & Myers, G., 2005, In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).3692 LNBI, p. V-VI
Two algorithms for LCS consecutive suffix alignment, Landau, G. M., Myers, E. & Ziv-Ukelson, M., 2004, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Sahinalp, S. C., Muthukrishnan, S. & Dogrusoz, U. (eds.). Springer Verlag, p. 173-19321 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3109).
Permuted and scaled string matching, Butman, A., Eres, R. & Landau, G. M., 2004, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Apostolico, A., Apostolico, A. & Melucci, M. (eds.). Springer Verlag, p. 72-732 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3246).
Sparse LCS Common Substring Alignment, Landau, G. M., Schieber, B. & Ziv-Ukelson, M., 31 Dec 2003, In: Information Processing Letters.88, 6, p. 259-27012 p.
Dynamic text and static pattern matching, Amir, A., Landau, G. M., Lewenstein, M. & Sokol, D., 2003, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Dehne, F., Sack, J.-R. & Smid, M. (eds.). Springer Verlag, p. 340-35213 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2748).
Pattern Matching with Swaps, Amir, A., Aumann, Y., Landau, G. M., Lewenstein, M. & Lewenstein, N., Nov 2000, In: Journal of Algorithms.37, 2, p. 247-26620 p.
Efficient special cases of pattern matching with swaps, Amir, A., Landau, G. M., Lewenstein, M. & Lewenstein, N., 1998, Combinatorial Pattern Matching - 9th Annual Symposium, CPM 1998, Proceedings. Springer Verlag, p. 209-22012 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1448 LNCS).
Approximate String Searching, Landau, G. M. & Vishkin, U., 1997, Pattern Matching Algorithms. Apostolico, A. & Galil, Z. (eds.). New York: Oxford University Press (OUP), p. 185-200
Parallel algorithms for contour extraction and coding, Dinstein, I. & Landau, G. M., 1990, Proceedings of SPIE - The International Society for Optical Engineering. Ghosh, J. & Harrison, G. C. (eds.). Publ by Int Soc for Optical Engineering, p. 156-1616 p. (Proceedings of SPIE - The International Society for Optical Engineering; vol. 1246).
Optimal parallel suffix-prefix matching algorithm and applications, Kedera, Z. M., Landau, G. M. & Palem, K. V., 1 Mar 1989, Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989. Leighton, F. T. (ed.). Association for Computing Machinery, Inc, p. 388-39811 p. (Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989).
The power of multimedia: Combining point-to-point and multiaccess networks, Afek, Y., Landau, G. M., Schieber, B. & Yung, M., 1 Jan 1988, Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing, PODC 1988. Association for Computing Machinery, p. 90-10415 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing; vol. Part F130192).
אתר זה עושה שימוש שימוש בקבצי עוגיות (COOKIES) וטכנולוגיות מעקב לצורך תפעולו התקין ואבטחתו וגם למטרות נוספות כמו שיפור חווית הגלישה, ניתוח נתונים סטטיסטיים פרסום מותאם אישית או מבוסס העדפות. אנו לא נתקין באמצעות האתר על מכשירך עוגיות וטכנולוגיות מעקב נוספות שאינן הכרחיים לתפעול הטכני של האתר ללא הסכמתך. למידע נוסף אנא עיין בחלק "נתונים שאינם מידע אישי אשר אנו אוספים באתר" במדיניות הפרטיות שלנו.
"This website uses cookies and tracking technologies for its proper functioning and security, as well as for additional purposes such as improving your browsing experience, statistical data analysis, and personalized or preference-based advertising. We will not install on your device any cookies or tracking technologies that are not strictly necessary for the technical operation of the site without your consent. For more information, please refer to the section “Non-Personal Data we Collect" in our privacy policy
