Skip to the navigation.Skip to the content.
Publications Moses Ganardi
Conference
papers
- The complexity of knapsack problems in wreath products (with Michael Figelius, Markus
Lohrey and Georg
Zetzsche)
to appear in Proceedings of ICALP 2020
- Automatic equivalence
structures of polynomial growth (with
Bakhadyr
Khoussainov)
Proceedings of CSL 2020
online version at
Schloss Dagstuhl Leibniz-Zentrum für Informatik
- Sliding window
property testing for regular languages
(with Danny
Hucke, Markus
Lohrey and Tatiana
Starikovskaya)
Proceedings of ISAAC 2019
online version at
Schloss Dagstuhl Leibniz-Zentrum für Informatik
arxiv
version
- Balancing
straight-line programs (with Artur Jez and
Markus Lohrey)
Proceedings of FOCS 2019
IEEE Computer Society Press
- Derandomization for
sliding window algorithms with strict
correctness (with Danny
Hucke and Markus
Lohrey)
Proceedings of CSR 2019, LNCS 11532, pp. 237-249
© Springer
- Visibly pushdown languages
over sliding windows
Proceedings of STACS 2019
online version at
Schloss Dagstuhl Leibniz-Zentrum für Informatik
- Sliding windows
over context-free languages (with Artur Jez and
Markus Lohrey)
Proceedings of MFCS 2018
online version at
Schloss Dagstuhl Leibniz-Zentrum für Informatik
- Randomized
sliding window algorithms for regular
languages (with Danny
Hucke and Markus
Lohrey)
Proceedings of ICALP 2018
online version at
Schloss Dagstuhl Leibniz-Zentrum für Informatik
arxiv
version
- Knapsack problems for
wreath products (with Daniel
König, Markus
Lohrey and Georg
Zetzsche)
Proceedings of STACS 2018
online version at
Schloss Dagstuhl Leibniz-Zentrum für Informatik
arxiv
version
- Automata
theory on sliding windows (with Danny
Hucke, Daniel
König, Markus
Lohrey and Konstantinos Mamouras)
Proceedings of STACS 2018
online version at
Schloss Dagstuhl Leibniz-Zentrum für Informatik
arxiv
version
- Circuit Evaluation
for Finite Semirings (with Danny
Hucke, Daniel
König and Markus
Lohrey)
Proceedings of STACS 2017
online version at
Schloss Dagstuhl Leibniz-Zentrum für Informatik
- Querying
regular languages over sliding-windows (with
Danny
Hucke and Markus
Lohrey)
Proceedings of FSTTCS 2016
online version at
Schloss Dagstuhl Leibniz-Zentrum für Informatik
- On the Parallel
Complexity of Bisimulation on Finite Systems
(with Stefan Göller
and Markus
Lohrey)
Proceedings of CSL 2016
online version at
Schloss Dagstuhl Leibniz-Zentrum für Informatik
- Tree Compression Using
String Grammars (with Danny
Hucke, Markus
Lohrey, and Eric
Nöth)
Proceedings of LATIN 2016, LNCS 9644, pp. 590–604
© Springer arxiv version
-
Parity Games of Bounded Tree- and Clique-Width
Proceedings of FOSSACS 2015, LNCS 9034, pp. 390–404
© Springer
Journal
papers
- Universal tree source coding using
grammar-based compression (with Danny
Hucke, Markus
Lohrey and Louisa
Seelbach)
IEEE Transactions on Information Theory 65(10), pp.
6399-6413, 2019
©
IEEE Computer Society Press
- The complexity of bisimulation and simulation
on finite systems (with Stefan Göller
and Markus
Lohrey)
Logical Methods in Computer Science 14(4), 2018
online
version
- A universal tree
balancing theorem (with Markus
Lohrey)
ACM Transactions on Computation Theory 11(1), Article No.
1, 2019
©
ACM
- Circuits and
expressions over finite semirings (with
Danny
Hucke, Daniel
König and Markus
Lohrey)
ACM Transactions on Computation Theory 10(4), Article No.
15, 2018
© ACM
- Tree compression
using string grammars (with Danny
Hucke, Markus
Lohrey and Eric
Nöth)
Algorithmica 80(3), pp. 885–917, 2018 (special issue for
LATIN 2016)
©
Springer
- Constructing small
tree grammars and small circuits for formulas
(with Danny
Hucke, Artur
Jez, Markus
Lohrey and Eric
Nöth)
Journal of Computer and System Sciences 86, pp. 136–158,
2017
©
Elsevier
Thesis