Dany Breslauer

According to our database, Dany Breslauer authored at least 32 papers between 1989 and 2020.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2020

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

2014

Towards optimal packed string matching.

Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann

Theor. Comput. Sci., 2014

2012

Constant-Time Word-Size String Matching.

Dany Breslauer, Leszek Gasieniec, Roberto Grossi

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011

On Suffix Extensions in Suffix Trees.

Dany Breslauer, Giuseppe F. Italiano

Proceedings of the String Processing and Information Retrieval, 2011

Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem.

Dany Breslauer, Giuseppe F. Italiano

Proceedings of the String Processing and Information Retrieval, 2011

Optimal Packed String Matching.

Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Simple Real-Time Constant-Space String Matching.

Dany Breslauer, Roberto Grossi, Filippo Mignosi

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

Real-Time Streaming String-Matching.

Dany Breslauer, Zvi Galil

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

1998

On the Comparison Complexity of the String Prefix-Matching Problem.

Dany Breslauer, Livio Colussi, Laura Toniolo

J. Algorithms, 1998

1997

Rotations of Periodic Strings and Short Superstrings.

Dany Breslauer, Tao Jiang, Zhigen Jiang

J. Algorithms, 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

Of Periods, Quasiperiods, Repetitions and Covers.

Alberto Apostolico, Dany Breslauer

Proceedings of the Structures in Logic and Computer Science, 1997

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

Optimal Parallel Construction of Minimal Suffix and Factor Automata.

Dany Breslauer, Ramesh Hariharan

Parallel Process. Lett., 1996

Efficient String Matching on Packed Texts.

Dany Breslauer, Leszek Gasieniec

RAIRO Theor. Informatics Appl., 1996

On Competitive On-Line Paging with Lookahead.

Dany Breslauer

Proceedings of the STACS 96, 1996

The suffix Tree of a Tree and Minimizing Sequential Transducers.

Dany Breslauer

Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

1995

Fast Parallel String Prefix-Matching.

Dany Breslauer

Theor. Comput. Sci., 1995

Finding All Periods and Initial Palindromes of a String in Parallel.

Dany Breslauer, Zvi Galil

Algorithmica, 1995

Efficient String Matching on Coded Texts.

Dany Breslauer, Leszek Gasieniec

Proceedings of the Combinatorial Pattern Matching, 6th Annual Symposium, 1995

1994

Testing String Superprimitivity in Parallel.

Dany Breslauer

Inf. Process. Lett., 1994

Parallel Detection of all Palindromes in a String.

Alberto Apostolico, Dany Breslauer, Zvi Galil

Proceedings of the STACS 94, 1994

On the Exact Complexity of the String Prefix-Matching Problem (Extended Abstract).

Dany Breslauer, Livio Colussi, Laura Toniolo

Proceedings of the Algorithms, 1994

Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries.

Dany Breslauer

Proceedings of the Combinatorial Pattern Matching, 5th Annual Symposium, 1994

1993

Efficient Comparison Based String Matching.

Dany Breslauer, Zvi Galil

J. Complex., 1993

Saving Comparisons in the Crochemore-Perrin String Matching Algorithm.

Dany Breslauer

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

Tight Comparison Bounds for the String Prefix-Matching Problem.

Dany Breslauer, Livio Colussi, Laura Toniolo

Proceedings of the Combinatorial Pattern Matching, 4th Annual Symposium, 1993

1992

An On-Line String Superprimitivity Test.

Dany Breslauer

Inf. Process. Lett., 1992

Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract).

Alberto Apostolico, Dany Breslauer, Zvi Galil

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1991

A Lower Bound for Parallel String Matching

Dany Breslauer, Zvi Galil

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

1990

An Optimal O(log log n) Time Parallel String Matching Algorithm.

Dany Breslauer, Zvi Galil

SIAM J. Comput., 1990

1989

Highly Parallelizable Problems (Extended Abstract)

Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989