 | 2012 |
| 26 |  | Travis Gagie,
Pawel Gawrychowski,
Juha Kärkkäinen,
Yakov Nekrich,
Simon J. Puglisi:
A Faster Grammar-Based Self-index.
LATA 2012: 240-251 |
| 25 |  | Pawel Gawrychowski:
Tying up the loose ends in fully LZW-compressed pattern matching.
STACS 2012: 624-635 |
| 24 |  | Travis Gagie,
Pawel Gawrychowski:
Linear-Space Substring Range Counting over Polylogarithmic Alphabets
CoRR abs/1202.3208: (2012) |
| 23 |  | Pawel Gawrychowski:
(Really) Tight bounds for dispatching binary methods
CoRR abs/1202.5670: (2012) |
| 2011 |
| 22 |  | Pawel Gawrychowski:
Chrobak Normal Form Revisited, with Applications.
CIAA 2011: 142-153 |
| 21 |  | Pawel Gawrychowski:
Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic.
ESA 2011: 421-432 |
| 20 |  | Travis Gagie,
Pawel Gawrychowski,
Simon J. Puglisi:
Faster Approximate Pattern Matching in Compressed Repetitive Texts.
ISAAC 2011: 653-662 |
| 19 |  | Pawel Gawrychowski,
Artur Jez,
Andreas Maletti:
On Minimising Automata with Errors.
MFCS 2011: 327-338 |
| 18 |  | Pawel Gawrychowski:
Optimal pattern matching in LZW compressed strings.
SODA 2011: 362-372 |
| 17 |  | Pawel Gawrychowski,
Artur Jez,
Andreas Maletti:
On minimising automata with errors
CoRR abs/1102.5682: (2011) |
| 16 |  | Pawel Gawrychowski:
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
CoRR abs/1104.4203: (2011) |
| 15 |  | Travis Gagie,
Pawel Gawrychowski,
Simon J. Puglisi:
Faster Approximate Pattern Matching in Compressed Repetitive Texts
CoRR abs/1109.2930: (2011) |
| 14 |  | Travis Gagie,
Pawel Gawrychowski:
A Faster LZ77-Based Index
CoRR abs/1109.3954: (2011) |
| 13 |  | Pawel Gawrychowski:
Tying up the loose ends in fully LZW-compressed pattern matching
CoRR abs/1109.4034: (2011) |
| 2010 |
| 12 |  | Pawel Gawrychowski,
Artur Jez,
Lukasz Jez:
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online.
CSR 2010: 132-143 |
| 11 |  | Travis Gagie,
Pawel Gawrychowski:
Grammar-Based Compression in a Streaming Model.
LATA 2010: 273-284 |
| 10 |  | Pawel Gawrychowski,
Dalia Krieger,
Narad Rampersad,
Jeffrey Shallit:
Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time.
Int. J. Found. Comput. Sci. 21(4): 597-618 (2010) |
| 9 |  | Jaroslaw Byrka,
Pawel Gawrychowski,
Katharina T. Huber,
Steven Kelk:
Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks.
J. Discrete Algorithms 8(1): 65-75 (2010) |
| 8 |  | Pawel Gawrychowski,
Marin Gutan,
Andrzej Kisielewicz:
On the problem of freeness of multiplicative matrix semigroups.
Theor. Comput. Sci. 411(7-9): 1115-1120 (2010) |
| 2009 |
| 7 |  | Pawel Gawrychowski,
Travis Gagie:
Minimax Trees in Linear Time with Applications.
IWOCA 2009: 278-288 |
| 6 |  | Pawel Gawrychowski,
Artur Jez:
Hyper-minimisation Made Efficient.
MFCS 2009: 356-368 |
| 5 |  | Pawel Gawrychowski,
Artur Jez,
Lukasz Jez:
Optimal, online validation of the pi and pi' failure functions
CoRR abs/0901.2897: (2009) |
| 2008 |
| 4 |  | Pawel Gawrychowski,
Dalia Krieger,
Narad Rampersad,
Jeffrey Shallit:
Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time.
Developments in Language Theory 2008: 339-358 |
| 3 |  | Pawel Gawrychowski,
Andrzej Kisielewicz:
2-Synchronizing Words.
LATA 2008: 221-231 |
| 2 |  | Pawel Gawrychowski,
Travis Gagie:
Minimax Trees in Linear Time
CoRR abs/0812.2868: (2008) |
| 2006 |
| 1 |  | Alessandra Cherubini,
Pawel Gawrychowski,
Andrzej Kisielewicz,
Brunetto Piochi:
A Combinatorial Approach to Collapsing Words.
MFCS 2006: 256-266 |