Dany Breslauer

From MaRDI portal
Person:287047

Available identifiers

zbMath Open breslauer.danyWikidataQ60589180 ScholiaQ60589180MaRDI QIDQ287047

List of research outcomes





PublicationDate of PublicationType
Fully-online suffix tree and directed acyclic word graph construction for multiple texts2020-04-01Paper
Optimal parallel algorithms for periods, palindromes and squares2019-12-04Paper
Real-Time Streaming String-Matching2018-10-30Paper
On competitive on-line paging with lookahead2017-11-16Paper
Transforming comparison model lower bounds to the parallel-random-access-machine2016-05-26Paper
Towards optimal packed string matching2014-03-13Paper
Simple real-time constant-space string matching2014-01-09Paper
Near real-time suffix tree construction via the fringe marked ancestor problem2013-06-24Paper
On suffix extensions in suffix trees2012-10-11Paper
Optimal packed string matching2012-08-31Paper
Constant-Time Word-Size String Matching2012-08-14Paper
Simple Real-Time Constant-Space String Matching2011-06-29Paper
Real-Time Streaming String-Matching2011-06-29Paper
https://portal.mardi4nfdi.de/entity/Q49426312000-03-16Paper
On the Comparison Complexity of the String Prefix-Matching Problem1999-05-18Paper
On competitive on-line paging with lookahead1999-02-02Paper
The suffix tree of a tree and minimizing sequential transducers1998-08-13Paper
Rotations of Periodic Strings and Short Superstrings1997-10-20Paper
Saving comparisons in the Crochemore-Perrin string-matching algorithm1997-09-07Paper
Efficient string matching on packed texts1997-07-27Paper
Parallel detection of all palindromes in a string1997-02-28Paper
Fast parallel string prefix-matching1997-02-28Paper
An Optimal $O(\log \log N)$-Time Parallel Algorithm for Detecting all Squares in a String1997-02-24Paper
Finding all periods and initial palindromes of a string in parallel1996-03-11Paper
Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries1996-02-26Paper
https://portal.mardi4nfdi.de/entity/Q48584351995-12-13Paper
Tight comparison bounds for the string prefix-matching problem1994-12-11Paper
Testing string superprimitivity in parallel1994-04-05Paper
Efficient comparison based string matching1994-01-23Paper
An on-line string superprimitivity test1993-05-16Paper
A Lower Bound for Parallel String Matching1992-12-06Paper
An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm1990-01-01Paper

Research outcomes over time

This page was built for person: Dany Breslauer