| An O(log3/2 n) Parallel Time Population Protocol for Majority with O(log n) States S Ben-Nun, T Kopelowitz, M Kraus, E Porat Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020 | 28 | 2020 |
| Time-space tradeoffs for finding a long common substring S Ben-Nun, S Golan, T Kociumaka, M Kraus arXiv preprint arXiv:2003.02016, 2020 | 11 | 2020 |
| Hamming Distance Oracle I Boneh, D Fried, S Golan, M Kraus arXiv preprint arXiv:2407.05430, 2024 | | 2024 |
| Hairpin completion distance lower bound I Boneh, D Fried, S Golan, M Kraus arXiv preprint arXiv:2404.11673, 2024 | | 2024 |
| Generating low-density minimizers S Golan, I Tziony, M Kraus, Y Orenstein, A Shur bioRxiv, 2024.10. 28.620726, 2024 | | 2024 |
| Searching 2d-strings for matching frames I Boneh, D Fried, S Golan, M Kraus, A Miclaus, A Shur arXiv preprint arXiv:2310.02670, 2023 | | 2023 |
| String Factorization via Prefix Free Families M Kraus, M Lewenstein, A Popa, E Porat, Y Sadia 34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023), 2023 | | 2023 |
| 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020) T Husfeldt, M Alzamel, A Conte, S Denzumi, R Grossi, CS Iliopoulos, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020 | | 2020 |
