Dany Breslauer
Dany Breslauer
Affiliazione sconosciuta
Email verificata su cs.columbia.edu
TitoloCitata daAnno
Highly parallelizable problems
O Berkman, D Breslauer, Z Galil, B Schieber, U Vishkin
Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989
1491989
An on-line string superprimitivity test
D Breslauer
Information Processing Letters 44 (6), 345-347, 1992
1001992
An optimal O(\log\logn) time parallel string matching algorithm
D Breslauer, Z Galil
SIAM Journal on Computing 19 (6), 1051-1058, 1990
881990
Rotations of periodic strings and short superstrings
D Breslauer, T Jiang, Z Jiang
Journal of Algorithms 24 (2), 340-353, 1997
761997
A lower bound for parallel string matching
D Breslauer, Z Galil
SIAM Journal on Computing 21 (5), 856-862, 1992
541992
Finding all periods and initial palindromes of a string in parallel
D Breslauer, Z Galil
Algorithmica 14 (4), 355-366, 1995
531995
Finding all periods and initial palindromes of a string in parallel
D Breslauer, Z Galil
Algorithmica 14 (4), 355-366, 1995
511995
Optimal parallel algorithms for periods, palindromes and squares
A Apostolico, D Breslauer, Z Galil
International Colloquium on Automata, Languages, and Programming, 296-307, 1992
501992
Parallel detection of all palindromes in a string
A Apostolico, D Breslauer, Z Galil
Theoretical Computer Science 141 (1-2), 163-173, 1995
491995
An Optimal O(\log\logN)-Time Parallel Algorithm for Detecting all Squares in a String
A Apostolico, D Breslauer
SIAM Journal on Computing 25 (6), 1318-1331, 1996
441996
The suffix tree of a tree and minimizing sequential transducers
D Breslauer
Theoretical Computer Science 191 (1-2), 131-144, 1998
381998
Testing string superprimitivity in parallel
D Breslauer
Information Processing Letters 49 (5), 235-241, 1994
381994
On competitive on-line paging with lookahead
D Breslauer
Annual Symposium on Theoretical Aspects of Computer Science, 593-603, 1996
291996
Efficient String Algorithmics
D Breslauer
COLUMBIA UNIVERSITY, 1992
271992
Near real-time suffix tree construction via the fringe marked ancestor problem
D Breslauer, GF Italiano
Journal of Discrete Algorithms 18, 32-48, 2013
262013
On competitive on-line paging with lookahead
D Breslauer
Theoretical Computer Science 209 (1-2), 365-375, 1998
261998
Saving comparisons in the Crochemore-Perrin string-matching algorithm
D Breslauer
Theoretical Computer Science 158 (1-2), 177-192, 1996
261996
Tight comparison bounds for the string prefix-matching problem
D Breslauer, L Colussi, L Toniolo
Information Processing Letters 47 (1), 51-57, 1993
261993
Real-time streaming string-matching
D Breslauer, Z Galil
Annual Symposium on Combinatorial Pattern Matching, 162-172, 2011
242011
Of periods, quasiperiods, repetitions and covers
A Apostolico, D Breslauer
Structures in Logic and Computer Science, 236-248, 1997
241997
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20