| No. |
Title |
Author |
Year |
| 1 |
Solving One Variable Word Equations in the Free Group in Cubic Time |
Ferens, Robert et al. |
2021 |
| 2 |
Solving Word Equations (And Other Unification Problems) by Recompression (Invited Talk) |
Jeż, Artur |
2020 |
| 3 |
Edit Distance with Block Operations |
Ganczorz, Michal et al. |
2018 |
| 4 |
Sliding Windows over Context-Free Languages |
Ganardi, Moses et al. |
2018 |
| 5 |
Recompression of SLPs |
Jez, Artur |
2017 |
| 6 |
Recompression: New Approach to Word Equations and Context Unification (Invited Talk) |
Jez, Artur |
2017 |
| 7 |
Word Equations in Nondeterministic Linear Space |
Jez, Artur |
2017 |
| 8 |
LZ77 Factorisation of Trees |
Gawrychowski, Pawel et al. |
2016 |
| 9 |
Solutions of Word Equations Over Partially Commutative Structures |
Diekert, Volker et al. |
2016 |
| 10 |
Approximation of smallest linear tree grammar |
Jez, Artur et al. |
2014 |
| 11 |
Recompression: a simple and powerful technique for word equations |
Jez, Artur |
2013 |
| 12 |
Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P) |
Jez, Artur |
2012 |
| 13 |
On Equations over Sets of Integers |
Jez, Artur et al. |
2010 |
| 14 |
Equations over Sets of Natural Numbers with Addition Only |
Jez, Artur et al. |
2009 |
| 15 |
Complexity of solutions of equations over sets of natural numbers |
Okhotin, Alexander et al. |
2008 |
