 | 2009 |
|---|
| 118 |       | Evangelos Bampas,
Leszek Gasieniec,
Nicolas Hanusse,
David Ilcinkas,
Ralf Klasing,
Adrian Kosowski:
Euler Tour Lock-In Problem in the Rotor-Router Model.
DISC 2009: 423-435 |
| 117 | | Jurek Czyzowicz,
Leszek Gasieniec,
Dariusz R. Kowalski,
Andrzej Pelc:
Consensus and Mutual Exclusion in a Multiple Access Channel.
DISC 2009: 512-526 |
| 116 | | Frantisek Galcík,
Leszek Gasieniec,
Andrzej Lingas:
Efficient broadcasting in known topology radio networks with long-range interference.
PODC 2009: 230-239 |
| 115 | | Artur Czumaj,
Jurek Czyzowicz,
Leszek Gasieniec,
Jesper Jansson,
Andrzej Lingas,
Pawel Zylinski:
Approximation Algorithms for Buy-at-Bulk Geometric Network Design.
WADS 2009: 168-180 |
| 114 | | Jurek Czyzowicz,
Stefan Dobrev,
Leszek Gasieniec,
David Ilcinkas,
Jesper Jansson,
Ralf Klasing,
Yannis Lignos,
Russell A. Martin,
Kunihiko Sadakane,
W.-K. Sung:
More efficient periodic traversal in anonymous undirected graphs
CoRR abs/0905.1737: (2009) |
| 113 | | Yuval Emek,
Leszek Gasieniec,
Erez Kantor,
Andrzej Pelc,
David Peleg,
Chang Su:
Broadcasting in UDG radio networks with unknown topology.
Distributed Computing 21(5): 331-351 (2009) |
| 112 | | Leszek Gasieniec,
Miroslaw Kowaluk,
Andrzej Lingas:
Faster multi-witnesses for Boolean matrix multiplication.
Inf. Process. Lett. 109(4): 242-247 (2009) |
| 111 | | Jurek Czyzowicz,
Leszek Gasieniec,
Andrzej Pelc:
Gathering few fat mobile robots in the plane.
Theor. Comput. Sci. 410(6-7): 481-499 (2009) |
| 2008 |
|---|
| 110 | | Leszek Gasieniec,
Cindy Y. Li,
Meng Zhang:
Faster Algorithm for the Set Variant of the String Barcoding Problem.
CPM 2008: 82-94 |
| 109 | | Robert Elsässer,
Leszek Gasieniec,
Thomas Sauerwald:
On Radio Broadcasting in Random Geometric Graphs.
DISC 2008: 212-226 |
| 108 | | Leszek Gasieniec,
Dariusz R. Kowalski,
Andrzej Lingas,
Martin Wahlen:
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges.
DISC 2008: 274-288 |
| 107 | | Leszek Gasieniec,
Tomasz Radzik:
Memory Efficient Anonymous Graph Exploration.
WG 2008: 14-29 |
| 106 | | Leszek Gasieniec:
Deterministic Broadcasting in Radio Networks.
Encyclopedia of Algorithms 2008 |
| 105 | | Leszek Gasieniec:
Randomized Gossiping in Radio Networks.
Encyclopedia of Algorithms 2008 |
| 104 | | Leszek Gasieniec,
Chang Su,
Prudence W. H. Wong:
Routing in Geometric Networks.
Encyclopedia of Algorithms 2008 |
| 103 | | Leszek Gasieniec,
Erez Kantor,
Dariusz R. Kowalski,
David Peleg,
Chang Su:
Time efficient k-shot broadcasting in known topology radio networks.
Distributed Computing 21(2): 117-127 (2008) |
| 102 | | Leszek Gasieniec,
Ralf Klasing,
Russell A. Martin,
Alfredo Navarra,
Xiaohui Zhang:
Fast periodic graph exploration with constant memory.
J. Comput. Syst. Sci. 74(5): 808-822 (2008) |
| 101 | | Bogdan S. Chlebus,
Leszek Gasieniec,
Dariusz R. Kowalski,
Alexander A. Shvartsman:
A robust randomized algorithm to perform independent tasks.
J. Discrete Algorithms 6(4): 651-665 (2008) |
| 100 | | Paola Flocchini,
Leszek Gasieniec:
Preface.
Theor. Comput. Sci. 399(1-2): 1-2 (2008) |
| 2007 |
|---|
| 99 | | Leszek Gasieniec,
Erez Kantor,
Dariusz R. Kowalski,
David Peleg,
Chang Su:
Energy and Time Efficient Broadcasting in Known Topology Radio Networks.
DISC 2007: 253-267 |
| 98 | | Yuval Emek,
Leszek Gasieniec,
Erez Kantor,
Andrzej Pelc,
David Peleg,
Chang Su:
Broadcasting in udg radio networks with unknown topology.
PODC 2007: 195-204 |
| 97 | | Leszek Gasieniec,
Ralf Klasing,
Russell A. Martin,
Alfredo Navarra,
Xiaohui Zhang:
Fast Periodic Graph Exploration with Constant Memory.
SIROCCO 2007: 26-40 |
| 96 | | Leszek Gasieniec,
Andrzej Pelc,
Tomasz Radzik,
Xiaohui Zhang:
Tree exploration with logarithmic memory.
SODA 2007: 585-594 |
| 95 | | Leszek Gasieniec,
Aris Pagourtzis,
Igor Potapov,
Tomasz Radzik:
Deterministic Communication in Radio Networks with Large Labels.
Algorithmica 47(1): 97-117 (2007) |
| 94 | | Leszek Gasieniec,
David Peleg,
Qin Xin:
Faster communication in known topology radio networks.
Distributed Computing 19(4): 289-300 (2007) |
| 93 | | Amihood Amir,
Leszek Gasieniec,
B. Riva Shalom:
Improved approximate common interval.
Inf. Process. Lett. 103(4): 142-149 (2007) |
| 92 | | Leszek Gasieniec,
Chang Su,
Prudence W. H. Wong,
Qin Xin:
Routing of single-source and multiple-source queries in static sensor networks.
J. Discrete Algorithms 5(1): 1-11 (2007) |
| 91 | | Marek Chrobak,
Leszek Gasieniec,
Dariusz R. Kowalski:
The Wake-Up Problem in MultiHop Radio Networks.
SIAM J. Comput. 36(5): 1453-1471 (2007) |
| 90 | | Leszek Gasieniec,
Igor Potapov,
Qin Xin:
Time efficient centralized gossiping in radio networks.
Theor. Comput. Sci. 383(1): 45-58 (2007) |
| 2006 |
|---|
| 89 |  | Paola Flocchini,
Leszek Gasieniec:
Structural Information and Communication Complexity, 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings
Springer 2006 |
| 88 | | Leszek Gasieniec,
Cindy Y. Li,
Paul Sant,
Prudence W. H. Wong:
Efficient Probe Selection in Microarray Design.
CIBCB 2006: 1-8 |
| 87 | | Jurek Czyzowicz,
Leszek Gasieniec,
Andrzej Pelc:
Gathering Few Fat Mobile Robots in the Plane.
OPODIS 2006: 350-364 |
| 86 | | Leszek Gasieniec,
Evangelos Kranakis,
Danny Krizanc,
X. Zhang:
Optimal Memory Rendezvous of Anonymous Mobile Agents in a Unidirectional Ring.
SOFSEM 2006: 282-292 |
| 85 | | Robert Elsässer,
Leszek Gasieniec:
Radio communication in random graphs.
J. Comput. Syst. Sci. 72(3): 490-506 (2006) |
| 84 | | Pierre Fraigniaud,
Leszek Gasieniec,
Dariusz R. Kowalski,
Andrzej Pelc:
Collective tree exploration.
Networks 48(3): 166-177 (2006) |
| 83 | | Andrzej Lingas,
Leszek Gasieniec:
Preface.
Theor. Comput. Sci. 354(3): 319 (2006) |
| 82 | | Leszek Gasieniec,
Evangelos Kranakis,
Andrzej Pelc,
Qin Xin:
Deterministic M2M multicast in radio networks.
Theor. Comput. Sci. 362(1-3): 196-206 (2006) |
| 2005 |
|---|
| 81 | | Leszek Gasieniec,
Roman M. Kolpakov,
Igor Potapov,
Paul Sant:
Real-Time Traversal in Grammar-Based Compressed Files.
DCC 2005: 458 |
| 80 | | Bogdan S. Chlebus,
Leszek Gasieniec,
Dariusz R. Kowalski,
Tomasz Radzik:
On the Wake-Up Problem in Radio Networks.
ICALP 2005: 347-359 |
| 79 | | Leszek Gasieniec,
Chang Su,
Prudence W. H. Wong,
Qin Xin:
Routing via Single-Source and Multiple-Source Queries in Static Sensor Networks.
IPDPS 2005 |
| 78 | | Leszek Gasieniec,
David Peleg,
Qin Xin:
Faster communication in known topology radio networks.
PODC 2005: 129-137 |
| 77 | | Robert Elsässer,
Leszek Gasieniec:
Radio communication in random graphs: extended abstract.
SPAA 2005: 309-315 |
| 76 | | Annalisa De Bonis,
Leszek Gasieniec,
Ugo Vaccaro:
Optimal Two-Stage Algorithms for Group Testing Problems.
SIAM J. Comput. 34(5): 1253-1270 (2005) |
| 75 | | Leszek Gasieniec,
Roman M. Kolpakov,
Igor Potapov:
Space efficient search for maximal repetitions.
Theor. Comput. Sci. 339(1): 35-48 (2005) |
| 2004 |
|---|
| 74 | | Leszek Gasieniec,
Roman M. Kolpakov:
Real-Time String Matching in Sublinear Space.
CPM 2004: 117-129 |
| 73 | | Leszek Gasieniec,
Evangelos Kranakis,
Andrzej Pelc,
Qin Xin:
Deterministic M2M Multicast in Radio Networks: (Extended Abstract).
ICALP 2004: 670-682 |
| 72 | | Pierre Fraigniaud,
Leszek Gasieniec,
Dariusz R. Kowalski,
Andrzej Pelc:
Collective Tree Exploration.
LATIN 2004: 141-151 |
| 71 | | Leszek Gasieniec,
Igor Potapov,
Qin Xin:
Time Efficient Gossiping in Known Radio Networks.
SIROCCO 2004: 173-184 |
| 70 | | Marek Chrobak,
Leszek Gasieniec,
Dariusz R. Kowalski:
The wake-up problem in multi-hop radio networks.
SODA 2004: 992-1000 |
| 69 | | Leszek Gasieniec,
Tomasz Radzik,
Qin Xin:
Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks.
SWAT 2004: 397-407 |
| 68 | | Leszek Gasieniec,
Jesper Jansson,
Andrzej Lingas:
Approximation algorithms for Hamming clustering problems.
J. Discrete Algorithms 2(2): 289-301 (2004) |
| 67 | | Marek Chrobak,
Leszek Gasieniec,
Wojciech Rytter:
A randomized algorithm for gossiping in radio networks.
Networks 43(2): 119-124 (2004) |
| 2003 |
|---|
| 66 | | Annalisa De Bonis,
Leszek Gasieniec,
Ugo Vaccaro:
Generalized Framework for Selectors with Applications in Optimal Group Testing.
ICALP 2003: 81-96 |
| 65 | | Leszek Gasieniec,
Andrzej Lingas:
An Improved Bound on Boolean Matrix Multiplication for Highly Clustered Data.
WADS 2003: 329-339 |
| 64 | | Bogdan S. Chlebus,
Leszek Gasieniec,
Andrzej Pelc:
Deterministic Computations on a PRAM with Static Processor and Memory Faults.
Fundam. Inform. 55(3-4): 285-306 (2003) |
| 63 | | Leszek Gasieniec,
Igor Potapov:
Time/Space Efficient Compressed Pattern Matching.
Fundam. Inform. 56(1-2): 137-154 (2003) |
| 62 | | Artur Czumaj,
Leszek Gasieniec,
Daya Ram Gaur,
Ramesh Krishnamurti,
Wojciech Rytter,
Michele Zito:
On polynomial-time approximation algorithms for the variable length scheduling problem.
Theor. Comput. Sci. 302(1-3): 489-495 (2003) |
| 2002 |
|---|
| 61 | | Bogdan S. Chlebus,
Leszek Gasieniec,
Dariusz R. Kowalski,
Alexander A. Shvartsman:
Bounding Work and Communication in Robust Cooperative Computation.
DISC 2002: 295-310 |
| 60 | | Leszek Gasieniec,
Aris Pagourtzis,
Igor Potapov:
Deterministic Communication in Radio Networks with Large Labels.
ESA 2002: 512-524 |
| 59 | | Malin Christersson,
Leszek Gasieniec,
Andrzej Lingas:
Gossiping with Bounded Size Messages in ad hoc Radio Networks.
ICALP 2002: 377-389 |
| 58 | | Leszek Gasieniec,
Igor Potapov:
Gossiping with Unit Messages in Known Radio Networks.
IFIP TCS 2002: 193-205 |
| 57 | | Leszek Gasieniec,
Andrzej Lingas:
On adaptive deterministic gossiping in ad hoc radio networks.
SODA 2002: 689-690 |
| 56 | | Bogdan S. Chlebus,
Leszek Gasieniec,
Alan Gibbons,
Andrzej Pelc,
Wojciech Rytter:
Deterministic broadcasting in ad hoc radio networks.
Distributed Computing 15(1): 27-38 (2002) |
| 55 | | Leszek Gasieniec,
Andrzej Lingas:
On adaptive deterministic gossiping in ad hoc radio networks.
Inf. Process. Lett. 83(2): 89-93 (2002) |
| 54 | | Marek Chrobak,
Leszek Gasieniec,
Wojciech Rytter:
Fast broadcasting and gossiping in radio networks.
J. Algorithms 43(2): 177-189 (2002) |
| 2001 |
|---|
| 53 | | Marek Chrobak,
Leszek Gasieniec,
Wojciech Rytter:
A Randomized Algorithm for Gossiping in Radio Networks.
COCOON 2001: 483-492 |
| 52 | | Bogdan S. Chlebus,
Leszek Gasieniec,
Andrzej Lingas,
Aris Pagourtzis:
Oblivious gossiping in ad-hoc radio networks.
DIAL-M 2001: 44-51 |
| 51 | | Leszek Gasieniec,
Igor Potapov:
Time/Space Efficient Compressed Pattern Matching.
FCT 2001: 138-149 |
| 50 | | Leszek Gasieniec,
Andrzej Pelc,
David Peleg:
The Wakeup Problem in Synchronous Broadcast Systems.
SIAM J. Discrete Math. 14(2): 207-222 (2001) |
| 49 | | Artur Czumaj,
Ian Finch,
Leszek Gasieniec,
Alan Gibbons,
Paul H. Leng,
Wojciech Rytter,
Michele Zito:
Efficient web searching using temporal factors.
Theor. Comput. Sci. 262(1): 569-582 (2001) |
| 2000 |
|---|
| 48 | | Leszek Gasieniec,
Jesper Jansson,
Andrzej Lingas:
Approximation Algorithms for Hamming Clustering Problems.
CPM 2000: 108-118 |
| 47 | | Artur Czumaj,
Leszek Gasieniec:
On the Complexity of Determining the Period of a String.
CPM 2000: 412-422 |
| 46 | | Marek Chrobak,
Leszek Gasieniec,
Wojciech Rytter:
Fast Broadcasting and Gossiping in Radio Networks.
FOCS 2000: 575-581 |
| 45 | | Bogdan S. Chlebus,
Leszek Gasieniec,
Anna Östlin,
John Michael Robson:
Deterministic Radio Broadcasting.
ICALP 2000: 717-728 |
| 44 | | Prosenjit Bose,
Evangelos Kranakis,
Danny Krizanc,
Miguel Vargas Martin,
Jurek Czyzowicz,
Andrzej Pelc,
Leszek Gasieniec:
Strategies for Hotlink Assignments.
ISAAC 2000: 23-34 |
| 43 | | Leszek Gasieniec,
Andrzej Pelc,
David Peleg:
The wakeup problem in synchronous broadcast systems (extended abstract).
PODC 2000: 113-121 |
| 42 | | Bogdan S. Chlebus,
Leszek Gasieniec,
Alan Gibbons,
Andrzej Pelc,
Wojciech Rytter:
Deterministic broadcasting in unknown radio networks.
SODA 2000: 861-870 |
| 41 | | Bogdan S. Chlebus,
Artur Czumaj,
Leszek Gasieniec,
Miroslaw Kowaluk,
Wojciech Plandowski:
Algorithms for the parallel alternating direction access machine.
Theor. Comput. Sci. 245(2): 151-173 (2000) |
| 1999 |
|---|
| 40 | | György Csizmadia,
Jurek Czyzowicz,
Leszek Gasieniec,
Evangelos Kranakis,
Jorge Urrutia:
Domino tilings of orthogonal polygons.
CCCG 1999 |
| 39 | | Leszek Gasieniec,
Wojciech Rytter:
Almost Optimal Fully LZW-Compressed Pattern Matching.
Data Compression Conference 1999: 316-325 |
| 38 | | Leszek Gasieniec,
Alan Gibbons,
Wojciech Rytter:
Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts.
MFCS 1999: 48-58 |
| 37 | | Leszek Gasieniec,
Jesper Jansson,
Andrzej Lingas:
Efficient Approximation Algorithms for the Hamming Center Problem.
SODA 1999: 905-906 |
| 36 | | Artur Czumaj,
Ian Finch,
Leszek Gasieniec,
Alan Gibbons,
Paul H. Leng,
Wojciech Rytter,
Michele Zito:
Efficient Web Searching Using Temporal Factors.
WADS 1999: 294-305 |
| 35 | | Maxime Crochemore,
Artur Czumaj,
Leszek Gasieniec,
Thierry Lecroq,
Wojciech Plandowski,
Wojciech Rytter:
Fast Practical Multi-Pattern Matching.
Inf. Process. Lett. 71(3-4): 107-113 (1999) |
| 34 | | Leszek Gasieniec,
Evangelos Kranakis,
Danny Krizanc,
Andrzej Pelc:
Minimizing Congestion of Layouts for ATM Networks with Faulty Links.
Int. J. Found. Comput. Sci. 10(4): 503-512 (1999) |
| 33 | | Leszek Gasieniec,
Jesper Jansson,
Andrzej Lingas,
Anna Östlin:
On the Complexity of Constructing Evolutionary Trees.
J. Comb. Optim. 3(2-3): 183-197 (1999) |
| 32 | | Maxime Crochemore,
Leszek Gasieniec,
Wojciech Rytter:
Constant-Space String-Matching in Sublinear Average Time.
Theor. Comput. Sci. 218(1): 197-203 (1999) |
| 1998 |
|---|
| 31 | | Leszek Gasieniec,
Jesper Jansson,
Andrzej Lingas,
Anna Östlin:
Inferring Ordered Trees from Local Constraints.
CATS 1998: 67-76 |
| 30 | | Leszek Gasieniec,
Andrzej Pelc:
Broadcasting with linearly bounded transmission faults.
Discrete Applied Mathematics 83(1-3): 121-133 (1998) |
| 29 | | Maxime Crochemore,
Leszek Gasieniec,
Ramesh Hariharan,
S. Muthukrishnan,
Wojciech Rytter:
A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching.
SIAM J. Comput. 27(3): 668-681 (1998) |
| 28 | | Artur Czumaj,
Leszek Gasieniec,
Andrzej Pelc:
Time and Cost Trade-Offs in Gossiping.
SIAM J. Discrete Math. 11(3): 400-413 (1998) |
| 1997 |
|---|
| 27 | | Leszek Gasieniec,
Jesper Jansson,
Andrzej Lingas,
Anna Östlin:
On the Complexity of Computing Evolutionary Trees.
COCOON 1997: 134-145 |
| 26 | | Gautam Das,
Rudolf Fleischer,
Leszek Gasieniec,
Dimitrios Gunopulos,
Juha Kärkkäinen:
Episode Matching.
CPM 1997: 12-27 |
| 25 | | Leszek Gasieniec,
Piotr Indyk,
Piotr Krysta:
External Inverse Pattern Matching.
CPM 1997: 90-101 |
| 24 | | Leszek Gasieniec,
Piotr Indyk:
Efficient Parallel Computing with Memory Faults.
FCT 1997: 188-197 |
| 23 | | Artur Czumaj,
Leszek Gasieniec,
Marek Piotrów,
Wojciech Rytter:
Sequential and Parallel Approximation of Shortest Superstrings.
J. Algorithms 23(1): 74-100 (1997) |
| 22 | | Leszek Gasieniec,
Andrzej Pelc:
Broadcasting with a Bounded Fraction of Faulty Nodes.
J. Parallel Distrib. Comput. 42(1): 11-20 (1997) |
| 21 | | Maxime Crochemore,
Zvi Galil,
Leszek Gasieniec,
Kunsoo Park,
Wojciech Rytter:
Constant-Time Randomized Parallel String Matching.
SIAM J. Comput. 26(4): 950-960 (1997) |
| 1996 |
|---|
| 20 | | Leszek Gasieniec,
Marek Karpinski,
Wojciech Plandowski,
Wojciech Rytter:
Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract).
CPM 1996: 39-49 |
| 19 | | Gerth Stølting Brodal,
Leszek Gasieniec:
Approximate Dictionary Queries.
CPM 1996: 65-74 |
| 18 | | Bogdan S. Chlebus,
Artur Czumaj,
Leszek Gasieniec,
Miroslaw Kowaluk,
Wojciech Plandowski:
Parallel Alternating-Direction Access Machine.
MFCS 1996: 267-278 |
| 17 | | Leszek Gasieniec,
Evangelos Kranakis,
Danny Krizanc,
Andrzej Pelc:
Minimizing Congestion of Layouts for ATM Networks with Faulty Links.
MFCS 1996: 372-381 |
| 16 | | Leszek Gasieniec,
Marek Karpinski,
Wojciech Plandowski,
Wojciech Rytter:
Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract).
SWAT 1996: 392-403 |
| 15 | | Dany Breslauer,
Leszek Gasieniec:
Efficient String Matching on Packed Texts.
ITA 30(6): 521-544 (1996) |
| 14 | | Leszek Gasieniec,
Andrzej Pelc:
Adaptive Broadcasting with Faulty Nodes.
Parallel Computing 22(6): 903-912 (1996) |
| 1995 |
|---|
| 13 | | Dany Breslauer,
Leszek Gasieniec:
Efficient String Matching on Coded Texts.
CPM 1995: 27-40 |
| 12 | | Leszek Gasieniec,
Wojciech Plandowski,
Wojciech Rytter:
Constant-Space String Matching with Smaller Number of Comparisons: Sequential Sampling.
CPM 1995: 78-89 |
| 11 | | Bogdan S. Chlebus,
Leszek Gasieniec,
Andrzej Pelc:
Fast Deterministic Simulation of Computations on Faulty Parallel Machines.
ESA 1995: 89-101 |
| 10 | | Maxime Crochemore,
Leszek Gasieniec,
Wojciech Plandowski,
Wojciech Rytter:
Two-Dimensional Pattern Matching in Linear Time and Small Space.
STACS 1995: 181-192 |
| 9 | | Artur Czumaj,
Zvi Galil,
Leszek Gasieniec,
Kunsoo Park,
Wojciech Plandowski:
Work-time-optimal parallel algorithms for string problems.
STOC 1995: 713-722 |
| 8 | | Leszek Gasieniec,
Wojciech Plandowski,
Wojciech Rytter:
The Zooming Method: A Recursive Approach to Time-Space Efficient String-Matching.
Theor. Comput. Sci. 147(1&2): 19-30 (1995) |
| 1994 |
|---|
| 7 | | Leszek Gasieniec,
Kunsoo Park:
Work-Time Optimal Parallel Prefix Matching (Extended Abstract).
ESA 1994: 471-482 |
| 6 | | Bogdan S. Chlebus,
Leszek Gasieniec:
Optimal Pattern Matching on Meshes.
STACS 1994: 213-224 |
| 5 | | Artur Czumaj,
Leszek Gasieniec,
Marek Piotrów,
Wojciech Rytter:
Parallel and Sequential Approximations of Shortest Superstrings.
SWAT 1994: 95-106 |
| 4 | | Maxime Crochemore,
Artur Czumaj,
Leszek Gasieniec,
Stefan Jarominek,
Thierry Lecroq,
Wojciech Plandowski,
Wojciech Rytter:
Speeding Up Two String-Matching Algorithms.
Algorithmica 12(4/5): 247-267 (1994) |
| 1993 |
|---|
| 3 | | Richard Cole,
Maxime Crochemore,
Zvi Galil,
Leszek Gasieniec,
Ramesh Hariharan,
S. Muthukrishnan,
Kunsoo Park,
Wojciech Rytter:
Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions
FOCS 1993: 248-258 |
| 2 | | Maxime Crochemore,
Leszek Gasieniec,
Wojciech Rytter:
Two-Dimensional Pattern Matching by Sampling.
Inf. Process. Lett. 46(4): 159-162 (1993) |
| 1992 |
|---|
| 1 | | Maxime Crochemore,
Thierry Lecroq,
Artur Czumaj,
Leszek Gasieniec,
Stefan Jarominek,
Wojciech Plandowski,
Wojciech Rytter:
Speeding Up Two String-Matching Algorithms.
STACS 1992: 589-600 |
