AAAAAA
Results:
1-10
|
Results: 10
Authors:
GASIENIEC L
PELC A
Citation: L. Gasieniec et A. Pelc, BROADCASTING WITH LINEARLY BOUNDED TRANSMISSION FAULTS, Discrete applied mathematics, 83(1-3), 1998, pp. 121-133
Authors:
CZUMAJ A
GASIENIEC L
PELC A
Citation: A. Czumaj et al., TIME AND COST TRADE-OFFS IN GOSSIPING, SIAM journal on discrete mathematics (Print), 11(3), 1998, pp. 400-413
Authors:
CROCHEMORE M
GASIENIEC L
HARIHARAN R
MUTHUKRISHNAN S
RYTTER W
Citation: M. Crochemore et al., A CONSTANT-TIME OPTIMAL PARALLEL ALGORITHM FOR 2-DIMENSIONAL PATTERN-MATCHING, SIAM journal on computing, 27(3), 1998, pp. 668-681
Authors:
GASIENIEC L
PELC A
Citation: L. Gasieniec et A. Pelc, BROADCASTING WITH A BOUNDED FRACTION OF FAULTY NODES, Journal of parallel and distributed computing, 42(1), 1997, pp. 11-20
Authors:
CZUMAJ A
GASIENIEC L
PIOTROW M
RYTTER W
Citation: A. Czumaj et al., SEQUENTIAL AND PARALLEL APPROXIMATION OF SHORTEST SUPERSTRINGS, Journal of algorithms, 23(1), 1997, pp. 74-100
Authors:
CROCHEMORE M
GALIL Z
GASIENIEC L
PARK K
RYTTER W
Citation: M. Crochemore et al., CONSTANT-TIME RANDOMIZED PARALLEL STRING-MATCHING, SIAM journal on computing, 26(4), 1997, pp. 950-960
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
Authors:
GASIENIEC L
PELC A
Citation: L. Gasieniec et A. Pelc, ADAPTIVE BROADCASTING WITH FAULTY NODES, Parallel computing, 22(6), 1996, pp. 903-912
Authors:
CROCHEMORE M
CZUMAJ A
GASIENIEC L
JAROMINEK S
LECROQ T
PLANDOWSKI W
RYTTER W
Citation: M. Crochemore et al., SPEEDING-UP 2 STRING-MATCHING ALGORITHMS, Algorithmica, 12(4-5), 1994, pp. 247-267
Authors:
CROCHEMORE M
GASIENIEC L
RYTTER W
Citation: M. Crochemore et al., 2-DIMENSIONAL PATTERN-MATCHING BY SAMPLING, Information processing letters, 46(4), 1993, pp. 159-162
Risultati:
1-10
|