- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j22 |      | Dany Breslauer, Giuseppe F. Italiano: Near real-time suffix tree construction via the fringe marked ancestor problem. J. Discrete Algorithms 18: 32-48 (2013) |
| j21 | | Dany Breslauer, Roberto Grossi, Filippo Mignosi: Simple real-time constant-space string matching. Theor. Comput. Sci. 483: 2-9 (2013) |
| 2012 | ||
| j20 | | Dany Breslauer, Giuseppe F. Italiano: On suffix extensions in suffix trees. Theor. Comput. Sci. 457: 27-34 (2012) |
| c18 | | Dany Breslauer, Leszek Gasieniec, Roberto Grossi: Constant-Time Word-Size String Matching. CPM 2012: 83-96 |
| 2011 | ||
| c17 | | |
| c16 | | Dany Breslauer, Roberto Grossi, Filippo Mignosi: Simple Real-Time Constant-Space String Matching. CPM 2011: 173-183 |
| c15 | | Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann: Optimal Packed String Matching. FSTTCS 2011: 423-432 |
| c14 | | Dany Breslauer, Giuseppe F. Italiano: Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem. SPIRE 2011: 156-167 |
| c13 | | |
| 1998 | ||
| j19 | | Dany Breslauer, Livio Colussi, Laura Toniolo: On the Comparison Complexity of the String Prefix-Matching Problem. J. Algorithms 29(1): 18-67 (1998) |
| j18 | | Dany Breslauer: The Suffix Tree of a Tree and Minimizing Sequential Transducers. Theor. Comput. Sci. 191(1-2): 131-144 (1998) |
| j17 | | Dany Breslauer: On Competitive On-Line Paging with Lookahead. Theor. Comput. Sci. 209(1-2): 365-375 (1998) |
| 1997 | ||
| j16 | | 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. 62(2): 103-110 (1997) |
| j15 | | Dany Breslauer, Tao Jiang, Zhigen Jiang: Rotations of Periodic Strings and Short Superstrings. J. Algorithms 24(2): 340-353 (1997) |
| c12 | | Alberto Apostolico, Dany Breslauer: Of Periods, Quasiperiods, Repetitions and Covers. Structures in Logic and Computer Science 1997: 236-248 |
| 1996 | ||
| j14 |  | Dany Breslauer, Leszek Gasieniec: Efficient String Matching on Packed Texts. ITA 30(6): 521-544 (1996) |
| j13 | | Dany Breslauer, Ramesh Hariharan: Optimal Parallel Construction of Minimal Suffix and Factor Automata. Parallel Processing Letters 6(1): 35-44 (1996) |
| j12 | | Alberto Apostolico, Dany Breslauer: An Optimal O(log log N)-Time Parallel Algorithm for Detecting All Squares in a String. SIAM J. Comput. 25(6): 1318-1331 (1996) |
| j11 | | Dany Breslauer: Saving Comparisons in the Crochemore-Perrin String-Matching Algorithm. Theor. Comput. Sci. 158(1&2): 177-192 (1996) |
| c11 | | |
| c10 | | |
| 1995 | ||
| j10 | | Dany Breslauer, Zvi Galil: Finding All Periods and Initial Palindromes of a String in Parallel. Algorithmica 14(4): 355-366 (1995) |
| j9 | | Dany Breslauer: Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries. J. Algorithms 18(2): 278-296 (1995) |
| j8 | | |
| j7 | | Alberto Apostolico, Dany Breslauer, Zvi Galil: Parallel Detection of all Palindromes in a String. Theor. Comput. Sci. 141(1&2): 163-173 (1995) |
| c9 | | |
| 1994 | ||
| j6 | | Dany Breslauer: Testing String Superprimitivity in Parallel. Inf. Process. Lett. 49(5): 235-241 (1994) |
| c8 | | Dany Breslauer: Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries. CPM 1994: 184-197 |
| c7 | | Dany Breslauer, Livio Colussi, Laura Toniolo: On the Exact Complexity of the String Prefix-Matching Problem (Extended Abstract). ESA 1994: 483-494 |
| c6 | | Alberto Apostolico, Dany Breslauer, Zvi Galil: Parallel Detection of all Palindromes in a String. STACS 1994: 497-506 |
| 1993 | ||
| j5 | | Dany Breslauer, Livio Colussi, Laura Toniolo: Tight Comparison Bounds for the String Prefix-Matching Problem. Inf. Process. Lett. 47(1): 51-57 (1993) |
| j4 | | Dany Breslauer, Zvi Galil: Efficient Comparison Based String Matching. J. Complexity 9(3): 339-365 (1993) |
| c5 | | Dany Breslauer, Livio Colussi, Laura Toniolo: Tight Comparison Bounds for the String Prefix-Matching Problem. CPM 1993: 11-19 |
| c4 | | Dany Breslauer: Saving Comparisons in the Crochemore-Perrin String Matching Algorithm. ESA 1993: 61-72 |
| 1992 | ||
| j3 | | |
| j2 | | Dany Breslauer, Zvi Galil: A Lower Bound for Parallel String Matching. SIAM J. Comput. 21(5): 856-862 (1992) |
| c3 | | Alberto Apostolico, Dany Breslauer, Zvi Galil: Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract). ICALP 1992: 296-307 |
| 1991 | ||
| c2 | | |
| 1990 | ||
| j1 | | Dany Breslauer, Zvi Galil: An Optimal O(log log n) Time Parallel String Matching Algorithm. SIAM J. Comput. 19(6): 1051-1058 (1990) |
| 1989 | ||
| c1 | | Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin: Highly Parallelizable Problems (Extended Abstract). STOC 1989: 309-319 |
Colors in the list of coauthors
Last update Sun May 26 01:46:32 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page