AAAAAA

   
Results: 1-8 |
Results: 8
2-DIMENSIONAL PREFIX STRING-MATCHING AND COVERING ON SQUARE MATRICES
Authors: CROCHEMORE M ILIOPOULOS CS KORDA M
Citation: M. Crochemore et al., 2-DIMENSIONAL PREFIX STRING-MATCHING AND COVERING ON SQUARE MATRICES, Algorithmica, 20(4), 1998, pp. 353-373
A CHARACTERIZATION OF THE SQUARES IN A FIBONACCI STRING
Authors: ILIOPOULOS CS MOORE D SMYTH WF
Citation: Cs. Iliopoulos et al., A CHARACTERIZATION OF THE SQUARES IN A FIBONACCI STRING, Theoretical computer science, 172(1-2), 1997, pp. 281-291
A WORK-TIME OPTIMAL ALGORITHM FOR COMPUTING ALL STRING COVERS
Authors: ILIOPOULOS CS PARK K
Citation: Cs. Iliopoulos et K. Park, A WORK-TIME OPTIMAL ALGORITHM FOR COMPUTING ALL STRING COVERS, Theoretical computer science, 164(1-2), 1996, pp. 299-310
COVERING A STRING
Authors: ILIOPOULOS CS MOORE DWG PARK K
Citation: Cs. Iliopoulos et al., COVERING A STRING, Algorithmica, 16(3), 1996, pp. 288-297
ON THE LOWER-BOUND FOR PARALLEL STRING-MATCHING
Authors: GALLEY CN ILIOPOULOS CS
Citation: Cn. Galley et Cs. Iliopoulos, ON THE LOWER-BOUND FOR PARALLEL STRING-MATCHING, International journal of computer mathematics, 62(3-4), 1996, pp. 155-162
THE SUBTREE MAX GAP PROBLEM WITH APPLICATION TO PARALLEL STRING COVERING
Authors: BERKMAN O ILIOPOULOS CS PARK K
Citation: O. Berkman et al., THE SUBTREE MAX GAP PROBLEM WITH APPLICATION TO PARALLEL STRING COVERING, Information and computation, 123(1), 1995, pp. 127-137
FAST AVERAGE-CASE ALGORITHM FOR LYNDON DECOMPOSITION
Authors: ILIOPOULOS CS SMYTH WF
Citation: Cs. Iliopoulos et Wf. Smyth, FAST AVERAGE-CASE ALGORITHM FOR LYNDON DECOMPOSITION, International journal of computer mathematics, 57(1-2), 1995, pp. 15-31
PARALLEL RAM ALGORITHMS FOR FACTORIZING WORDS
Authors: DAYKIN JW ILIOPOULOS CS SMYTH WF
Citation: Jw. Daykin et al., PARALLEL RAM ALGORITHMS FOR FACTORIZING WORDS, Theoretical computer science, 127(1), 1994, pp. 53-67
Risultati: 1-8 |