Artur Jez

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 42

Top Topics

Compressed Pattern Matching

Decision Procedures

Top Venues

Theor. Comput. Sci.

J. Comput. Syst. Sci.

Publications

Matthew Hague, Artur Jez, Anthony W. Lin
Parikh's Theorem Made Symbolic. Proc. ACM Program. Lang. 8 (POPL) (2024)
Travis Gagie, Adrián Goga, Artur Jez, Gonzalo Navarro
Space-Efficient Conversions from SLPs. LATIN (1) (2024)
Artur Jez, Anthony W. Lin, Oliver Markgraf, Philipp Rümmer
Decision Procedures for Sequence Theories (Technical Report). CoRR (2023)
Matthew Hague, Artur Jez, Anthony W. Lin
Parikh's Theorem Made Symbolic. CoRR (2023)
Artur Jez, Anthony W. Lin, Oliver Markgraf, Philipp Rümmer
Decision Procedures for Sequence Theories. CAV (2) (2023)
Diego Figueira, Artur Jez, Anthony W. Lin
Data Path Queries over Embedded Graph Databases. PODS (2022)
Artur Jez
Word equations in non-deterministic linear space. J. Comput. Syst. Sci. 123 (2022)
Travis Gagie, Artur Jez, Gonzalo Navarro
Space-efficient conversions from SLPs. CoRR (2022)
Moses Ganardi, Artur Jez, Markus Lohrey
Balancing Straight-line Programs. J. ACM 68 (4) (2021)
Robert Ferens, Artur Jez
Solving one variable word equations in the free group in cubic time. CoRR (2021)
Robert Ferens, Artur Jez
Solving One Variable Word Equations in the Free Group in Cubic Time. STACS (2021)
Hideo Bannai, Momoko Hirayama, Danny Hucke, Shunsuke Inenaga, Artur Jez, Markus Lohrey, Carl Philipp Reh
The Smallest Grammar Problem Revisited. IEEE Trans. Inf. Theory 67 (1) (2021)
Artur Jez
Solving Word Equations (And Other Unification Problems) by Recompression (Invited Talk). CSL (2020)
Artur Jez
Recompression: Technique for Word Equations and Compressed Data. LATA (2020)
Hideo Bannai, Momoko Hirayama, Danny Hucke, Shunsuke Inenaga, Artur Jez, Markus Lohrey, Carl Philipp Reh
The smallest grammar problem revisited. CoRR (2019)
Moses Ganardi, Artur Jez, Markus Lohrey
Balancing Straight-Line Programs. FOCS (2019)
Artur Jez
Deciding Context Unification. J. ACM 66 (6) (2019)
Moses Ganardi, Artur Jez, Markus Lohrey
Balancing Straight-Line Programs. CoRR (2019)
Artur Jez
Deciding Context Unification (with Regular Constraints). DLT (2019)
Artur Jez, Alexander Okhotin
On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars. Fundam. Informaticae 162 (1) (2018)
Michal Ganczorz, Pawel Gawrychowski, Artur Jez, Tomasz Kociumaka
Edit Distance with Block Operations. ESA (2018)
Moses Ganardi, Artur Jez, Markus Lohrey
Sliding Windows over Context-Free Languages. MFCS (2018)
Michal Ganczorz, Artur Jez
Improvements on Re-Pair Grammar Compressor. DCC (2017)
Artur Jez, Alexander Okhotin
Unambiguous conjunctive grammars over a one-symbol alphabet. Theor. Comput. Sci. 665 (2017)
Artur Jez
Recompression of SLPs. CPM (2017)
Danny Hucke, Artur Jez, Markus Lohrey
Approximation ratio of RePair. CoRR (2017)
Artur Jez
Word equations in linear space. CoRR (2017)
Artur Jez
Word Equations in Nondeterministic Linear Space. ICALP (2017)
Artur Jez
Recompression: New Approach to Word Equations and Context Unification (Invited Talk). STACS (2017)
Moses Ganardi, Danny Hucke, Artur Jez, Markus Lohrey, Eric Noeth
Constructing small tree grammars and small circuits for formulas. J. Comput. Syst. Sci. 86 (2017)
Artur Jez
Recompression: A Simple and Powerful Technique for Word Equations. J. ACM 63 (1) (2016)
Artur Jez, Markus Lohrey
Approximation of smallest linear tree grammar. Inf. Comput. 251 (2016)
Artur Jez
A really simple approximation of smallest grammar. Theor. Comput. Sci. 616 (2016)
Volker Diekert, Artur Jez, Manfred Kufleitner
Solutions of Word Equations Over Partially Commutative Structures. ICALP (2016)
Artur Jez
One-Variable Word Equations in Linear Time. Algorithmica 74 (1) (2016)
Artur Jez, Alexander Okhotin
Equations over sets of integers with addition only. J. Comput. Syst. Sci. 82 (6) (2016)
Volker Diekert, Artur Jez, Manfred Kufleitner
Solutions of Word Equations over Partially Commutative Structures. CoRR (2016)
Volker Diekert, Artur Jez, Wojciech Plandowski
Finding all solutions of equations in free groups and monoids with involution. Inf. Comput. 251 (2016)
Pawel Gawrychowski, Artur Jez
LZ77 Factorisation of Trees. FSTTCS (2016)
Artur Jez, Alexander Okhotin
Least and greatest solutions of equations over sets of integers. Theor. Comput. Sci. 619 (2016)
Artur Jez
Approximation of grammar-based compression via recompression. Theor. Comput. Sci. 592 (2015)
Artur Jez
Faster Fully Compressed Pattern Matching by Recompression. ACM Trans. Algorithms 11 (3) (2015)
Pawel Gawrychowski, Artur Jez, Lukasz Jez
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online. Theory Comput. Syst. 54 (2) (2014)
Volker Diekert, Artur Jez, Wojciech Plandowski
Finding All Solutions of Equations in Free Groups and Monoids with Involution. CSR (2014)
Artur Jez
A really simple approximation of smallest grammar. CoRR (2014)
Volker Diekert, Artur Jez, Wojciech Plandowski
Finding All Solutions of Equations in Free Groups and Monoids with Involution. CoRR (2014)
Artur Jez
The Complexity of Compressed Membership Problems for Finite Automata. Theory Comput. Syst. 55 (4) (2014)
Artur Jez, Markus Lohrey
Approximation of smallest linear tree grammar. STACS (2014)
Artur Jez
A really Simple Approximation of Smallest Grammar. CPM (2014)
Artur Jez
Context Unification is in PSPACE. ICALP (2) (2014)
Artur Jez, Alexander Okhotin
Computational completeness of equations over sets of natural numbers. Inf. Comput. 237 (2014)
Artur Jez
Approximation of Grammar-Based Compression via Recompression. CPM (2013)
Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Grzegorz Stachowiak
-competitive algorithm for collecting items with increasing weights from a dynamic queue. Theor. Comput. Sci. 475 (2013)
Artur Jez
One-variable word equations in linear time CoRR (2013)
Artur Jez
Recompression: a simple and powerful technique for word equations. STACS (2013)
Artur Jez
Context unification is in PSPACE. CoRR (2013)
Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Grzegorz Stachowiak
Collecting Weighted Items from a Dynamic Queue. Algorithmica 65 (1) (2013)
Artur Jez
One-Variable Word Equations in Linear Time. ICALP (2) (2013)
Artur Jez, Markus Lohrey
Approximation of smallest linear tree grammar. CoRR (2013)
Artur Jez, Alexander Okhotin
Unambiguous Conjunctive Grammars over a One-Letter Alphabet. Developments in Language Theory (2013)
Artur Jez
Recompression: Word Equations and Beyond. Developments in Language Theory (2013)
Artur Jez
Approximation of grammar-based compression via recompression CoRR (2013)
Artur Jez, Andreas Maletti
Hyper-Minimization for Deterministic Tree Automata. Int. J. Found. Comput. Sci. 24 (6) (2013)
Artur Jez
Faster Fully Compressed Pattern Matching by Recompression. ICALP (1) (2012)
Artur Jez, Alexander Okhotin
Representing Hyper-arithmetical Sets by Equations over Sets of Integers. Theory Comput. Syst. 51 (2) (2012)
Artur Jez
Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P). STACS (2012)
Artur Jez
Recompression: a simple and powerful technique for word equations CoRR (2012)
Artur Jez, Alexander Okhotin
On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars. DCFS (2012)
Artur Jez, Andreas Maletti
Hyper-minimization for Deterministic Tree Automata. CIAA (2012)
Artur Jez, Andreas Maletti
Computing All ℓ-Cover Automata Fast. CIAA (2011)
Artur Jez
Faster fully compressed pattern matching by recompression CoRR (2011)
Artur Jez, Alexander Okhotin
Complexity of Equations over Sets of Natural Numbers. Theory Comput. Syst. 48 (2) (2011)
Pawel Gawrychowski, Artur Jez, Andreas Maletti
On minimising automata with errors CoRR (2011)
Pawel Gawrychowski, Artur Jez, Andreas Maletti
On Minimising Automata with Errors. MFCS (2011)
Artur Jez, Tomasz Jurdzinski
Length-reducing Automata (almost) without Auxiliary Symbols. J. Autom. Lang. Comb. 16 (2-4) (2011)
Artur Jez, Alexander Okhotin
One-Nonterminal Conjunctive Grammars over a Unary Alphabet. Theory Comput. Syst. 49 (2) (2011)
Artur Jez
Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P) CoRR (2011)
Artur Jez, Alexander Okhotin
On Equations over Sets of Integers. STACS (2010)
Artur Jez, Alexander Okhotin
On equations over sets of integers CoRR (2010)
Artur Jez, Alexander Okhotin
Univariate Equations Over Sets of Natural Numbers. Fundam. Informaticae 104 (4) (2010)
Artur Jez, Alexander Okhotin
Least and Greatest Solutions of Equations over Sets of Integers. MFCS (2010)
Artur Jez, Alexander Okhotin
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth. Theory Comput. Syst. 46 (1) (2010)
Pawel Gawrychowski, Artur Jez, Lukasz Jez
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online. CSR (2010)
Pawel Gawrychowski, Artur Jez, Lukasz Jez
Optimal, online validation of the pi and pi' failure functions CoRR (2009)
Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Grzegorz Stachowiak
Collecting weighted items from a dynamic queue. SODA (2009)
Artur Jez, Jakub Lopuszanski
On the two-dimensional cow search problem. Inf. Process. Lett. 109 (11) (2009)
Artur Jez, Alexander Okhotin
Equations over Sets of Natural Numbers with Addition Only. STACS (2009)
Artur Jez, Alexander Okhotin
One-Nonterminal Conjunctive Grammars over a Unary Alphabet. CSR (2009)
Pawel Gawrychowski, Artur Jez
Hyper-minimisation Made Efficient. MFCS (2009)
Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Jakub Lopuszanski, Grzegorz Stachowiak
Generalized Whac-a-Mole CoRR (2008)
Artur Jez, Alexander Okhotin
On the Computational Completeness of Equations over Sets of Natural Numbers. ICALP (2) (2008)
Alexander Okhotin, Artur Jez
Complexity of solutions of equations over sets of natural numbers. STACS (2008)
Mariusz Grech, Artur Jez, Andrzej Kisielewicz
Graphical complexity of products of permutation groups. Discret. Math. 308 (7) (2008)
Artur Jez
Conjunctive Grammars Generate Non-Regular Unary Languages. Int. J. Found. Comput. Sci. 19 (3) (2008)
Artur Jez, Alexander Okhotin
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth. CSR (2007)
Artur Jez
Conjunctive Grammars Can Generate Non-regular Unary Languages. Developments in Language Theory (2007)