No. |
Title |
Author |
Year |
---|

1 |
Solving Word Equations (And Other Unification Problems) by Recompression (Invited Talk) |
JeÅ¼, Artur |
2020 |

2 |
Edit Distance with Block Operations |
Ganczorz, Michal et al. |
2018 |

3 |
Sliding Windows over Context-Free Languages |
Ganardi, Moses et al. |
2018 |

4 |
Recompression of SLPs |
Jez, Artur |
2017 |

5 |
Recompression: New Approach to Word Equations and Context Unification (Invited Talk) |
Jez, Artur |
2017 |

6 |
Word Equations in Nondeterministic Linear Space |
Jez, Artur |
2017 |

7 |
LZ77 Factorisation of Trees |
Gawrychowski, Pawel et al. |
2016 |

8 |
Solutions of Word Equations Over Partially Commutative Structures |
Diekert, Volker et al. |
2016 |

9 |
Approximation of smallest linear tree grammar |
Jez, Artur et al. |
2014 |

10 |
Recompression: a simple and powerful technique for word equations |
Jez, Artur |
2013 |

11 |
Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P) |
Jez, Artur |
2012 |

12 |
On Equations over Sets of Integers |
Jez, Artur et al. |
2010 |

13 |
Equations over Sets of Natural Numbers with Addition Only |
Jez, Artur et al. |
2009 |

14 |
Complexity of solutions of equations over sets of natural numbers |
Okhotin, Alexander et al. |
2008 |