Artur Jez - RankMe

101 papers A* 5A 9B 11C 7Misc 4Journal 57Unranked 8

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