Instytut
Informatyki
ul. Joliot-Curie 15
PL-50-383 Wrocław
Email:
aje X cs.uni.wroc.pl
tel +48 71 375-78-37
fax +48 71 375-78-01
Teaching and office hours (mostly in Polish)
Papers
2010
(joint work with A. Okhotin) Least and greatest solutions of equations over sets of integers, MFCS 2010
(joint work with P. Gawrychowski and Ł. Jeż) Validating the Knuth-Morris-Pratt failure function, fast and online, CSR 2010 (.ps, .pdf)
(joint work with A. Okhotin) On equations over sets of integers, STACS 2010 (arXiv, very sketchy full version .ps .pdf)
2009
(joint work with P. Gawrychowski) Hyper-minimisation made efficient, MFCS 2009 (conference version, rough full version) (Best student paper award)
(joint work with A. Okhotin) One-nonterminal conjunctive grammars over a unary alphabet, CSR 2009 (.ps .pdf)
full version: submitted
(joint work with J. Łopuszański) On the Two-Dimensional Cow Search Problem, Information Processing Letters 109 (2009) 543–547 (.ps)
(joint work with A. Okhotin) Equations over sets of natural numbers with addition only, STACS 2009 (conference version)
(joint paper with M. Bienkowski, M. Chrobak, C. Durr, M. Hurand, Ł. Jeż, G. Stachowiak) Collecting Weighted Items from a Dynamic Queue SODA 2009 (.ps, .pdf)
2008
(joint work with A. Okhotin) On the computational completeness of equations over sets of natural number, ICALP (track B) 2008
(joint work with M. Grech and A. Kisielewicz) Graphical complexity of products of permutation groups. Discrete Mathematics 308 (2008), 1142-1152. (available on request)
(joint work with A. Okhotin) Complexity of solutions of equations over sets of natural numbers, STACS 2008 (conference version) (TR).
full version: Theory of Computing Systems
(joint work with P. Śniady) Generalized Cauchy identities, trees and multidimensional Brownian motions. Part II: Combinatorial differential calculus (arXiv)
2007
(joint work with A. Okhotin) Conjunctive grammars over a unary alphabet: undecidability and unbounded growth, CSR 2007 (TR) (Best paper in Theory Track award)
full version: Theory of Computing Systems, 46:1 27-58 (2010)
Conjunctive grammars can generate non-regular unary languages, DLT 2007 (.ps, .pdf)
full version: International Journal of Foundations of Computer Science 19(3): 597-615 (2008)
Presentations
Equations over sets of integers, STACS 2010(.pdf)
DFA hyper-minimisation, MFCS 2009(.pdf)
Computational completeness of equations over sets of natural numbers, ICALP 2008 (.pdf)
Equations in sets of natural numbers, Brno 22 V 2008(.pdf)
Równania nad zbiorami liczb naturalnych, FIT 2008 (.pdf)
Equations in sets of natural numbers, Turku 13 XII 2007(.pdf)
Conjunctive grammars over a unary alphabet: undecidability and unbounded growth, CSR 2007 (.pdf)
Conjunctive grammars can generate non-regular unary languages, DLT 2007 (.pdf)