Dany Breslauer - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 43 from 43

2020

Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple TextsTakuya Takagi, Shunsuke Inenaga, Hiroki Arimura, Dany Breslauer, Diptarama Hendrian. algorithmica, 82(5):1346-1377, 2020. [doi]

2014

Towards optimal packed string matchingOren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann. TCS, 525:111-129, 2014. [doi]

Real-Time Streaming String-MatchingDany Breslauer, Zvi Galil. TALG, 10(4):22, 2014. [doi]

2013

Near real-time suffix tree construction via the fringe marked ancestor problemDany Breslauer, Giuseppe F. Italiano. jda, 18:32-48, 2013. [doi]

Simple real-time constant-space string matchingDany Breslauer, Roberto Grossi, Filippo Mignosi. TCS, 483:2-9, 2013. [doi]

2012

Constant-Time Word-Size String MatchingDany Breslauer, Leszek Gasieniec, Roberto Grossi. cpm 2012: 83-96 [doi]

On suffix extensions in suffix treesDany Breslauer, Giuseppe F. Italiano. TCS, 457:27-34, 2012. [doi]

2011

1998

The Suffix Tree of a Tree and Minimizing Sequential TransducersDany Breslauer. TCS, 191(1-2):131-144, 1998. [doi]

On the Comparison Complexity of the String Prefix-Matching ProblemDany Breslauer, Livio Colussi, Laura Toniolo. jal, 29(1):18-67, 1998.

On Competitive On-Line Paging with LookaheadDany Breslauer. TCS, 209(1-2):365-375, 1998. [doi]

1997

Of Periods, Quasiperiods, Repetitions and CoversAlberto Apostolico, Dany Breslauer. BIRTHDAY 1997: 236-248

Rotations of Periodic Strings and Short SuperstringsDany Breslauer, Tao Jiang, Zhigen Jiang. jal, 24(2):340-353, 1997.

Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-MachineDany Breslauer, Artur Czumaj, Devdatt P. Dubhashi, Friedhelm Meyer auf der Heide. ipl, 62(2):103-110, 1997. [doi]

1996

1995

Parallel Detection of all Palindromes in a StringAlberto Apostolico, Dany Breslauer, Zvi Galil. TCS, 141(1&2):163-173, 1995. [doi]

Fast Parallel String Prefix-MatchingDany Breslauer. TCS, 137(2):269-278, 1995. [doi]

Dictionary-Matching on Unbounded Alphabets: Uniform Length DictionariesDany Breslauer. jal, 18(2):278-296, 1995.

Finding All Periods and Initial Palindromes of a String in ParallelDany Breslauer, Zvi Galil. algorithmica, 14(4):355-366, 1995.

Efficient String Matching on Coded TextsDany Breslauer, Leszek Gasieniec. cpm 1995: 27-40

1994

Parallel Detection of all Palindromes in a StringAlberto Apostolico, Dany Breslauer, Zvi Galil. STACS 1994: 497-506

Dictionary-Matching on Unbounded Alphabets: Uniform Length DictionariesDany Breslauer. cpm 1994: 184-197

On the Exact Complexity of the String Prefix-Matching Problem (Extended Abstract)Dany Breslauer, Livio Colussi, Laura Toniolo. esa 1994: 483-494

Testing String Superprimitivity in ParallelDany Breslauer. ipl, 49(5):235-241, 1994.

1993

Efficient Comparison Based String MatchingDany Breslauer, Zvi Galil. jc, 9(3):339-365, 1993. [doi]

Tight Comparison Bounds for the String Prefix-Matching ProblemDany Breslauer, Livio Colussi, Laura Toniolo. cpm 1993: 11-19

Tight Comparison Bounds for the String Prefix-Matching ProblemDany Breslauer, Livio Colussi, Laura Toniolo. ipl, 47(1):51-57, 1993.

Saving Comparisons in the Crochemore-Perrin String Matching AlgorithmDany Breslauer. esa 1993: 61-72

1992

Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract)Alberto Apostolico, Dany Breslauer, Zvi Galil. icalp 1992: 296-307

A Lower Bound for Parallel String MatchingDany Breslauer, Zvi Galil. SICOMP, 21(5):856-862, 1992.

An On-Line String Superprimitivity TestDany Breslauer. ipl, 44(6):345-347, 1992.

1991

A Lower Bound for Parallel String MatchingDany Breslauer, Zvi Galil. stoc 1991: 439-443

1990

An Optimal O(log log n) Time Parallel String Matching AlgorithmDany Breslauer, Zvi Galil. SICOMP, 19(6):1051-1058, 1990.

1989

Highly Parallelizable Problems (Extended Abstract)Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin. stoc 1989: 309-319

Sign in or sign up to see more results.

runs on WebDSL