The following pages link to Dany Breslauer (Q287047):
Displaying 33 items.
- Transforming comparison model lower bounds to the parallel-random-access-machine (Q287050) (← links)
- Simple real-time constant-space string matching (Q390869) (← links)
- Parallel detection of all palindromes in a string (Q673783) (← links)
- Fast parallel string prefix-matching (Q674342) (← links)
- Tight comparison bounds for the string prefix-matching problem (Q685487) (← links)
- On suffix extensions in suffix trees (Q714837) (← links)
- The suffix tree of a tree and minimizing sequential transducers (Q1127317) (← links)
- An on-line string superprimitivity test (Q1209376) (← links)
- On competitive on-line paging with lookahead (Q1276313) (← links)
- Efficient comparison based string matching (Q1311385) (← links)
- Testing string superprimitivity in parallel (Q1318749) (← links)
- Saving comparisons in the Crochemore-Perrin string-matching algorithm (Q1365685) (← links)
- (Q1899223) (redirect page) (← links)
- Finding all periods and initial palindromes of a string in parallel (Q1899224) (← links)
- Fully-online suffix tree and directed acyclic word graph construction for multiple texts (Q2309475) (← links)
- Near real-time suffix tree construction via the fringe marked ancestor problem (Q2376800) (← links)
- Towards optimal packed string matching (Q2437754) (← links)
- Constant-Time Word-Size String Matching (Q2904481) (← links)
- Optimal Packed String Matching (Q2911643) (← links)
- Real-Time Streaming String-Matching (Q3011851) (← links)
- Simple Real-Time Constant-Space String Matching (Q3011852) (← links)
- An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm (Q3495651) (← links)
- A Lower Bound for Parallel String Matching (Q4015971) (← links)
- On the Comparison Complexity of the String Prefix-Matching Problem (Q4217300) (← links)
- Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries (Q4327823) (← links)
- Efficient string matching on packed texts (Q4341037) (← links)
- Rotations of Periodic Strings and Short Superstrings (Q4360136) (← links)
- On competitive on-line paging with lookahead (Q4593963) (← links)
- (Q4858435) (← links)
- (Q4942631) (← links)
- Real-Time Streaming String-Matching (Q4962156) (← links)
- Optimal parallel algorithms for periods, palindromes and squares (Q5204325) (← links)
- An Optimal $O(\log \log N)$-Time Parallel Algorithm for Detecting all Squares in a String (Q5691298) (← links)
