Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Gawrychowski, Pawe{\l}"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computing minimal and maximal suffixes of a substring revisited
Maxim Babenko
,
Paweƚ Gawrychowski
,
Tomasz Kociumaka
,
Tatiana Starikovskaya
Lecture Notes in Computer Science
8486
, 2014, pp. 30-39
Validating the Knuth-Morris-Pratt failure function, fast and online
Paweƚ Gawrychowski
,
Artur Jeż
,
Łukasz Jeż
Theory of Computing Systems
54
(2), 2014, pp. 337-372
Weighted ancestors in suffix trees
Paweƚ Gawrychowski
,
Moshe Lewenstein
,
Patrick K. Nicholson
Lecture Notes in Computer Science
8737
, 2014, pp. 455-466
Testing generalised freeness of words
Paweƚ Gawrychowski
,
Florin Manea
,
Dirk Nowotka
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 337-349
Improved submatrix maximum queries in Monge matrices
Paweƚ Gawrychowski
,
Shay Mozes
,
Oren Weimann
Lecture Notes in Computer Science
8572
, 2014, pp. 525-537
Euclidean TSP with few inner points in linear space
Paweƚ Gawrychowski
,
Damian Rusak
Lecture Notes in Computer Science
8889
, 2014, pp. 701-713
Order-preserving pattern matching with
k
mismatches
Paweƚ Gawrychowski
,
Przemysƚaw Uznański
Lecture Notes in Computer Science
8486
, 2014, pp. 130-139
Converting SLP to LZ78 in almost linear time
Hideo Bannai
,
Paweƚ Gawrychowski
,
Shunsuke Inenaga
,
Masayuki Takeda
Lecture Notes in Computer Science
7922
, 2013, pp. 38-49
Beating
\mathcal{O}(nm)
in approximate LZW-compressed pattern matching
Paweƚ Gawrychowski
,
Damian Straszak
Lecture Notes in Computer Science
8283
, 2013, pp. 78-88
Simple and efficient LZW-compressed multiple pattern matching
Paweƚ Gawrychowski
Lecture Notes in Computer Science
7354
, 2012, pp. 232-242
Tying up the loose ends in fully LZW-compressed pattern matching
Paweƚ Gawrychowski
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 624-635
Faster approximate pattern matching in compressed repetitive texts
Travis Gagie
,
Paweƚ Gawrychowski
,
Simon J. Puglisi
Lecture Notes in Computer Science
7074
, 2011, pp. 653-662
On minimising automata with errors
Paweƚ Gawrychowski
,
Artur Jeż
,
Andreas Maletti
Lecture Notes in Computer Science
6907
, 2011, pp. 327-338
Pattern matching in Lempel-Ziv compressed strings: Fast, simple, and deterministic
Paweƚ Gawrychowski
Lecture Notes in Computer Science
6942
, 2011, pp. 421-432
On the problem of freeness of multiplicative matrix semigroups
Paweƚ Gawrychowski
,
Marin Gutan
,
Andrzej Kisielewicz
Theoretical Computer Science
411
(7-9), 2010, pp. 1115-1120
Validating the Knuth-Morris-Pratt failure function, fast and online
Paweƚ Gawrychowski
,
Artur Jeż
,
Łukasz Jeż
Lecture Notes in Computer Science
6072
, 2010, pp. 132-143
Finding the growth rate of a regular or context-free language in polynomial time
Paweƚ Gawrychowski
,
Dalia Krieger
,
Narad Rampersad
,
Jeffrey Shallit
International Journal of Foundations of Computer Science
21
(4), 2010, pp. 597-618
Hyper-minimisation made efficient
Paweƚ Gawrychowski
,
Artur Jeż
Lecture Notes in Computer Science
5734
, 2009, pp. 356-368