Paweł Gawrychowski
e-mail: gawry [at] cs.uni.wroc.pl
I'm a third year Ph.D. student at the University of Wrocław, interested (mainly) in algorithmic aspects of formal languages.
office hours
- Wednesday, 12:15 - 14:00 (room 342)
teaching
2009/2010
2008/2009
2007/2008
- Algorytmy i struktury danych, ćwiczenia
- Algorytmy grafowe, ćwiczenia
- Text algorithms
publications
- Paweł Gawrychowski: Alphabetic minimax trees in linear time, in preparation
- Paweł Gawrychowski, Artur Jeż, Lukasz Jeż: Validating the Knuth-Morris-Pratt failure function, fast and online, CSR 2010
- Travis Gagie, Paweł Gawrychowski: Grammar-Based Compression in a Streaming Model, LATA 2010 (arxiv)
- Paweł Gawrychowski, Marin Gutan, Andrzej Kisielewicz: On the problem of freenes of multiplicative matrix semigroups, Theoretical Computer Science 411 (2010) 1115-1120
- Paweł Gawrychowski, Artur Jez: Hyper-minimisation made efficient, MFCS 2009 (link to PDF) Best Student Paper Award
- Paweł Gawrychowski, Travis Gagie: Minimax trees in linear time with applications, IWOCA 2009 (arXiv) tied for Best Student Paper Award
- Paweł Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey Shallit: Finding the growth rate of a regular or context-free language in polynomial time, DLT 2008 (link to PDF) (presentation)
- Jarosław Byrka, Paweł Gawrychowski, Steven Kelk, Katharina T. Huber: Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks, Journal of Discrete Algorithms (arXiv) (journal version)
- Paweł Gawrychowski, Andrzej Kisielewicz: 2-synchronizing words, LATA 2008 (link to PDF) (presentation)
- Paweł Gawrychowski, Andrzej Kisielewicz: Recognizing 2-synchronizing words, AutoMathA 2007
- Alessandra Cherubini, Paweł Gawrychowski, Andrzej Kisielewicz, Brunetto Piochi: A combinatorial approach to collapsing words, MFCS 2006 (link to PDF) (presentation)