Searching for authors named Dany Breslauer – sorted by Relevance.
-
Efficient String Algorithmics
- Efficient String Algorithmics (Ph.D. Thesis) Dany Breslauer CUCS-024-92 Submitted in partial
- Cited by 8 (6 self) – Add To MetaCart
-
Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries
- Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries Dany Breslauer Istituto
- Cited by 2 (0 self) – Add To MetaCart
-
Fast Parallel String Prefix-Matching
- Fast Parallel String Prefix-Matching Dany Breslauer Columbia University CUCS-041-92 Abstract An O
- Cited by 5 (2 self) – Add To MetaCart
-
On Competitive On-Line Paging with Lookahead
- Breslauer BRICS Report Series RS-95-50 ISSN 0909-0878 September 1995 Copyright c fl 1995, BRICS, Department
- Cited by 22 (0 self) – Add To MetaCart
-
Saving Comparisons in the Crochemore-Perrin String Matching Algorithm
- Saving Comparisons in the Crochemore-Perrin String Matching Algorithm Dany Breslauer y April 3
- Cited by 7 (1 self) – Add To MetaCart
-
An On-Line String Superprimitivity Test
- An On-Line String Superprimitivity Test Dany Breslauer Columbia University CUCS-022-92 Abstract
- Cited by 14 (2 self) – Add To MetaCart
-
The Suffix Tree of a Tree and Minimizing Sequential Transducers
- Transducers Dany Breslauer BRICS Report Series RS-95-47 ISSN 0909-0878 September 1995 Copyright c fl 1995
- Cited by 18 (0 self) – Add To MetaCart
-
Testing String Superprimitivity in Parallel
- Testing String Superprimitivity in Parallel Dany Breslauer Columbia University CUCS-053
- Cited by 9 (1 self) – Add To MetaCart
-
A Lower Bound for Parallel String Matching
- A lower bound for parallel string matching Dany Breslauer INRIA and Columbia University April 26
- Cited by 22 (12 self) – Add To MetaCart
-
Saving Comparisons in the Crochemore-Perrin String Matching Algorithm
- Breslauer CWI CUCS-052-92 Abstract Crochemore and Perrin discovered an elegant linear-time constant
- Add To MetaCart

