Skip to content

Artur Jez

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

39

Venues

16

Active years

2007–2025

Best venue rank

A*

Where they publish

Papers

39 indexed papers, newest first.

YearVenueTitleAuthors
2025FMCADOSTRICH2: Solver for Complex String Constraints.Matthew Hague, Denghang Hu, Artur Jez, Anthony W. Lin, Oliver Markgraf, Philipp Rmmer, Zhilin Wu
2024LATINSpace-Efficient Conversions from SLPs.Travis Gagie, Adrin Goga, Artur Jez, Gonzalo Navarro
2023CAVDecision Procedures for Sequence Theories.Artur Jez, Anthony W. Lin, Oliver Markgraf, Philipp Rmmer
2022PODSData Path Queries over Embedded Graph Databases.Diego Figueira, Artur Jez, Anthony W. Lin
2021STACSSolving One Variable Word Equations in the Free Group in Cubic Time.Robert Ferens, Artur Jez
2020CSLSolving Word Equations (And Other Unification Problems) by Recompression (Invited Talk).Artur Jez
2020LATARecompression: Technique for Word Equations and Compressed Data.Artur Jez
2019DLTDeciding Context Unification (with Regular Constraints).Artur Jez
2019FOCSBalancing Straight-Line Programs.Moses Ganardi, Artur Jez, Markus Lohrey
2018ESAEdit Distance with Block Operations.Michal Ganczorz, Pawel Gawrychowski, Artur Jez, Tomasz Kociumaka
2018MFCSSliding Windows over Context-Free Languages.Moses Ganardi, Artur Jez, Markus Lohrey
2017CPMRecompression of SLPs.Artur Jez
2017DCCImprovements on Re-Pair Grammar Compressor.Michal Ganczorz, Artur Jez
2017ICALPWord Equations in Nondeterministic Linear Space.Artur Jez
2017STACSRecompression: New Approach to Word Equations and Context Unification (Invited Talk).Artur Jez
2016ICALPSolutions of Word Equations Over Partially Commutative Structures.Volker Diekert, Artur Jez, Manfred Kufleitner
2014CPMA really Simple Approximation of Smallest Grammar.Artur Jez
2014CSRFinding All Solutions of Equations in Free Groups and Monoids with Involution.Volker Diekert, Artur Jez, Wojciech Plandowski
2014ICALPContext Unification is in PSPACE.Artur Jez
2014STACSApproximation of smallest linear tree grammar.Artur Jez, Markus Lohrey
2013CPMApproximation of Grammar-Based Compression via Recompression.Artur Jez
2013DLTRecompression: Word Equations and Beyond.Artur Jez
2013DLTUnambiguous Conjunctive Grammars over a One-Letter Alphabet.Artur Jez, Alexander Okhotin
2013ICALPOne-Variable Word Equations in Linear Time.Artur Jez
2013STACSRecompression: a simple and powerful technique for word equations.Artur Jez
2012ICALPFaster Fully Compressed Pattern Matching by Recompression.Artur Jez
2012STACSCompressed Membership for NFA (DFA) with Compressed Labels is in NP (P).Artur Jez
2011MFCSOn Minimising Automata with Errors.Pawel Gawrychowski, Artur Jez, Andreas Maletti
2010CSRValidating the Knuth-Morris-Pratt Failure Function, Fast and Online.Pawel Gawrychowski, Artur Jez, Lukasz Jez
2010MFCSLeast and Greatest Solutions of Equations over Sets of Integers.Artur Jez, Alexander Okhotin
2010STACSOn Equations over Sets of Integers.Artur Jez, Alexander Okhotin
2009CSROne-Nonterminal Conjunctive Grammars over a Unary Alphabet.Artur Jez, Alexander Okhotin
2009MFCSHyper-minimisation Made Efficient.Pawel Gawrychowski, Artur Jez
2009SODACollecting weighted items from a dynamic queue.Marcin Bienkowski, Marek Chrobak, Christoph Drr, Mathilde Hurand, Artur Jez, Lukasz Jez, Grzegorz Stachowiak
2009STACSEquations over Sets of Natural Numbers with Addition Only.Artur Jez, Alexander Okhotin
2008ICALPOn the Computational Completeness of Equations over Sets of Natural Numbers.Artur Jez, Alexander Okhotin
2008STACSComplexity of solutions of equations over sets of natural numbers.Alexander Okhotin, Artur Jez
2007CSRConjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth.Artur Jez, Alexander Okhotin
2007DLTConjunctive Grammars Can Generate Non-regular Unary Languages.Artur Jez