Dany Breslauer

43 papers A* 3A 4B 7C 2Journal 25Unranked 2
YearRankTypeTitle / Venue / Authors
2020 J jnl
Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts.
Algorithmica
Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura, Dany Breslauer, Diptarama Hendrian
2014 J jnl
Real-Time Streaming String-Matching.
ACM Trans. Algorithms
Dany Breslauer, Zvi Galil
2014 J jnl
Towards optimal packed string matching.
Theor. Comput. Sci.
Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann
2013 J jnl
Near real-time suffix tree construction via the fringe marked ancestor problem.
J. Discrete Algorithms
Dany Breslauer, Giuseppe F. Italiano
2013 J jnl
Simple real-time constant-space string matching.
Theor. Comput. Sci.
Dany Breslauer, Roberto Grossi, Filippo Mignosi
2012 B conf
Constant-Time Word-Size String Matching.
CPM
Dany Breslauer, Leszek Gasieniec, Roberto Grossi
2012 J jnl
On suffix extensions in suffix trees.
Theor. Comput. Sci.
Dany Breslauer, Giuseppe F. Italiano
2011 C conf
Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem.
SPIRE
Dany Breslauer, Giuseppe F. Italiano
2011 C conf
On Suffix Extensions in Suffix Trees.
SPIRE
Dany Breslauer, Giuseppe F. Italiano
2011 — conf
Optimal Packed String Matching.
FSTTCS
Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann
2011 B conf
Real-Time Streaming String-Matching.
CPM
Dany Breslauer, Zvi Galil
2011 B conf
Simple Real-Time Constant-Space String Matching.
CPM
Dany Breslauer, Roberto Grossi, Filippo Mignosi
1998 J jnl
On Competitive On-Line Paging with Lookahead.
Theor. Comput. Sci.
Dany Breslauer
1998 J jnl
On the Comparison Complexity of the String Prefix-Matching Problem.
J. Algorithms
Dany Breslauer, Livio Colussi, Laura Toniolo
1998 J jnl
The Suffix Tree of a Tree and Minimizing Sequential Transducers.
Theor. Comput. Sci.
Dany Breslauer
1997 — conf
Of Periods, Quasiperiods, Repetitions and Covers.
Structures in Logic and Computer Science
Alberto Apostolico, Dany Breslauer
1997 J jnl
Rotations of Periodic Strings and Short Superstrings.
J. Algorithms
Dany Breslauer, Tao Jiang, Zhigen Jiang
1997 J jnl
Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.
Inf. Process. Lett.
Dany Breslauer, Artur Czumaj, Devdatt P. Dubhashi, Friedhelm Meyer auf der Heide
1996 J jnl
An Optimal O(log log N)-Time Parallel Algorithm for Detecting All Squares in a String.
SIAM J. Comput.
Alberto Apostolico, Dany Breslauer
1996 J jnl
Efficient String Matching on Packed Texts.
RAIRO Theor. Informatics Appl.
Dany Breslauer, Leszek Gasieniec
1996 A conf
On Competitive On-Line Paging with Lookahead.
STACS
Dany Breslauer
1996 J jnl
Optimal Parallel Construction of Minimal Suffix and Factor Automata.
Parallel Process. Lett.
Dany Breslauer, Ramesh Hariharan
1996 J jnl
Saving Comparisons in the Crochemore-Perrin String-Matching Algorithm.
Theor. Comput. Sci.
Dany Breslauer
1996 B conf
The suffix Tree of a Tree and Minimizing Sequential Transducers.
CPM
Dany Breslauer
1995 J jnl
Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries.
J. Algorithms
Dany Breslauer
1995 B conf
Efficient String Matching on Coded Texts.
CPM
Dany Breslauer, Leszek Gasieniec
1995 J jnl
Fast Parallel String Prefix-Matching.
Theor. Comput. Sci.
Dany Breslauer
1995 J jnl
Finding All Periods and Initial Palindromes of a String in Parallel.
Algorithmica
Dany Breslauer, Zvi Galil
1995 J jnl
Parallel Detection of all Palindromes in a String.
Theor. Comput. Sci.
Alberto Apostolico, Dany Breslauer, Zvi Galil
1994 B conf
Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries.
CPM
Dany Breslauer
1994 A conf
On the Exact Complexity of the String Prefix-Matching Problem (Extended Abstract).
ESA
Dany Breslauer, Livio Colussi, Laura Toniolo
1994 A conf
Parallel Detection of all Palindromes in a String.
STACS
Alberto Apostolico, Dany Breslauer, Zvi Galil
1994 J jnl
Testing String Superprimitivity in Parallel.
Inf. Process. Lett.
Dany Breslauer
1993 J jnl
Efficient Comparison Based String Matching.
J. Complex.
Dany Breslauer, Zvi Galil
1993 A conf
Saving Comparisons in the Crochemore-Perrin String Matching Algorithm.
ESA
Dany Breslauer
1993 B conf
Tight Comparison Bounds for the String Prefix-Matching Problem.
CPM
Dany Breslauer, Livio Colussi, Laura Toniolo
1993 J jnl
Tight Comparison Bounds for the String Prefix-Matching Problem.
Inf. Process. Lett.
Dany Breslauer, Livio Colussi, Laura Toniolo
1992 J jnl
A Lower Bound for Parallel String Matching.
SIAM J. Comput.
Dany Breslauer, Zvi Galil
1992 J jnl
An On-Line String Superprimitivity Test.
Inf. Process. Lett.
Dany Breslauer
1992 A* conf
Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract).
ICALP
Alberto Apostolico, Dany Breslauer, Zvi Galil
1991 A* conf
A Lower Bound for Parallel String Matching
STOC
Dany Breslauer, Zvi Galil
1990 J jnl
An Optimal O(log log n) Time Parallel String Matching Algorithm.
SIAM J. Comput.
Dany Breslauer, Zvi Galil
1989 A* conf
Highly Parallelizable Problems (Extended Abstract)
STOC
Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin