| 2012 | CPM | Constant-Time Word-Size String Matching. | Dany Breslauer, Leszek Gasieniec, Roberto Grossi |
| 2011 | CPM | Real-Time Streaming String-Matching. | Dany Breslauer, Zvi Galil |
| 2011 | CPM | Simple Real-Time Constant-Space String Matching. | Dany Breslauer, Roberto Grossi, Filippo Mignosi |
| 2011 | SPIRE | Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem. | Dany Breslauer, Giuseppe F. Italiano |
| 2011 | SPIRE | On Suffix Extensions in Suffix Trees. | Dany Breslauer, Giuseppe F. Italiano |
| 1996 | CPM | The suffix Tree of a Tree and Minimizing Sequential Transducers. | Dany Breslauer |
| 1996 | STACS | On Competitive On-Line Paging with Lookahead. | Dany Breslauer |
| 1995 | CPM | Efficient String Matching on Coded Texts. | Dany Breslauer, Leszek Gasieniec |
| 1994 | CPM | Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries. | Dany Breslauer |
| 1994 | ESA | On the Exact Complexity of the String Prefix-Matching Problem (Extended Abstract). | Dany Breslauer, Livio Colussi, Laura Toniolo |
| 1994 | STACS | Parallel Detection of all Palindromes in a String. | Alberto Apostolico, Dany Breslauer, Zvi Galil |
| 1993 | CPM | Tight Comparison Bounds for the String Prefix-Matching Problem. | Dany Breslauer, Livio Colussi, Laura Toniolo |
| 1993 | ESA | Saving Comparisons in the Crochemore-Perrin String Matching Algorithm. | Dany Breslauer |
| 1992 | ICALP | Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract). | Alberto Apostolico, Dany Breslauer, Zvi Galil |
| 1991 | STOC | A Lower Bound for Parallel String Matching | Dany Breslauer, Zvi Galil |
| 1989 | STOC | Highly Parallelizable Problems (Extended Abstract) | Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin |