default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArtur Jez
Person information
- affiliation: University of Wroclaw, Poland
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j32]Matthew Hague
, Artur Jez, Anthony W. Lin:
Parikh's Theorem Made Symbolic. Proc. ACM Program. Lang. 8(POPL): 1945-1977 (2024)- [c42]Travis Gagie, Adrián Goga, Artur Jez, Gonzalo Navarro:
Space-Efficient Conversions from SLPs. LATIN (1) 2024: 146-161 - 2023
- [c41]Artur Jez, Anthony W. Lin, Oliver Markgraf, Philipp Rümmer:
Decision Procedures for Sequence Theories. CAV (2) 2023: 18-40 - [i22]Artur Jez, Anthony W. Lin, Oliver Markgraf, Philipp Rümmer:
Decision Procedures for Sequence Theories (Technical Report). CoRR abs/2308.00175 (2023) - [i21]Matthew Hague, Artur Jez, Anthony W. Lin:
Parikh's Theorem Made Symbolic. CoRR abs/2311.03901 (2023) - 2022
- [j31]Artur Jez:
Word equations in non-deterministic linear space. J. Comput. Syst. Sci. 123: 122-142 (2022) - [c40]Diego Figueira, Artur Jez, Anthony W. Lin:
Data Path Queries over Embedded Graph Databases. PODS 2022: 189-201 - [i20]Travis Gagie, Artur Jez, Gonzalo Navarro:
Space-efficient conversions from SLPs. CoRR abs/2212.02327 (2022) - 2021
- [j30]Moses Ganardi, Artur Jez, Markus Lohrey:
Balancing Straight-line Programs. J. ACM 68(4): 27:1-27:40 (2021) - [j29]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): 317-328 (2021) - [c39]Robert Ferens, Artur Jez:
Solving One Variable Word Equations in the Free Group in Cubic Time. STACS 2021: 30:1-30:17 - [i19]Robert Ferens, Artur Jez:
Solving one variable word equations in the free group in cubic time. CoRR abs/2101.06201 (2021) - 2020
- [c38]Artur Jez:
Solving Word Equations (And Other Unification Problems) by Recompression (Invited Talk). CSL 2020: 3:1-3:17 - [c37]Artur Jez:
Recompression: Technique for Word Equations and Compressed Data. LATA 2020: 44-67
2010 – 2019
- 2019
- [j28]Artur Jez:
Deciding Context Unification. J. ACM 66(6): 39:1-39:45 (2019) - [c36]Artur Jez:
Deciding Context Unification (with Regular Constraints). DLT 2019: 18-40 - [c35]Moses Ganardi, Artur Jez, Markus Lohrey:
Balancing Straight-Line Programs. FOCS 2019: 1169-1183 - [i18]Moses Ganardi, Artur Jez, Markus Lohrey:
Balancing Straight-Line Programs. CoRR abs/1902.03568 (2019) - [i17]Hideo Bannai, Momoko Hirayama, Danny Hucke, Shunsuke Inenaga, Artur Jez, Markus Lohrey, Carl Philipp Reh:
The smallest grammar problem revisited. CoRR abs/1908.06428 (2019) - 2018
- [j27]Artur Jez, Alexander Okhotin:
On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars. Fundam. Informaticae 162(1): 43-72 (2018) - [c34]Michal Ganczorz, Pawel Gawrychowski, Artur Jez, Tomasz Kociumaka:
Edit Distance with Block Operations. ESA 2018: 33:1-33:14 - [c33]Moses Ganardi, Artur Jez, Markus Lohrey:
Sliding Windows over Context-Free Languages. MFCS 2018: 15:1-15:15 - 2017
- [j26]Moses Ganardi, Danny Hucke, Artur Jez, Markus Lohrey, Eric Noeth:
Constructing small tree grammars and small circuits for formulas. J. Comput. Syst. Sci. 86: 136-158 (2017) - [j25]Artur Jez, Alexander Okhotin:
Unambiguous conjunctive grammars over a one-symbol alphabet. Theor. Comput. Sci. 665: 13-39 (2017) - [c32]Artur Jez:
Recompression of SLPs. CPM 2017: 2:1-2:1 - [c31]Michal Ganczorz, Artur Jez:
Improvements on Re-Pair Grammar Compressor. DCC 2017: 181-190 - [c30]Artur Jez:
Word Equations in Nondeterministic Linear Space. ICALP 2017: 95:1-95:13 - [c29]Artur Jez:
Recompression: New Approach to Word Equations and Context Unification (Invited Talk). STACS 2017: 2:1-2:3 - [i16]Artur Jez:
Word equations in linear space. CoRR abs/1702.00736 (2017) - [i15]Danny Hucke, Artur Jez, Markus Lohrey:
Approximation ratio of RePair. CoRR abs/1703.06061 (2017) - 2016
- [j24]Artur Jez:
One-Variable Word Equations in Linear Time. Algorithmica 74(1): 1-48 (2016) - [j23]Artur Jez, Markus Lohrey:
Approximation of smallest linear tree grammar. Inf. Comput. 251: 215-251 (2016) - [j22]Volker Diekert, Artur Jez, Wojciech Plandowski:
Finding all solutions of equations in free groups and monoids with involution. Inf. Comput. 251: 263-286 (2016) - [j21]Artur Jez:
Recompression: A Simple and Powerful Technique for Word Equations. J. ACM 63(1): 4:1-4:51 (2016) - [j20]Artur Jez, Alexander Okhotin:
Equations over sets of integers with addition only. J. Comput. Syst. Sci. 82(6): 1007-1019 (2016) - [j19]Artur Jez:
A really simple approximation of smallest grammar. Theor. Comput. Sci. 616: 141-150 (2016) - [j18]Artur Jez, Alexander Okhotin:
Least and greatest solutions of equations over sets of integers. Theor. Comput. Sci. 619: 68-86 (2016) - [c28]Pawel Gawrychowski, Artur Jez:
LZ77 Factorisation of Trees. FSTTCS 2016: 35:1-35:15 - [c27]Volker Diekert, Artur Jez, Manfred Kufleitner:
Solutions of Word Equations Over Partially Commutative Structures. ICALP 2016: 127:1-127:14 - [i14]Volker Diekert, Artur Jez, Manfred Kufleitner:
Solutions of Word Equations over Partially Commutative Structures. CoRR abs/1603.02966 (2016) - 2015
- [j17]Artur Jez:
Faster Fully Compressed Pattern Matching by Recompression. ACM Trans. Algorithms 11(3): 20:1-20:43 (2015) - [j16]Artur Jez:
Approximation of grammar-based compression via recompression. Theor. Comput. Sci. 592: 115-134 (2015) - 2014
- [j15]Artur Jez, Alexander Okhotin:
Computational completeness of equations over sets of natural numbers. Inf. Comput. 237: 56-94 (2014) - [j14]Pawel Gawrychowski, Artur Jez, Lukasz Jez:
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online. Theory Comput. Syst. 54(2): 337-372 (2014) - [j13]Artur Jez:
The Complexity of Compressed Membership Problems for Finite Automata. Theory Comput. Syst. 55(4): 685-718 (2014) - [c26]Artur Jez:
A really Simple Approximation of Smallest Grammar. CPM 2014: 182-191 - [c25]Volker Diekert, Artur Jez, Wojciech Plandowski:
Finding All Solutions of Equations in Free Groups and Monoids with Involution. CSR 2014: 1-15 - [c24]Artur Jez:
Context Unification is in PSPACE. ICALP (2) 2014: 244-255 - [c23]Artur Jez, Markus Lohrey:
Approximation of smallest linear tree grammar. STACS 2014: 445-457 - [i13]Artur Jez:
A really simple approximation of smallest grammar. CoRR abs/1403.4445 (2014) - [i12]Volker Diekert, Artur Jez, Wojciech Plandowski:
Finding All Solutions of Equations in Free Groups and Monoids with Involution. CoRR abs/1405.5133 (2014) - 2013
- [j12]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): 60-94 (2013) - [j11]Artur Jez, Andreas Maletti:
Hyper-Minimization for Deterministic Tree Automata. Int. J. Found. Comput. Sci. 24(6): 815-830 (2013) - [j10]Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Grzegorz Stachowiak:
A ϕ-competitive algorithm for collecting items with increasing weights from a dynamic queue. Theor. Comput. Sci. 475: 92-102 (2013) - [c22]Artur Jez:
Approximation of Grammar-Based Compression via Recompression. CPM 2013: 165-176 - [c21]Artur Jez:
Recompression: Word Equations and Beyond. Developments in Language Theory 2013: 12-26 - [c20]Artur Jez, Alexander Okhotin:
Unambiguous Conjunctive Grammars over a One-Letter Alphabet. Developments in Language Theory 2013: 277-288 - [c19]Artur Jez:
One-Variable Word Equations in Linear Time. ICALP (2) 2013: 324-335 - [c18]Artur Jez:
Recompression: a simple and powerful technique for word equations. STACS 2013: 233-244 - [i11]Artur Jez:
Approximation of grammar-based compression via recompression. CoRR abs/1301.5842 (2013) - [i10]Artur Jez:
One-variable word equations in linear time. CoRR abs/1302.3481 (2013) - [i9]Artur Jez, Markus Lohrey:
Approximation of smallest linear tree grammar. CoRR abs/1309.4958 (2013) - [i8]Artur Jez:
Context unification is in PSPACE. CoRR abs/1310.4367 (2013) - 2012
- [j9]Artur Jez, Alexander Okhotin:
Representing Hyper-arithmetical Sets by Equations over Sets of Integers. Theory Comput. Syst. 51(2): 196-228 (2012) - [c17]Artur Jez, Alexander Okhotin:
On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars. DCFS 2012: 183-195 - [c16]Artur Jez:
Faster Fully Compressed Pattern Matching by Recompression. ICALP (1) 2012: 533-544 - [c15]Artur Jez:
Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P). STACS 2012: 136-147 - [c14]Artur Jez, Andreas Maletti:
Hyper-minimization for Deterministic Tree Automata. CIAA 2012: 217-228 - [i7]Artur Jez:
Recompression: a simple and powerful technique for word equations. CoRR abs/1203.3705 (2012) - 2011
- [j8]Artur Jez, Tomasz Jurdzinski:
Length-reducing Automata (almost) without Auxiliary Symbols. J. Autom. Lang. Comb. 16(2-4): 141-164 (2011) - [j7]Artur Jez, Alexander Okhotin:
Complexity of Equations over Sets of Natural Numbers. Theory Comput. Syst. 48(2): 319-342 (2011) - [j6]Artur Jez, Alexander Okhotin:
One-Nonterminal Conjunctive Grammars over a Unary Alphabet. Theory Comput. Syst. 49(2): 319-342 (2011) - [c13]Pawel Gawrychowski, Artur Jez, Andreas Maletti:
On Minimising Automata with Errors. MFCS 2011: 327-338 - [c12]Artur Jez, Andreas Maletti:
Computing All ℓ-Cover Automata Fast. CIAA 2011: 203-214 - [i6]Pawel Gawrychowski, Artur Jez, Andreas Maletti:
On minimising automata with errors. CoRR abs/1102.5682 (2011) - [i5]Artur Jez:
Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P). CoRR abs/1110.2318 (2011) - [i4]Artur Jez:
Faster fully compressed pattern matching by recompression. CoRR abs/1111.3244 (2011) - 2010
- [j5]Artur Jez, Alexander Okhotin:
Univariate Equations Over Sets of Natural Numbers. Fundam. Informaticae 104(4): 329-348 (2010) - [j4]Artur Jez, Alexander Okhotin:
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth. Theory Comput. Syst. 46(1): 27-58 (2010) - [c11]Pawel Gawrychowski, Artur Jez, Lukasz Jez:
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online. CSR 2010: 132-143 - [c10]Artur Jez, Alexander Okhotin:
Least and Greatest Solutions of Equations over Sets of Integers. MFCS 2010: 441-452 - [c9]Artur Jez, Alexander Okhotin:
On Equations over Sets of Integers. STACS 2010: 477-488 - [i3]Artur Jez, Alexander Okhotin:
On equations over sets of integers. CoRR abs/1001.2932 (2010)
2000 – 2009
- 2009
- [j3]Artur Jez, Jakub Lopuszanski:
On the two-dimensional cow search problem. Inf. Process. Lett. 109(11): 543-547 (2009) - [c8]Artur Jez, Alexander Okhotin:
One-Nonterminal Conjunctive Grammars over a Unary Alphabet. CSR 2009: 191-202 - [c7]Pawel Gawrychowski, Artur Jez:
Hyper-minimisation Made Efficient. MFCS 2009: 356-368 - [c6]Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Grzegorz Stachowiak:
Collecting weighted items from a dynamic queue. SODA 2009: 1126-1135 - [c5]Artur Jez, Alexander Okhotin:
Equations over Sets of Natural Numbers with Addition Only. STACS 2009: 577-588 - [i2]Pawel Gawrychowski, Artur Jez, Lukasz Jez:
Optimal, online validation of the pi and pi' failure functions. CoRR abs/0901.2897 (2009) - 2008
- [j2]Mariusz Grech, Artur Jez, Andrzej Kisielewicz:
Graphical complexity of products of permutation groups. Discret. Math. 308(7): 1142-1152 (2008) - [j1]Artur Jez:
Conjunctive Grammars Generate Non-Regular Unary Languages. Int. J. Found. Comput. Sci. 19(3): 597-615 (2008) - [c4]Artur Jez, Alexander Okhotin:
On the Computational Completeness of Equations over Sets of Natural Numbers. ICALP (2) 2008: 63-74 - [c3]Alexander Okhotin, Artur Jez:
Complexity of solutions of equations over sets of natural numbers. STACS 2008: 373-384 - [i1]Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Jakub Lopuszanski, Grzegorz Stachowiak:
Generalized Whac-a-Mole. CoRR abs/0802.1685 (2008) - 2007
- [c2]Artur Jez, Alexander Okhotin:
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth. CSR 2007: 168-181 - [c1]Artur Jez:
Conjunctive Grammars Can Generate Non-regular Unary Languages. Developments in Language Theory 2007: 242-253
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-13 02:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
