| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Dany Breslauer, Zvi Galil |
Real-Time Streaming String-Matching.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer, Roberto Grossi, Filippo Mignosi |
Simple Real-Time Constant-Space String Matching. |
CPM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer, Giuseppe F. Italiano |
On Suffix Extensions in Suffix Trees. |
SPIRE |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer, Giuseppe F. Italiano |
Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem. |
SPIRE |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann |
Optimal Packed String Matching. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer |
The Suffix Tree of a Tree and Minimizing Sequential Transducers. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer |
On Competitive On-Line Paging with Lookahead. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer, Livio Colussi, Laura Toniolo |
On the Comparison Complexity of the String Prefix-Matching Problem. |
J. Algorithms |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer, Artur Czumaj, Devdatt P. Dubhashi, Friedhelm Meyer auf der Heide |
Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine. |
Inf. Process. Lett. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer, Tao Jiang, Zhigen Jiang |
Rotations of Periodic Strings and Short Superstrings. |
J. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Apostolico, Dany Breslauer |
Of Periods, Quasiperiods, Repetitions and Covers. |
Structures in Logic and Computer Science |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer |
Saving Comparisons in the Crochemore-Perrin String-Matching Algorithm. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer, Leszek Gasieniec |
Efficient String Matching on Packed Texts. |
ITA |
1996 |
DBLP BibTeX RDF |
|
| 1 | Dany Breslauer, Ramesh Hariharan |
Optimal Parallel Construction of Minimal Suffix and Factor Automata. |
Parallel Processing Letters |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Apostolico, Dany Breslauer |
An Optimal O(log log N)-Time Parallel Algorithm for Detecting All Squares in a String. |
SIAM J. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer |
On Competitive On-Line Paging with Lookahead. |
STACS |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer |
The suffix Tree of a Tree and Minimizing Sequential Transducers. |
CPM |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer |
Fast Parallel String Prefix-Matching. |
Theor. Comput. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Apostolico, Dany Breslauer, Zvi Galil |
Parallel Detection of all Palindromes in a String. |
Theor. Comput. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer, Zvi Galil |
Finding All Periods and Initial Palindromes of a String in Parallel. |
Algorithmica |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer |
Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries. |
J. Algorithms |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer, Leszek Gasieniec |
Efficient String Matching on Coded Texts. |
CPM |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer |
Testing String Superprimitivity in Parallel. |
Inf. Process. Lett. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer, Livio Colussi, Laura Toniolo |
On the Exact Complexity of the String Prefix-Matching Problem (Extended Abstract). |
ESA |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Apostolico, Dany Breslauer, Zvi Galil |
Parallel Detection of all Palindromes in a String. |
STACS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer |
Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries. |
CPM |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer, Livio Colussi, Laura Toniolo |
Tight Comparison Bounds for the String Prefix-Matching Problem. |
Inf. Process. Lett. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer, Zvi Galil |
Efficient Comparison Based String Matching. |
J. Complexity |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer |
Saving Comparisons in the Crochemore-Perrin String Matching Algorithm. |
ESA |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer, Livio Colussi, Laura Toniolo |
Tight Comparison Bounds for the String Prefix-Matching Problem. |
CPM |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer |
An On-Line String Superprimitivity Test. |
Inf. Process. Lett. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer, Zvi Galil |
A Lower Bound for Parallel String Matching. |
SIAM J. Comput. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Apostolico, Dany Breslauer, Zvi Galil |
Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract). |
ICALP |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer, Zvi Galil |
A Lower Bound for Parallel String Matching |
STOC |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer, Zvi Galil |
An Optimal O(log log n) Time Parallel String Matching Algorithm. |
SIAM J. Comput. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin |
Highly Parallelizable Problems (Extended Abstract) |
STOC |
1989 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")