Artur Jez

According to our database, Artur Jez authored at least 66 papers between 2007 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

The Power of Regular Constraint Propagation (Technical Report).

Matthew Hague, Artur Jez, Anthony W. Lin, Oliver Markgraf, Philipp Rümmer

CoRR, August, 2025

OSTRICH2: Solver for Complex String Constraints.

Matthew Hague, Denghang Hu, Artur Jez, Anthony W. Lin, Oliver Markgraf, Philipp Rümmer, Zhilin Wu

CoRR, June, 2025

2024

Parikh's Theorem Made Symbolic.

Matthew Hague, Artur Jez, Anthony W. Lin

Proc. ACM Program. Lang., January, 2024

Space-Efficient Conversions from SLPs.

Travis Gagie, Adrián Goga, Artur Jez, Gonzalo Navarro

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023

Decision Procedures for Sequence Theories (Technical Report).

Artur Jez, Anthony W. Lin, Oliver Markgraf, Philipp Rümmer

CoRR, 2023

Decision Procedures for Sequence Theories.

Artur Jez, Anthony W. Lin, Oliver Markgraf, Philipp Rümmer

Proceedings of the Computer Aided Verification - 35th International Conference, 2023

2022

Word equations in non-deterministic linear space.

Artur Jez

J. Comput. Syst. Sci., 2022

Space-efficient conversions from SLPs.

Travis Gagie, Artur Jez, Gonzalo Navarro

CoRR, 2022

Data Path Queries over Embedded Graph Databases.

Diego Figueira, Artur Jez, Anthony W. Lin

Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

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

Solving One Variable Word Equations in the Free Group in Cubic Time.

Robert Ferens, Artur Jez

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

2020

Recompression: Technique for Word Equations and Compressed Data.

Artur Jez

Proceedings of the Language and Automata Theory and Applications, 2020

Solving Word Equations (And Other Unification Problems) by Recompression (Invited Talk).

Artur Jez

Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

2019

Deciding Context Unification.

Artur Jez

J. ACM, 2019

Balancing Straight-Line Programs.

Moses Ganardi, Artur Jez, Markus Lohrey

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Deciding Context Unification (with Regular Constraints).

Artur Jez

Proceedings of the Developments in Language Theory - 23rd International Conference, 2019

2018

Sliding Windows over Context-Free Languages.

Moses Ganardi, Artur Jez, Markus Lohrey

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Edit Distance with Block Operations.

Michal Ganczorz, Pawel Gawrychowski, Artur Jez, Tomasz Kociumaka

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Unambiguous conjunctive grammars over a one-symbol alphabet.

Artur Jez, Alexander Okhotin

Theor. Comput. Sci., 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

Word equations in linear space.

Artur Jez

CoRR, 2017

Approximation ratio of RePair.

Danny Hucke, Artur Jez, Markus Lohrey

CoRR, 2017

Recompression: New Approach to Word Equations and Context Unification (Invited Talk).

Artur Jez

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Word Equations in Nondeterministic Linear Space.

Artur Jez

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Improvements on Re-Pair Grammar Compressor.

Michal Ganczorz, Artur Jez

Proceedings of the 2017 Data Compression Conference, 2017

Recompression of SLPs.

Artur Jez

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016

Equations over sets of integers with addition only.

Artur Jez, Alexander Okhotin

J. Comput. Syst. Sci., 2016

Solutions of Word Equations Over Partially Commutative Structures.

Volker Diekert, Artur Jez, Manfred Kufleitner

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

LZ77 Factorisation of Trees.

Pawel Gawrychowski, Artur Jez

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2014

The Complexity of Compressed Membership Problems for Finite Automata.

Artur Jez

Theory Comput. Syst., 2014

Approximation of smallest linear tree grammar.

Artur Jez, Markus Lohrey

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Context Unification is in PSPACE.

Artur Jez

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Finding All Solutions of Equations in Free Groups and Monoids with Involution.

Volker Diekert, Artur Jez, Wojciech Plandowski

Proceedings of the Computer Science - Theory and Applications, 2014

A really Simple Approximation of Smallest Grammar.

Artur Jez

Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013

A <i>ϕ</i>-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

Recompression: a simple and powerful technique for word equations.

Artur Jez

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

One-Variable Word Equations in Linear Time.

Artur Jez

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Unambiguous Conjunctive Grammars over a One-Letter Alphabet.

Artur Jez, Alexander Okhotin

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Recompression: Word Equations and Beyond.

Artur Jez

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Approximation of Grammar-Based Compression via Recompression.

Artur Jez

Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

2012

Representing Hyper-arithmetical Sets by Equations over Sets of Integers.

Artur Jez, Alexander Okhotin

Theory Comput. Syst., 2012

Hyper-minimization for Deterministic Tree Automata.

Artur Jez, Andreas Maletti

Proceedings of the Implementation and Application of Automata, 2012

Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P).

Artur Jez

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Faster Fully Compressed Pattern Matching by Recompression.

Artur Jez

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars.

Artur Jez, Alexander Okhotin

Proceedings of the Descriptional Complexity of Formal Systems, 2012

2011

Complexity of Equations over Sets of Natural Numbers.

Artur Jez, Alexander Okhotin

Theory Comput. Syst., 2011

Length-reducing Automata (almost) without Auxiliary Symbols.

Artur Jez, Tomasz Jurdzinski

J. Autom. Lang. Comb., 2011

Computing All ℓ-Cover Automata Fast.

Artur Jez, Andreas Maletti

Proceedings of the Implementation and Application of Automata, 2011

On Minimising Automata with Errors.

Pawel Gawrychowski, Artur Jez, Andreas Maletti

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

2010

Univariate Equations Over Sets of Natural Numbers.

Artur Jez, Alexander Okhotin

Fundam. Informaticae, 2010

On Equations over Sets of Integers.

Artur Jez, Alexander Okhotin

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Least and Greatest Solutions of Equations over Sets of Integers.

Artur Jez, Alexander Okhotin

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Validating the Knuth-Morris-Pratt Failure Function, Fast and Online.

Pawel Gawrychowski, Artur Jez, Lukasz Jez

Proceedings of the Computer Science, 2010

2009

On the two-dimensional cow search problem.

Artur Jez, Jakub Lopuszanski

Inf. Process. Lett., 2009

Optimal, online validation of the pi and pi' failure functions

Pawel Gawrychowski, Artur Jez, Lukasz Jez

CoRR, 2009

Equations over Sets of Natural Numbers with Addition Only.

Artur Jez, Alexander Okhotin

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Collecting weighted items from a dynamic queue.

Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Grzegorz Stachowiak

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Hyper-minimisation Made Efficient.

Pawel Gawrychowski, Artur Jez

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

One-Nonterminal Conjunctive Grammars over a Unary Alphabet.

Artur Jez, Alexander Okhotin

Proceedings of the Computer Science, 2009

2008

Conjunctive Grammars Generate Non-Regular Unary Languages.

Artur Jez

Int. J. Found. Comput. Sci., 2008

Graphical complexity of products of permutation groups.

Mariusz Grech, Artur Jez, Andrzej Kisielewicz

Discret. Math., 2008

Generalized Whac-a-Mole

Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Jakub Lopuszanski, Grzegorz Stachowiak

CoRR, 2008

Complexity of solutions of equations over sets of natural numbers.

Alexander Okhotin, Artur Jez

Proceedings of the STACS 2008, 2008

On the Computational Completeness of Equations over Sets of Natural Numbers.

Artur Jez, Alexander Okhotin

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Conjunctive Grammars Can Generate Non-regular Unary Languages.

Artur Jez

Proceedings of the Developments in Language Theory, 11th International Conference, 2007

Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth.

Artur Jez, Alexander Okhotin

Proceedings of the Computer Science, 2007