dblp.uni-trier.dewww.uni-trier.de

Dany Breslauer Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*1998
31 Dany Breslauer, Livio Colussi, Laura Toniolo: On the Comparison Complexity of the String Prefix-Matching Problem. J. Algorithms 29(1): 18-67 (1998)
30EEDany Breslauer: The Suffix Tree of a Tree and Minimizing Sequential Transducers. Theor. Comput. Sci. 191(1-2): 131-144 (1998)
29EEDany Breslauer: On Competitive On-Line Paging with Lookahead. Theor. Comput. Sci. 209(1-2): 365-375 (1998)
1997
28 Alberto Apostolico, Dany Breslauer: Of Periods, Quasiperiods, Repetitions and Covers. Structures in Logic and Computer Science 1997: 236-248
27EEDany 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)
26 Dany Breslauer, Tao Jiang, Zhigen Jiang: Rotations of Periodic Strings and Short Superstrings. J. Algorithms 24(2): 340-353 (1997)
1996
25 Dany Breslauer: The suffix Tree of a Tree and Minimizing Sequential Transducers. CPM 1996: 116-129
24EEDany Breslauer: On Competitive On-Line Paging with Lookahead. STACS 1996: 593-603
23 Dany Breslauer, Leszek Gasieniec: Efficient String Matching on Packed Texts. ITA 30(6): 521-544 (1996)
22EEDany Breslauer, Ramesh Hariharan: Optimal Parallel Construction of Minimal Suffix and Factor Automata. Parallel Processing Letters 6(1): 35-44 (1996)
21 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)
20EEDany Breslauer: Saving Comparisons in the Crochemore-Perrin String-Matching Algorithm. Theor. Comput. Sci. 158(1&2): 177-192 (1996)
1995
19 Dany Breslauer, Leszek Gasieniec: Efficient String Matching on Coded Texts. CPM 1995: 27-40
18 Dany Breslauer, Zvi Galil: Finding All Periods and Initial Palindromes of a String in Parallel. Algorithmica 14(4): 355-366 (1995)
17 Dany Breslauer: Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries. J. Algorithms 18(2): 278-296 (1995)
16EEDany Breslauer: Fast Parallel String Prefix-Matching. Theor. Comput. Sci. 137(2): 269-278 (1995)
15EEAlberto Apostolico, Dany Breslauer, Zvi Galil: Parallel Detection of all Palindromes in a String. Theor. Comput. Sci. 141(1&2): 163-173 (1995)
1994
14 Dany Breslauer: Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries. CPM 1994: 184-197
13EEDany Breslauer, Livio Colussi, Laura Toniolo: On the Exact Complexity of the String Prefix-Matching Problem (Extended Abstract). ESA 1994: 483-494
12EEAlberto Apostolico, Dany Breslauer, Zvi Galil: Parallel Detection of all Palindromes in a String. STACS 1994: 497-506
11 Dany Breslauer: Testing String Superprimitivity in Parallel. Inf. Process. Lett. 49(5): 235-241 (1994)
1993
10 Dany Breslauer, Livio Colussi, Laura Toniolo: Tight Comparison Bounds for the String Prefix-Matching Problem. CPM 1993: 11-19
9EEDany Breslauer: Saving Comparisons in the Crochemore-Perrin String Matching Algorithm. ESA 1993: 61-72
8 Dany Breslauer, Livio Colussi, Laura Toniolo: Tight Comparison Bounds for the String Prefix-Matching Problem. Inf. Process. Lett. 47(1): 51-57 (1993)
7EEDany Breslauer, Zvi Galil: Efficient Comparison Based String Matching. J. Complexity 9(3): 339-365 (1993)
1992
6EEAlberto Apostolico, Dany Breslauer, Zvi Galil: Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract). ICALP 1992: 296-307
5 Dany Breslauer: An On-Line String Superprimitivity Test. Inf. Process. Lett. 44(6): 345-347 (1992)
4 Dany Breslauer, Zvi Galil: A Lower Bound for Parallel String Matching. SIAM J. Comput. 21(5): 856-862 (1992)
1991
3 Dany Breslauer, Zvi Galil: A Lower Bound for Parallel String Matching STOC 1991: 439-443
1990
2 Dany Breslauer, Zvi Galil: An Optimal O(log log n) Time Parallel String Matching Algorithm. SIAM J. Comput. 19(6): 1051-1058 (1990)
1989
1 Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin: Highly Parallelizable Problems (Extended Abstract) STOC 1989: 309-319

Coauthor Index

1Alberto Apostolico [6] [12] [15] [21] [28]
2Omer Berkman [1]
3Livio Colussi [8] [10] [13] [31]
4Artur Czumaj [27]
5Devdatt P. Dubhashi [27]
6Zvi Galil [1] [2] [3] [4] [6] [7] [12] [15] [18]
7Leszek Gasieniec [19] [23]
8Ramesh Hariharan [22]
9Friedhelm Meyer auf der Heide [27]
10Tao Jiang [26]
11Zhigen Jiang [26]
12Baruch Schieber [1]
13Laura Toniolo [8] [10] [13] [31]
14Uzi Vishkin [1]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)