Chrobak, M., L. Gasieniec and D.R. Kowalski: The wake-up problem in multihop radio networks. In: SIAM Journal on Computing 36, 5, 1453-1471 (2007).
doi: 10.1137/S0097539704442726
localid: C12573CC004A8E26-40739073EBED9539C12573E9004477EA-Chrobak2007
Chrobak, M., L. Gasieniec and D. Kowalski: The Wake-Up problem in multi-hop radio networks. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04) ACM, New York, USA (2004) 985-993.
localid: C1256428004B93B8-1A94ACA1D4D43773C1256ED000336890-Kowalski-SODA-2004
Fraigniaud, P., L. Gasieniec, D. Kowalski and A. Pelc: Collective Tree Exploration. In: LATIN 2004: Theoretical informatics, 6th Latin American Symposium Lecture Notes in Computer Science. Springer, Berlin, Germany (2004) 141-151.
localid: C1256428004B93B8-A224BDE3F8086969C1256ED00034790D-Kowalski-LATIN-2004
Fraigniaud, P., L. Gasieniec, D. Kowalski and A. Pelc: Collective Tree Exploration. In: LATIN 2004: Theoretical informatics, 6th Latin American Symposium Lecture Notes in Computer Science. Springer, Berlin, Germany (2004) 141-151.
localid: C1256428004B93B8-A224BDE3F8086969C1256ED00034790D-Kowalski-LATIN-2004
Chrobak, M., L. Gasieniec and D. Kowalski: The Wake-Up problem in multi-hop radio networks. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04) ACM, New York, USA (2004) 985-993.
localid: C1256428004B93B8-1A94ACA1D4D43773C1256ED000336890-Kowalski-SODA-2004
Crochemore, M., L. Gasieniec, R. Hariharan, S. Muthukrishnan and W. Rytter: A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching. In: SIAM Journal on Computing 27, 3, 668-681 (1998).
localid: C1256428004B93B8-FB6120FCB974E884C12567440060AC1D-CromemoreGasienicHariharanMuthukrishnanRytterSIAMJCOMPUT1998
Crochemore, M., L. Gasieniec and W. Rytter: Constant-space string-matching in sublinear average time. In: Compression and Complexity of SEQUENCES 1997, (Eds.) Carpentieri, B.; De Santis, A.; Vaccaro, U.; Storer, J. A. -, - (1998) 230-239.
localid: C1256428004B93B8-BD2EE2090672D741C12564C300276914-Crochemore-Gasieniec-Rytter97
Gasieniec, L. and A. Pelc: Broadcasting with a bounded fraction of faulty nodes. In: Journal of Parallel and Distributed Computing 42, 1, 11-20 (1997).
localid: C1256428004B93B8-FE0923DB35C7EBA6C12565D8004359B7-GasieniecPelc97
Crochemore, M., Z. Galil, L. Gasieniec, K. Park and W. Rytter: Constant-time Randomized Parallel String Matching. In: SIAM Journal on Computing 26, 4, 950-960 (1997).
localid: C1256428004B93B8-E3BAC1BEBEB10856C12565050036F513-Crochemore-et-al.97
Gasieniec, L. and P. Indyk: Efficient Parallel Computing with Memory Faults. In: Proceedings of the 11th Symposium on Fundamentals of Computation Theory (FCT-97), (Eds.) Chlebus, Bogdan S.; Czaja, Ludwik. Lecture Notes in Computer Science. Springer, Berlin, Germany (1997) 188-197.
localid: C1256428004B93B8-0DA1F3D5395E827CC12565D8003BF9BD-GasieniecIndyk97
http://edoc.mpg.de
The Max Planck Society does not take any responsibility for the content of this export.