| Highly parallelizable problems O Berkman, D Breslauer, Z Galil, B Schieber, U Vishkin Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989 | 151 | 1989 |
| An on-line string superprimitivity test D Breslauer Information Processing Letters 44 (6), 345-347, 1992 | 113 | 1992 |
| An optimal O(\log\logn) time parallel string matching algorithm D Breslauer, Z Galil SIAM Journal on Computing 19 (6), 1051-1058, 1990 | 95 | 1990 |
| Rotations of periodic strings and short superstrings D Breslauer, T Jiang, Z Jiang Journal of Algorithms 24 (2), 340-353, 1997 | 79 | 1997 |
| A lower bound for parallel string matching D Breslauer, Z Galil Proceedings of the twenty-third annual ACM symposium on Theory of Computing …, 1991 | 63 | 1991 |
| Finding all periods and initial palindromes of a string in parallel D Breslauer, Z Galil Algorithmica 14 (4), 355-366, 1995 | 57 | 1995 |
| Finding all periods and initial palindromes of a string in parallel D Breslauer, Z Galil Algorithmica 14 (4), 355-366, 1995 | 55 | 1995 |
| Parallel detection of all palindromes in a string A Apostolico, D Breslauer, Z Galil Theoretical Computer Science 141 (1-2), 163-173, 1995 | 54 | 1995 |
| Optimal parallel algorithms for periods, palindromes and squares A Apostolico, D Breslauer, Z Galil International Colloquium on Automata, Languages, and Programming, 296-307, 1992 | 51 | 1992 |
| An Optimal O(\log\logN)-Time Parallel Algorithm for Detecting all Squares in a String A Apostolico, D Breslauer SIAM Journal on Computing 25 (6), 1318-1331, 1996 | 44 | 1996 |
| The suffix tree of a tree and minimizing sequential transducers D Breslauer Theoretical Computer Science 191 (1-2), 131-144, 1998 | 42 | 1998 |
| Testing string superprimitivity in parallel D Breslauer Information Processing Letters 49 (5), 235-241, 1994 | 41 | 1994 |
| Near real-time suffix tree construction via the fringe marked ancestor problem D Breslauer, GF Italiano Journal of Discrete Algorithms 18, 32-48, 2013 | 32 | 2013 |
| Saving comparisons in the Crochemore-Perrin string-matching algorithm D Breslauer Theoretical computer science 158 (1-2), 177-192, 1996 | 30 | 1996 |
| On competitive on-line paging with lookahead D Breslauer Annual Symposium on Theoretical Aspects of Computer Science, 593-603, 1996 | 30 | 1996 |
| Real-time streaming string-matching D Breslauer, Z Galil ACM Transactions on Algorithms (TALG) 10 (4), 22, 2014 | 29 | 2014 |
| Efficient String Algorithmics D Breslauer COLUMBIA UNIVERSITY, 1992 | 29 | 1992 |
| Tight comparison bounds for the string prefix-matching problem D Breslauer, L Colussi, L Toniolo Information Processing Letters 47 (1), 51-57, 1993 | 28 | 1993 |
| On competitive on-line paging with lookahead D Breslauer Theoretical Computer Science 209 (1-2), 365-375, 1998 | 27 | 1998 |
| Of periods, quasiperiods, repetitions and covers A Apostolico, D Breslauer Structures in Logic and Computer Science, 236-248, 1997 | 27 | 1997 |
Roberto GrossiProfessor of Computer Science, University of Pisa, ItalyEmail verificata su di.unipi.it
