Conjunctive Grammars Can Generate Non-regular Unary Languages. - Artur Jez (Developments in Language Theory, 2007)

Complexity of solutions of equations over sets of natural numbers. - Alexander Okhotin; Artur Jez (STACS, 2008)

Generalized Whac-a-Mole - Marcin Bienkowski; Marek Chrobak; Christoph Dürr; Mathilde Hurand; Artur Jez; Lukasz Jez; Jakub Lopuszanski; Grzegorz Stachowiak (CoRR, 2008)

Graphical complexity of products of permutation groups. - Mariusz Grech; Artur Jez; Andrzej Kisielewicz 001 (Discret. Math., 2008)

Conjunctive Grammars Generate Non-Regular Unary Languages. - Artur Jez (Int. J. Found. Comput. Sci., 2008)

Hyper-minimisation Made Efficient. - Pawel Gawrychowski; Artur Jez (MFCS, 2009)

Equations over Sets of Natural Numbers with Addition Only. - Artur Jez; Alexander Okhotin (STACS, 2009)

Optimal, online validation of the pi and pi' failure functions - Pawel Gawrychowski; Artur Jez; Lukasz Jez (CoRR, 2009)

On the two-dimensional cow search problem. - Artur Jez; Jakub Lopuszanski (Inf. Process. Lett., 2009)

On Equations over Sets of Integers. - Artur Jez; Alexander Okhotin (STACS, 2010)

Univariate Equations Over Sets of Natural Numbers. - Artur Jez; Alexander Okhotin (Fundam. Informaticae, 2010)

Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth. - Artur Jez; Alexander Okhotin (Theory Comput. Syst., 2010)

On Minimising Automata with Errors. - Pawel Gawrychowski; Artur Jez; Andreas Maletti (MFCS, 2011)

Computing All ℓ-Cover Automata Fast. - Artur Jez; Andreas Maletti (CIAA, 2011)

Length-reducing Automata (almost) without Auxiliary Symbols. - Artur Jez; Tomasz Jurdzinski (J. Autom. Lang. Comb., 2011)

Complexity of Equations over Sets of Natural Numbers. - Artur Jez; Alexander Okhotin (Theory Comput. Syst., 2011)

One-Nonterminal Conjunctive Grammars over a Unary Alphabet. - Artur Jez; Alexander Okhotin (Theory Comput. Syst., 2011)

Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P). - Artur Jez (STACS, 2012)

Representing Hyper-arithmetical Sets by Equations over Sets of Integers. - Artur Jez; Alexander Okhotin (Theory Comput. Syst., 2012)

Recompression: Word Equations and Beyond. - Artur Jez (Developments in Language Theory, 2013)

Unambiguous Conjunctive Grammars over a One-Letter Alphabet. - Artur Jez; Alexander Okhotin (Developments in Language Theory, 2013)

Collecting Weighted Items from a Dynamic Queue. - Marcin Bienkowski; Marek Chrobak; Christoph Dürr; Mathilde Hurand; Artur Jez; Lukasz Jez; Grzegorz Stachowiak (Algorithmica, 2013)

Hyper-Minimization for Deterministic Tree Automata. - Artur Jez; Andreas Maletti (Int. J. Found. Comput. Sci., 2013)

A ϕ-competitive algorithm for collecting items with increasing weights from a dynamic queue. - Marcin Bienkowski; Marek Chrobak; Christoph Dürr; Mathilde Hurand; Artur Jez; Lukasz Jez; Grzegorz Stachowiak (Theor. Comput. Sci., 2013)

Context Unification is in PSPACE. - Artur Jez (ICALP (2), 2014)

Computational completeness of equations over sets of natural numbers. - Artur Jez; Alexander Okhotin (Inf. Comput., 2014)

Validating the Knuth-Morris-Pratt Failure Function, Fast and Online. - Pawel Gawrychowski; Artur Jez; Lukasz Jez (Theory Comput. Syst., 2014)

The Complexity of Compressed Membership Problems for Finite Automata. - Artur Jez (Theory Comput. Syst., 2014)

Faster Fully Compressed Pattern Matching by Recompression. - Artur Jez (ACM Trans. Algorithms, 2015)

Approximation of grammar-based compression via recompression. - Artur Jez (Theor. Comput. Sci., 2015)

LZ77 Factorisation of Trees. - Pawel Gawrychowski; Artur Jez (FSTTCS, 2016)

Solutions of Word Equations Over Partially Commutative Structures. - Volker Diekert; Artur Jez; Manfred Kufleitner (ICALP, 2016)

One-Variable Word Equations in Linear Time. - Artur Jez (Algorithmica, 2016)

Finding all solutions of equations in free groups and monoids with involution. - Volker Diekert; Artur Jez; Wojciech Plandowski (Inf. Comput., 2016)

Approximation of smallest linear tree grammar. - Artur Jez; Markus Lohrey (Inf. Comput., 2016)

Recompression: A Simple and Powerful Technique for Word Equations. - Artur Jez (J. ACM, 2016)

Equations over sets of integers with addition only. - Artur Jez; Alexander Okhotin (J. Comput. Syst. Sci., 2016)

A really simple approximation of smallest grammar. - Artur Jez (Theor. Comput. Sci., 2016)

Least and greatest solutions of equations over sets of integers. - Artur Jez; Alexander Okhotin (Theor. Comput. Sci., 2016)

Recompression of SLPs. - Artur Jez (CPM, 2017)

Improvements on Re-Pair Grammar Compressor. - Michal Ganczorz; Artur Jez (DCC, 2017)

Word Equations in Nondeterministic Linear Space. - Artur Jez (ICALP, 2017)

Recompression: New Approach to Word Equations and Context Unification (Invited Talk). - Artur Jez (STACS, 2017)

Approximation ratio of RePair. - Danny Hucke; Artur Jez; Markus Lohrey (CoRR, 2017)

Word equations in linear space. - Artur Jez (CoRR, 2017)

Constructing small tree grammars and small circuits for formulas. - Moses Ganardi; Danny Hucke; Artur Jez; Markus Lohrey; Eric Noeth (J. Comput. Syst. Sci., 2017)

Unambiguous conjunctive grammars over a one-symbol alphabet. - Artur Jez; Alexander Okhotin (Theor. Comput. Sci., 2017)

Edit Distance with Block Operations. - Michal Ganczorz; Pawel Gawrychowski; Artur Jez; Tomasz Kociumaka (ESA, 2018)

Sliding Windows over Context-Free Languages. - Moses Ganardi; Artur Jez; Markus Lohrey (MFCS, 2018)

On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars. - Artur Jez; Alexander Okhotin (Fundam. Informaticae, 2018)

Deciding Context Unification (with Regular Constraints). - Artur Jez (DLT, 2019)

Deciding Context Unification. - Artur Jez (J. ACM, 2019)

Solving Word Equations (And Other Unification Problems) by Recompression (Invited Talk). - Artur Jez (CSL, 2020)

Recompression: Technique for Word Equations and Compressed Data. - Artur Jez (LATA, 2020)

Solving One Variable Word Equations in the Free Group in Cubic Time. - Robert Ferens; Artur Jez (STACS, 2021)

Balancing Straight-line Programs. - Moses Ganardi; Artur Jez; Markus Lohrey (J. ACM, 2021)

The Smallest Grammar Problem Revisited. - Hideo Bannai; Momoko Hirayama; Danny Hucke; Shunsuke Inenaga; Artur Jez; Markus Lohrey; Carl Philipp Reh (IEEE Trans. Inf. Theory, 2021)

Data Path Queries over Embedded Graph Databases. - Diego Figueira; Artur Jez; Anthony W. Lin (PODS, 2022)

Space-efficient conversions from SLPs. - Travis Gagie; Artur Jez; Gonzalo Navarro 001 (CoRR, 2022)

Word equations in non-deterministic linear space. - Artur Jez (J. Comput. Syst. Sci., 2022)

Decision Procedures for Sequence Theories. - Artur Jez; Anthony W. Lin; Oliver Markgraf; Philipp Rümmer (CAV (2), 2023)

Decision Procedures for Sequence Theories (Technical Report). - Artur Jez; Anthony W. Lin; Oliver Markgraf; Philipp Rümmer (CoRR, 2023)

Space-Efficient Conversions from SLPs. - Travis Gagie; Adrián Goga; Artur Jez; Gonzalo Navarro 001 (LATIN (1), 2024)

Parikh's Theorem Made Symbolic. - Matthew Hague; Artur Jez; Anthony W. Lin (Proc. ACM Program. Lang., 2024)

OSTRICH2: Solver for Complex String Constraints. - Matthew Hague; Denghang Hu; Artur Jez; Anthony W. Lin; Oliver Markgraf; Philipp Rümmer; Zhilin Wu (CoRR, 2025)