AAAAAA

   
Results: 1-14 |
Results: 14
ON COMPETITIVE ONLINE PAGING WITH LOOKAHEAD
Authors: BRESLAUER D
Citation: D. Breslauer, ON COMPETITIVE ONLINE PAGING WITH LOOKAHEAD, Theoretical computer science, 209(1-2), 1998, pp. 365-375
THE SUFFIX TREE OF A TREE AND MINIMIZING SEQUENTIAL TRANSDUCERS
Authors: BRESLAUER D
Citation: D. Breslauer, THE SUFFIX TREE OF A TREE AND MINIMIZING SEQUENTIAL TRANSDUCERS, Theoretical computer science, 191(1-2), 1998, pp. 131-144
ON THE COMPARISON COMPLEXITY OF THE STRING PREFIX-MATCHING PROBLEM
Authors: BRESLAUER D COLUSSI L TONIOLO L
Citation: D. Breslauer et al., ON THE COMPARISON COMPLEXITY OF THE STRING PREFIX-MATCHING PROBLEM, Journal of algorithms (Print), 29(1), 1998, pp. 18-67
ROTATIONS OF PERIODIC STRINGS AND SHORT SUPERSTRINGS
Authors: BRESLAUER D JIANG T JIANG ZG
Citation: D. Breslauer et al., ROTATIONS OF PERIODIC STRINGS AND SHORT SUPERSTRINGS, Journal of algorithms, 24(2), 1997, pp. 340-353
TRANSFORMING COMPARISON MODEL LOWER BOUNDS TO THE PARALLEL-RANDOM-ACCESS-MACHINE
Authors: BRESLAUER D CZUMAJ A DUBHASHI DP AUFDERHEIDE FM
Citation: D. Breslauer et al., TRANSFORMING COMPARISON MODEL LOWER BOUNDS TO THE PARALLEL-RANDOM-ACCESS-MACHINE, Information processing letters, 62(2), 1997, pp. 103-110
EFFICIENT STRING-MATCHING ON PACKED TEXTS
Authors: BRESLAUER D GASIENIEC L
Citation: D. Breslauer et L. Gasieniec, EFFICIENT STRING-MATCHING ON PACKED TEXTS, Informatique theorique et applications, 30(6), 1996, pp. 521-544
SAVING COMPARISONS IN THE CROCHEMORE-PERRIN STRING-MATCHING ALGORITHM
Authors: BRESLAUER D
Citation: D. Breslauer, SAVING COMPARISONS IN THE CROCHEMORE-PERRIN STRING-MATCHING ALGORITHM, Theoretical computer science, 158(1-2), 1996, pp. 177-192
AN OPTIMAL O(LOG LOG N)-TIME PARALLEL ALGORITHM FOR DETECTING ALL SQUARES IN A STRING
Authors: APOSTOLICO A BRESLAUER D
Citation: A. Apostolico et D. Breslauer, AN OPTIMAL O(LOG LOG N)-TIME PARALLEL ALGORITHM FOR DETECTING ALL SQUARES IN A STRING, SIAM journal on computing, 25(6), 1996, pp. 1318-1331
PARALLEL DETECTION OF ALL PALINDROMES IN A STRING
Authors: APOSTOLICO A BRESLAUER D GALIL Z
Citation: A. Apostolico et al., PARALLEL DETECTION OF ALL PALINDROMES IN A STRING, Theoretical computer science, 141(1-2), 1995, pp. 163-173
FAST PARALLEL STRING PREFIX-MATCHING
Authors: BRESLAUER D
Citation: D. Breslauer, FAST PARALLEL STRING PREFIX-MATCHING, Theoretical computer science, 137(2), 1995, pp. 269-278
DICTIONARY-MATCHING ON UNBOUNDED ALPHABETS - UNIFORM LENGTH DICTIONARIES
Authors: BRESLAUER D
Citation: D. Breslauer, DICTIONARY-MATCHING ON UNBOUNDED ALPHABETS - UNIFORM LENGTH DICTIONARIES, Journal of algorithms, 18(2), 1995, pp. 278-295
FINDING ALL PERIODS AND INITIAL PALINDROMES OF A STRING IN PARALLEL
Authors: BRESLAUER D GALIL Z
Citation: D. Breslauer et Z. Galil, FINDING ALL PERIODS AND INITIAL PALINDROMES OF A STRING IN PARALLEL, Algorithmica, 14(4), 1995, pp. 355-366
TESTING STRING SUPERPRIMITIVITY IN PARALLEL
Authors: BRESLAUER D
Citation: D. Breslauer, TESTING STRING SUPERPRIMITIVITY IN PARALLEL, Information processing letters, 49(5), 1994, pp. 235-241
TIGHT COMPARISON BOUNDS FOR THE STRING PREFIX-MATCHING PROBLEM
Authors: BRESLAUER D COLUSSI L TONIOLO L
Citation: D. Breslauer et al., TIGHT COMPARISON BOUNDS FOR THE STRING PREFIX-MATCHING PROBLEM, Information processing letters, 47(1), 1993, pp. 51-57
Risultati: 1-14 |