( en | de | ru )

 

Disambiguation of "Breslauer, Dany"

Author of the publication

copydeleteadd this publication to your clipboard
Real-Time Streaming String-Matching.

, and . CPM, volume 6661 of Lecture Notes in Computer Science, page 162-172. Springer, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dany D'Souza

An fMRI study of chromatic processing in humans: spatial and temporal characteristics of the cortical visual areas. Uni Göttingen, (2009)

Theodor Breslauer

Willi Breslauer

Henri Breslauer

Walter Breslauer

 

Other publications of authors with the same name

Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem., and . SPIRE, volume 7024 of Lecture Notes in Computer Science, page 156-167. Springer, (2011)Real-Time Streaming String-Matching., and . CPM, volume 6661 of Lecture Notes in Computer Science, page 162-172. Springer, (2011)Saving Comparisons in the Crochemore-Perrin String Matching Algorithm.. ESA, volume 726 of Lecture Notes in Computer Science, page 61-72. Springer, (1993)Rotations of Periodic Strings and Short Superstrings., , and . J. Algorithms, 24 (2): 340-353 (1997)Highly Parallelizable Problems (Extended Abstract), , , , and . STOC, page 309-319. ACM, (1989)A Lower Bound for Parallel String Matching, and . STOC, page 439-443. ACM, (1991)Optimal Parallel Construction of Minimal Suffix and Factor Automata., and . Parallel Process. Lett., 6 (1): 35-44 (1996)On the Exact Complexity of the String Prefix-Matching Problem (Extended Abstract)., , and . ESA, volume 855 of Lecture Notes in Computer Science, page 483-494. Springer, (1994)Efficient String Matching on Packed Texts., and . RAIRO Theor. Informatics Appl., 30 (6): 521-544 (1996)Efficient Comparison Based String Matching., and . J. Complex., 9 (3): 339-365 (1993)