Dany Breslauer

Available identifiers

zbMath Open breslauer.danyWikidataQ60589180 ScholiaQ60589180MaRDI QIDQ287047

List of research outcomes

Publication	Date of Publication	Type
Fully-online suffix tree and directed acyclic word graph construction for multiple texts	2020-04-01	Paper
Optimal parallel algorithms for periods, palindromes and squares	2019-12-04	Paper
Real-Time Streaming String-Matching	2018-10-30	Paper
On competitive on-line paging with lookahead	2017-11-16	Paper
Transforming comparison model lower bounds to the parallel-random-access-machine	2016-05-26	Paper
Towards optimal packed string matching	2014-03-13	Paper
Simple real-time constant-space string matching	2014-01-09	Paper
Near real-time suffix tree construction via the fringe marked ancestor problem	2013-06-24	Paper
On suffix extensions in suffix trees	2012-10-11	Paper
Optimal packed string matching	2012-08-31	Paper
Constant-Time Word-Size String Matching	2012-08-14	Paper
Simple Real-Time Constant-Space String Matching	2011-06-29	Paper
Real-Time Streaming String-Matching	2011-06-29	Paper
https://portal.mardi4nfdi.de/entity/Q4942631	2000-03-16	Paper
On the Comparison Complexity of the String Prefix-Matching Problem	1999-05-18	Paper
On competitive on-line paging with lookahead	1999-02-02	Paper
The suffix tree of a tree and minimizing sequential transducers	1998-08-13	Paper
Rotations of Periodic Strings and Short Superstrings	1997-10-20	Paper
Saving comparisons in the Crochemore-Perrin string-matching algorithm	1997-09-07	Paper
Efficient string matching on packed texts	1997-07-27	Paper
Parallel detection of all palindromes in a string	1997-02-28	Paper
Fast parallel string prefix-matching	1997-02-28	Paper
An Optimal $O(\log \log N)$-Time Parallel Algorithm for Detecting all Squares in a String	1997-02-24	Paper
Finding all periods and initial palindromes of a string in parallel	1996-03-11	Paper
Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries	1996-02-26	Paper
https://portal.mardi4nfdi.de/entity/Q4858435	1995-12-13	Paper
Tight comparison bounds for the string prefix-matching problem	1994-12-11	Paper
Testing string superprimitivity in parallel	1994-04-05	Paper
Efficient comparison based string matching	1994-01-23	Paper
An on-line string superprimitivity test	1993-05-16	Paper
A Lower Bound for Parallel String Matching	1992-12-06	Paper
An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm	1990-01-01	Paper

Research outcomes over time

This page was built for person: Dany Breslauer