- WorkTime Optimal Parallel Prefix Matching (Extended Abstract)
- On adaptive deterministic gossiping in ad hoc radio Leszek G asieniec Andrzej Lingas y
- Collective tree exploration Pierre Fraigniaud 1? , Leszek Gasieniec 2?? , Dariusz R. Kowalski 3;4? ? ? , and
- Efficient Algorithms for LempelZiv Encoding (Extended Abstract)
- Fast Broadcasting and Gossiping in Radio Networks Marek Chrobak Leszek Gasieniec y Wojciech Rytter z
- Gossiping with Unit Messages in Known Radio Networks asieniec Igor Potapov y
- On the Complexity of Determining the Period of a String Artur Czumaj 1? and Leszek Gasieniec 2??
- External Inverse Pattern Matching Leszek Gasieniec 1? and Piotr Indyk 2?? and Piotr Krysta 3???
- An improved bound on Boolean matrix multiplication for highly clustered data
- Almost optimal fully LZWcompressed pattern Leszek Gasieniec \Lambda Wojciech Rytter y
- Deterministic Communication in Radio Networks with Large Labels ?
- A Randomized Algorithm for Gossiping in Radio Networks Marek Chrobak Leszek G asieniec y Wojciech Rytter z
- On the complexity of computing evolutionary trees Leszek Gasieniec \Lambda
- Broadcasting with linearly bounded transmission faults
- Gossiping with bounded size messages in ad hoc radio networks
- Episode Matching Gautam Das 1 Rudolf Fleischer 2 Leszek Gasieniec 2
- Adaptive broadcasting with faulty nodes Leszek Gasieniec y Andrzej Pelc z
- Fast Deterministic Computations on a Faulty PRAM
- The WakeUp Problem in MultiHop Radio Networks Marek Chrobak Leszek Gasieniec y Dariusz Kowalski z
- TwoDimensional Pattern Matching in Linear Time and Small Space
- Efficient Parallel Computing with Memory Faults Leszek Gasieniec 1 and Piotr Indyk 2
- Oblivious gossiping in adhoc radio networks Bogdan S. Chlebus Leszek Gasieniec y{ Andrzej Lingas z Aris T. Pagourtzis x{
- Eciency of Fast Parallel Pattern-Searching in Highly Compressed Texts
- The wakeup problem in synchronous broadcast systems [Extended Abstract]
- Domino Tilings of Orthogonal Polygons Gyorgy Csizmadia { Jurek Czyzowicz xy Leszek G asieniec k Evangelos Kranakis y
- Faster deterministic gossiping in directed ad-hoc radio networks
- Approximate Dictionary Queries Gerth Stlting Brodal 1? and Leszek Gasieniec 2??
- Strategies for Hotlink Assignments y Prosenjit Bose z Jurek Czyzowicz x Leszek Gasieniec --Evangelos Kranakis z
- Approximation Algorithms for Hamming Clustering Problems
- Generalized Framework for Selectors with Applications in Optimal Group Testing
- The Architecture of a Software Library for String Processing 1
- The zooming method: a recursive approach to timespace efficient stringmatching \Lambda
- Randomized Efficient Algorithms for Compressed Strings
- Efficient Web Searching Using Temporal Factors Artur Czumaj \Lambda Ian Finch y Leszek Gasieniec yz Alan Gibbons y
- Time and cost tradeoffs in gossiping Artur Czumaj \Lambda Leszek Gasieniec y Andrzej Pelc z
- The PseudoPeriod Technique in Parallel String Matching
- Deterministic broadcasting in unknown radio networks Bogdan S. Chlebus Leszek G asieniec y Alan Gibbons y Andrzej Pelc z
- Minimizing Congestion of Layouts for ATM Networks with Faulty Links
- Deterministic M2M Multicast in Radio Networks (Extended Abstract)
- Parallel AlternatingDirection Access Machine ? Bogdan S. Chlebus 1 , Artur Czumaj 2?? , Leszek Gasieniec 1;3 ,
- Constantspace string matching with smaller number of comparisons: sequential sampling
- Deterministic Radio Broadcasting Bogdan S. Chlebus y , Leszek G asieniec z ,
- Routing via singlesource and multiplesource queries in static sensor networks
- Searching Patterns with Short Variables Leszek G asieniec 1 ? and Wojciech Rytter 12 ??
- Optimally fast parallel algorithms for preprocessing and pattern matching
- Time/Space Ecient Compressed Pattern Matching Leszek G asieniec Igor Potapov y
- Space ecient search for maximal repetitions Leszek G asieniec Roman Kolpakov y Igor Potapov z
- Optimal Pattern Matching on Meshes Bogdan S. Chlebus and Leszek Gasieniec
- Time efficient gossiping in known radio networks asieniec 1 , Igor Potapov 1 , and Qin Xin 1
- WorkTimeOptimal Parallel Algorithms for String Problems (EXTENDED ABSTRACT)
- ConstantSpace StringMatching in Sublinear Average Time
- Realtime traversal in grammarbased compressed files asieniec Roman Kolpakov Igor Potapov Paul Sant
- Realtime string matching in sublinear space asieniec 1 and Roman Kolpakov 1
- Broadcasting with a bounded fraction of faulty nodes
