Moses Ganardi

Available identifiers

zbMath Open ganardi.mosesMaRDI QIDQ1647671

List of research outcomes

Publication	Date of Publication	Type
The complexity of bidirected reachability in valence systems	2024-12-06	Paper
Ramsey quantifiers over automatic structures: complexity and applications to verification	2024-12-06	Paper
Context-bounded analysis of concurrent programs (invited talk)	2024-11-14	Paper
Checking refinement of asynchronous programs against context-free specifications	2024-11-14	Paper
Low-latency sliding window algorithms for formal languages	2024-09-12	Paper
Pattern matching on grammar-compressed strings in linear time	2024-07-19	Paper
Reachability in bidirected pushdown VASS	2024-06-24	Paper
Existential definability over the subword ordering	2024-04-23	Paper
Existential Definability over the Subword Ordering	2024-01-16	Paper
Unboundedness problems for machines with reversal-bounded counters	2023-11-24	Paper
Compression by Contracting Straight-Line Programs	2023-09-20	Paper
Knapsack and the power word problem in solvable Baumslag–Solitar groups	2023-06-01	Paper
Automatic Equivalence Structures of Polynomial Growth.	2023-02-07	Paper
https://portal.mardi4nfdi.de/entity/Q5875566	2023-02-03	Paper
Balancing Straight-line Programs	2022-12-08	Paper
https://portal.mardi4nfdi.de/entity/Q5090478	2022-07-18	Paper
https://portal.mardi4nfdi.de/entity/Q5005113	2021-08-04	Paper
Derandomization for sliding window algorithms with strict correctness	2021-08-03	Paper
https://portal.mardi4nfdi.de/entity/Q5002813	2021-07-28	Paper
A characterization of wreath products where knapsack is decidable	2021-01-15	Paper
https://portal.mardi4nfdi.de/entity/Q3304130	2020-08-05	Paper
Knapsack Problems for Wreath Products	2020-08-05	Paper
The complexity of knapsack problems in wreath products	2020-02-19	Paper
Universal Tree Source Coding Using Grammar-Based Compression	2020-01-28	Paper
Circuits and Expressions over Finite Semirings	2019-12-16	Paper
A Universal Tree Balancing Theorem	2019-12-16	Paper
Derandomization for sliding window algorithms with strict correctness	2019-10-22	Paper
https://portal.mardi4nfdi.de/entity/Q4553282	2018-11-02	Paper
Sliding window algorithms for regular languages	2018-06-26	Paper
Querying Regular Languages over Sliding Windows	2018-04-19	Paper
https://portal.mardi4nfdi.de/entity/Q4636634	2018-04-19	Paper
Tree compression using string grammars	2018-04-11	Paper
https://portal.mardi4nfdi.de/entity/Q5278398	2017-07-19	Paper
Constructing small tree grammars and small circuits for formulas	2017-05-26	Paper
Tree compression using string grammars	2016-05-03	Paper
Parity Games of Bounded Tree- and Clique-Width	2015-10-01	Paper

Research outcomes over time

This page was built for person: Moses Ganardi