Follow
Artur Jeż
Artur Jeż
Verified email at cs.uni.wroc.pl - Homepage
Title
Cited by
Cited by
Year
Recompression: a simple and powerful technique for word equations
A Jeż
Journal of the ACM (JACM) 63 (1), 1-51, 2016
1062016
Faster fully compressed pattern matching by recompression
A Jeż
ACM Transactions on Algorithms (TALG) 11 (3), 1-43, 2015
792015
Approximation of grammar-based compression via recompression
A Jeż
Theoretical Computer Science 592, 115-134, 2015
772015
A really simple approximation of smallest grammar
A Jeż
Theoretical Computer Science 616, 141-150, 2016
682016
Conjunctive grammars over a unary alphabet: undecidability and unbounded growth
A Jeż, A Okhotin
Theory of Computing Systems 46 (1), 27-58, 2010
622010
Conjunctive grammars generate non-regular unary languages
A Jeż
International Journal of Foundations of Computer Science 19 (03), 597-615, 2008
582008
Finding all solutions of equations in free groups and monoids with involution
V Diekert, A Jeż, W Plandowski
Information and Computation 251, 263-286, 2016
482016
On the computational completeness of equations over sets of natural numbers
A Jeż, A Okhotin
International Colloquium on Automata, Languages, and Programming, 63-74, 2008
38*2008
Context unification is in PSPACE
A Jeż
International Colloquium on Automata, Languages, and Programming, 244-255, 2014
372014
Approximation of smallest linear tree grammar
A Jeż, M Lohrey
Information and Computation 251, 215-251, 2016
362016
On the two-dimensional cow search problem
A Jeż, J Łopuszański
Information Processing Letters 109 (11), 543-547, 2009
342009
Balancing straight-line programs
M Ganardi, A Jeż, M Lohrey
Journal of the ACM (JACM) 68 (4), 1-40, 2021
302021
One-variable word equations in linear time
A Jeż
Algorithmica 74 (1), 1-48, 2016
302016
Hyper-minimisation made efficient
P Gawrychowski, A Jeż
International Symposium on Mathematical Foundations of Computer Science, 356-368, 2009
302009
One-nonterminal conjunctive grammars over a unary alphabet
A Jeż, A Okhotin
Theory of Computing Systems 49 (2), 319-342, 2011
272011
Complexity of equations over sets of natural numbers
A Jeż, A Okhotin
Theory of Computing Systems 48 (2), 319-342, 2011
272011
Word equations in non-deterministic linear space
A Jeż
Journal of Computer and System Sciences 123, 122-142, 2022
262022
Constructing small tree grammars and small circuits for formulas
M Ganardi, D Hucke, A Jeż, M Lohrey, E Noeth
Journal of Computer and System Sciences 86, 136-158, 2017
262017
Validating the Knuth-Morris-Pratt failure function, fast and online
P Gawrychowski, A Jeż, Ł Jeż
Theory of Computing Systems 54 (2), 337-372, 2014
232014
Improvements on Re-Pair grammar compressor
M Gańczorz, A Jeż
2017 Data Compression Conference (DCC), 181-190, 2017
182017
The system can't perform the operation now. Try again later.
Articles 1–20