Highly Parallelizable Problems (Extended Abstract) - Omer Berkman; Dany Breslauer; Zvi Galil; Baruch Schieber; Uzi Vishkin (STOC, 1989)

An Optimal O(log log n) Time Parallel String Matching Algorithm. - Dany Breslauer; Zvi Galil (SIAM J. Comput., 1990)

Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract). - Alberto Apostolico; Dany Breslauer; Zvi Galil (ICALP, 1992)

An On-Line String Superprimitivity Test. - Dany Breslauer (Inf. Process. Lett., 1992)

A Lower Bound for Parallel String Matching. - Dany Breslauer; Zvi Galil (SIAM J. Comput., 1992)

Tight Comparison Bounds for the String Prefix-Matching Problem. - Dany Breslauer; Livio Colussi; Laura Toniolo (Inf. Process. Lett., 1993)

Efficient Comparison Based String Matching. - Dany Breslauer; Zvi Galil (J. Complex., 1993)

On the Exact Complexity of the String Prefix-Matching Problem (Extended Abstract). - Dany Breslauer; Livio Colussi; Laura Toniolo (ESA, 1994)

Testing String Superprimitivity in Parallel. - Dany Breslauer (Inf. Process. Lett., 1994)

Efficient String Matching on Coded Texts. - Dany Breslauer; Leszek Gasieniec (CPM, 1995)

Finding All Periods and Initial Palindromes of a String in Parallel. - Dany Breslauer; Zvi Galil (Algorithmica, 1995)

Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries. - Dany Breslauer (J. Algorithms, 1995)

Parallel Detection of all Palindromes in a String. - Alberto Apostolico; Dany Breslauer; Zvi Galil (Theor. Comput. Sci., 1995)

Fast Parallel String Prefix-Matching. - Dany Breslauer (Theor. Comput. Sci., 1995)

Efficient String Matching on Packed Texts. - Dany Breslauer; Leszek Gasieniec (RAIRO Theor. Informatics Appl., 1996)

Optimal Parallel Construction of Minimal Suffix and Factor Automata. - Dany Breslauer; Ramesh Hariharan (Parallel Process. Lett., 1996)

An Optimal O(log log N)-Time Parallel Algorithm for Detecting All Squares in a String. - Alberto Apostolico; Dany Breslauer (SIAM J. Comput., 1996)

Saving Comparisons in the Crochemore-Perrin String-Matching Algorithm. - Dany Breslauer (Theor. Comput. Sci., 1996)

Of Periods, Quasiperiods, Repetitions and Covers. - Alberto Apostolico; Dany Breslauer (Structures in Logic and Computer Science, 1997)

Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine. - Dany Breslauer; Artur Czumaj; Devdatt P. Dubhashi; Friedhelm Meyer auf der Heide (Inf. Process. Lett., 1997)

Rotations of Periodic Strings and Short Superstrings. - Dany Breslauer; Tao Jiang 001; Zhigen Jiang (J. Algorithms, 1997)

On the Comparison Complexity of the String Prefix-Matching Problem. - Dany Breslauer; Livio Colussi; Laura Toniolo (J. Algorithms, 1998)

The Suffix Tree of a Tree and Minimizing Sequential Transducers. - Dany Breslauer (Theor. Comput. Sci., 1998)

On Competitive On-Line Paging with Lookahead. - Dany Breslauer (Theor. Comput. Sci., 1998)

Optimal Packed String Matching. - Oren Ben-Kiki; Philip Bille; Dany Breslauer; Leszek Gasieniec; Roberto Grossi; Oren Weimann (FSTTCS, 2011)

Constant-Time Word-Size String Matching. - Dany Breslauer; Leszek Gasieniec; Roberto Grossi (CPM, 2012)

On suffix extensions in suffix trees. - Dany Breslauer; Giuseppe F. Italiano (Theor. Comput. Sci., 2012)

Near real-time suffix tree construction via the fringe marked ancestor problem. - Dany Breslauer; Giuseppe F. Italiano (J. Discrete Algorithms, 2013)

Simple real-time constant-space string matching. - Dany Breslauer; Roberto Grossi; Filippo Mignosi (Theor. Comput. Sci., 2013)

Real-Time Streaming String-Matching. - Dany Breslauer; Zvi Galil (ACM Trans. Algorithms, 2014)

Towards optimal packed string matching. - Oren Ben-Kiki; Philip Bille; Dany Breslauer; Leszek Gasieniec; Roberto Grossi; Oren Weimann (Theor. Comput. Sci., 2014)

Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts. - Takuya Takagi; Shunsuke Inenaga; Hiroki Arimura; Dany Breslauer; Diptarama Hendrian (Algorithmica, 2020)