Recompression: a simple and powerful technique for word equations A Jeż Journal of the ACM (JACM) 63 (1), 1-51, 2016 | 118 | 2016 |

Faster fully compressed pattern matching by recompression A Jeż ACM Transactions on Algorithms (TALG) 11 (3), 1-43, 2015 | 95 | 2015 |

Approximation of grammar-based compression via recompression A Jeż Theoretical Computer Science 592, 115-134, 2015 | 84 | 2015 |

A really simple approximation of smallest grammar A Jeż Theoretical Computer Science 616, 141-150, 2016 | 73 | 2016 |

Balancing straight-line programs M Ganardi, A Jeż, M Lohrey Journal of the ACM (JACM) 68 (4), 1-40, 2021 | 64 | 2021 |

Conjunctive grammars over a unary alphabet: undecidability and unbounded growth A Jeż, A Okhotin Theory of Computing Systems 46 (1), 27-58, 2010 | 62 | 2010 |

Conjunctive grammars generate non-regular unary languages A Jeż International Journal of Foundations of Computer Science 19 (03), 597-615, 2008 | 61 | 2008 |

Finding all solutions of equations in free groups and monoids with involution V Diekert, A Jeż, W Plandowski Information and Computation 251, 263-286, 2016 | 54 | 2016 |

Approximation of smallest linear tree grammar A Jeż, M Lohrey Information and Computation 251, 215-251, 2016 | 39 | 2016 |

Word equations in nondeterministic linear space A Jez 44th International Colloquium on Automata, Languages, and Programming (ICALP …, 2017 | 38* | 2017 |

On the computational completeness of equations over sets of natural numbers A Jeż, A Okhotin Automata, Languages and Programming: 35th International Colloquium, ICALP …, 2008 | 38* | 2008 |

On the two-dimensional cow search problem A Jeż, J Łopuszański Information Processing Letters 109 (11), 543-547, 2009 | 37 | 2009 |

Context unification is in PSPACE A Jeż International Colloquium on Automata, Languages, and Programming, 244-255, 2014 | 36 | 2014 |

One-variable word equations in linear time A Jeż Algorithmica 74, 1-48, 2016 | 32 | 2016 |

Hyper-minimisation made efficient P Gawrychowski, A Jeż International Symposium on Mathematical Foundations of Computer Science, 356-368, 2009 | 31 | 2009 |

Complexity of equations over sets of natural numbers A Jeż, A Okhotin Theory of Computing Systems 48, 319-342, 2011 | 29 | 2011 |

Constructing small tree grammars and small circuits for formulas M Ganardi, D Hucke, A Jeż, M Lohrey, E Noeth Journal of Computer and System Sciences 86, 136-158, 2017 | 28 | 2017 |

Validating the Knuth-Morris-Pratt failure function, fast and online P Gawrychowski, A Jeż, Ł Jeż Theory of Computing Systems 54 (2), 337-372, 2014 | 28 | 2014 |

One-nonterminal conjunctive grammars over a unary alphabet A Jeż, A Okhotin Theory of Computing Systems 49 (2), 319-342, 2011 | 27 | 2011 |

Solutions of word equations over partially commutative structures V Diekert, A Jeż, M Kufleitner arXiv preprint arXiv:1603.02966, 2016 | 25 | 2016 |