 | 2012 |
|---|
| 29 |       | Artur Jez:
Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P).
STACS 2012: 136-147 |
| 28 | | Artur Jez:
Recompression: a simple and powerful technique for word equations
CoRR abs/1203.3705: (2012) |
| 27 | | Artur Jez,
Alexander Okhotin:
Representing Hyper-arithmetical Sets by Equations over Sets of Integers.
Theory Comput. Syst. 51(2): 196-228 (2012) |
| 2011 |
|---|
| 26 | | Artur Jez,
Andreas Maletti:
Computing All ℓ-Cover Automata Fast.
CIAA 2011: 203-214 |
| 25 | | Pawel Gawrychowski,
Artur Jez,
Andreas Maletti:
On Minimising Automata with Errors.
MFCS 2011: 327-338 |
| 24 | | Pawel Gawrychowski,
Artur Jez,
Andreas Maletti:
On minimising automata with errors
CoRR abs/1102.5682: (2011) |
| 23 | | Artur Jez:
Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P)
CoRR abs/1110.2318: (2011) |
| 22 | | Artur Jez:
Faster fully compressed pattern matching by recompression
CoRR abs/1111.3244: (2011) |
| 21 | | Artur Jez,
Alexander Okhotin:
Complexity of Equations over Sets of Natural Numbers.
Theory Comput. Syst. 48(2): 319-342 (2011) |
| 20 | | Artur Jez,
Alexander Okhotin:
One-Nonterminal Conjunctive Grammars over a Unary Alphabet.
Theory Comput. Syst. 49(2): 319-342 (2011) |
| 2010 |
|---|
| 19 | | Pawel Gawrychowski,
Artur Jez,
Lukasz Jez:
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online.
CSR 2010: 132-143 |
| 18 | | Artur Jez,
Alexander Okhotin:
Least and Greatest Solutions of Equations over Sets of Integers.
MFCS 2010: 441-452 |
| 17 | | Artur Jez,
Alexander Okhotin:
On Equations over Sets of Integers.
STACS 2010: 477-488 |
| 16 | | Artur Jez,
Alexander Okhotin:
On equations over sets of integers
CoRR abs/1001.2932: (2010) |
| 15 | | Artur Jez,
Alexander Okhotin:
Univariate Equations Over Sets of Natural Numbers.
Fundam. Inform. 104(4): 329-348 (2010) |
| 14 | | Artur Jez,
Alexander Okhotin:
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth.
Theory Comput. Syst. 46(1): 27-58 (2010) |
| 2009 |
|---|
| 13 | | Artur Jez,
Alexander Okhotin:
One-Nonterminal Conjunctive Grammars over a Unary Alphabet.
CSR 2009: 191-202 |
| 12 | | Pawel Gawrychowski,
Artur Jez:
Hyper-minimisation Made Efficient.
MFCS 2009: 356-368 |
| 11 | | 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 |
| 10 | | Artur Jez,
Alexander Okhotin:
Equations over Sets of Natural Numbers with Addition Only.
STACS 2009: 577-588 |
| 9 | | Pawel Gawrychowski,
Artur Jez,
Lukasz Jez:
Optimal, online validation of the pi and pi' failure functions
CoRR abs/0901.2897: (2009) |
| 8 | | Artur Jez,
Jakub Lopuszanski:
On the two-dimensional cow search problem.
Inf. Process. Lett. 109(11): 543-547 (2009) |
| 2008 |
|---|
| 7 | | Artur Jez,
Alexander Okhotin:
On the Computational Completeness of Equations over Sets of Natural Numbers.
ICALP (2) 2008: 63-74 |
| 6 | | Alexander Okhotin,
Artur Jez:
Complexity of solutions of equations over sets of natural numbers.
STACS 2008: 373-384 |
| 5 | | 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) |
| 4 | | Mariusz Grech,
Artur Jez,
Andrzej Kisielewicz:
Graphical complexity of products of permutation groups.
Discrete Mathematics 308(7): 1142-1152 (2008) |
| 3 | | Artur Jez:
Conjunctive Grammars Generate Non-Regular Unary Languages.
Int. J. Found. Comput. Sci. 19(3): 597-615 (2008) |
| 2007 |
|---|
| 2 | | Artur Jez,
Alexander Okhotin:
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth.
CSR 2007: 168-181 |
| 1 | | Artur Jez:
Conjunctive Grammars Can Generate Non-regular Unary Languages.
Developments in Language Theory 2007: 242-253 |
Data released under the ODC-BY 1.0 license — See also our legal information page