The following pages link to Artur Jeż (Q248925):
Displayed 50 items.
- One-variable word equations in linear time (Q261339) (← links)
- Equations over sets of integers with addition only (Q295632) (← links)
- Approximation of smallest linear tree grammar (Q342719) (← links)
- Finding all solutions of equations in free groups and monoids with involution (Q342722) (← links)
- Approximation of grammar-based compression via recompression (Q500975) (← links)
- Unambiguous conjunctive grammars over a one-symbol alphabet (Q507593) (← links)
- Complexity of equations over sets of natural numbers (Q633764) (← links)
- One-nonterminal conjunctive grammars over a unary alphabet (Q639852) (← links)
- Representing hyper-arithmetical sets by equations over sets of integers (Q693054) (← links)
- Recompression: technique for word equations and compressed data (Q782556) (← links)
- A \textit{really} simple approximation of smallest grammar (Q906407) (← links)
- (Q987816) (redirect page) (← links)
- On the two-dimensional cow search problem (Q987818) (← links)
- Validating the Knuth-Morris-Pratt failure function, fast and online (Q1678758) (← links)
- A \(\phi\)-competitive algorithm for collecting items with increasing weights from a dynamic queue (Q1939283) (← links)
- Collecting weighted items from a dynamic queue (Q1939667) (← links)
- Word equations in non-deterministic linear space (Q2237894) (← links)
- Computational completeness of equations over sets of natural numbers (Q2252522) (← links)
- The complexity of compressed membership problems for finite automata (Q2254509) (← links)
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth (Q2268341) (← links)
- Deciding context unification (with regular constraints) (Q2327536) (← links)
- Constructing small tree grammars and small circuits for formulas (Q2396826) (← links)
- Graphical complexity of products of permutation groups (Q2469992) (← links)
- (Q2819404) (← links)
- Faster Fully Compressed Pattern Matching by Recompression (Q2843278) (← links)
- (Q2904756) (← links)
- Hyper-minimization for Deterministic Tree Automata (Q2914711) (← links)
- (Q2957887) (← links)
- (Q2965507) (← links)
- (Q3005912) (← links)
- On Minimising Automata with Errors (Q3088051) (← links)
- (Q3113773) (← links)
- On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars (Q3167581) (← links)
- Recompression (Q3177761) (← links)
- Hyper-minimisation Made Efficient (Q3182939) (← links)
- One-Nonterminal Conjunctive Grammars over a Unary Alphabet (Q3392954) (← links)
- Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth (Q3499774) (← links)
- On the Computational Completeness of Equations over Sets of Natural Numbers (Q3520304) (← links)
- CONJUNCTIVE GRAMMARS GENERATE NON-REGULAR UNARY LANGUAGES (Q3538852) (← links)
- Validating the Knuth-Morris-Pratt Failure Function, Fast and Online (Q3569737) (← links)
- Least and Greatest Solutions of Equations over Sets of Integers (Q3586104) (← links)
- (Q4598269) (← links)
- (Q4633927) (← links)
- (Q4636583) (← links)
- On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars (Q4686528) (← links)
- (Q4910734) (← links)
- (Q4913002) (← links)
- Approximation of Grammar-Based Compression via Recompression (Q4928570) (← links)
- Finding All Solutions of Equations in Free Groups and Monoids with Involution (Q4981143) (← links)
- (Q5005113) (← links)