Moses Ganardi

ORCID

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 65

Top Venues

University of Siegen, Germany (PHD)

Education History

University of Siegen, Germany

PHD

Publications

Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche
Ramsey Quantifiers in Linear Arithmetics. Proc. ACM Program. Lang. 8 (POPL) (2024)
Moses Ganardi, Irmak Saglam, Georg Zetzsche
Directed Regular and Context-Free Languages. STACS (2024)
Moses Ganardi, Danny Hucke, Markus Lohrey, Konstantinos Mamouras, Tatiana Starikovskaya
Regular Languages in the Sliding Window Model. CoRR (2024)
Moses Ganardi, Irmak Saglam, Georg Zetzsche
Directed Regular and Context-Free Languages. CoRR (2024)
Pascal Baumann, Flavio D'Alessandro, Moses Ganardi, Oscar H. Ibarra, Ian McQuillan, Lia Schütze, Georg Zetzsche
Unboundedness problems for machines with reversal-bounded counters. CoRR (2023)
Moses Ganardi, Markus Lohrey, Georg Zetzsche
Knapsack and the power word problem in solvable Baumslag-Solitar groups. Int. J. Algebra Comput. 33 (3) (2023)
Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche
Existential Definability over the Subword Ordering. Log. Methods Comput. Sci. 19 (4) (2023)
Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche
Ramsey Quantifiers in Linear Arithmetics. CoRR (2023)
Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
Checking Refinement of Asynchronous Programs against Context-Free Specifications. CoRR (2023)
Pascal Baumann, Flavio D'Alessandro, Moses Ganardi, Oscar H. Ibarra, Ian McQuillan, Lia Schütze, Georg Zetzsche
Unboundedness Problems for Machines with Reversal-Bounded Counters. FoSSaCS (2023)
Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
Checking Refinement of Asynchronous Programs Against Context-Free Specifications. ICALP (2023)
Pascal Bergsträßer, Moses Ganardi
Revisiting Membership Problems in Subclasses of Rational Relations. LICS (2023)
Pascal Bergsträßer, Moses Ganardi
Revisiting Membership Problems in Subclasses of Rational Relations. CoRR (2023)
Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
Context-Bounded Verification of Context-Free Specifications. Proc. ACM Program. Lang. 7 (POPL) (2023)
Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
Context-Bounded Analysis of Concurrent Programs (Invited Talk). ICALP (2023)
Moses Ganardi, Pawel Gawrychowski
Pattern Matching on Grammar-Compressed Strings in Linear Time. SODA (2022)
Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche
Existential Definability over the Subword Ordering. CoRR (2022)
Moses Ganardi, Louis Jachiet, Markus Lohrey, Thomas Schwentick
Low-Latency Sliding Window Algorithms for Formal Languages. FSTTCS (2022)
Moses Ganardi, Rupak Majumdar, Georg Zetzsche
The Complexity of Bidirected Reachability in Valence Systems. LICS (2022)
Moses Ganardi, Louis Jachiet, Markus Lohrey, Thomas Schwentick
Low-Latency Sliding Window Algorithms for Formal Languages. CoRR (2022)
Moses Ganardi, Rupak Majumdar, Andreas Pavlogiannis, Lia Schütze, Georg Zetzsche
Reachability in Bidirected Pushdown VASS. ICALP (2022)
Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche
Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification. LICS (2022)
Moses Ganardi, Rupak Majumdar, Andreas Pavlogiannis, Lia Schütze, Georg Zetzsche
Reachability in Bidirected Pushdown VASS. CoRR (2022)
Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche
Existential Definability over the Subword Ordering. STACS (2022)
Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche
Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification. CoRR (2022)
Moses Ganardi, Artur Jez, Markus Lohrey
Balancing Straight-line Programs. J. ACM 68 (4) (2021)
Moses Ganardi, Pawel Gawrychowski
Pattern Matching on Grammar-Compressed Strings in Linear Time. CoRR (2021)
Moses Ganardi, Danny Hucke, Markus Lohrey
. Theory Comput. Syst. 65 (3) (2021)
Moses Ganardi, Rupak Majumdar, Georg Zetzsche
The complexity of bidirected reachability in valence systems. CoRR (2021)
Pascal Bergsträßer, Moses Ganardi, Georg Zetzsche
A Characterization of Wreath Products Where Knapsack Is Decidable. STACS (2021)
Moses Ganardi
Compression by Contracting Straight-Line Programs. ESA (2021)
Moses Ganardi
Compression by Contracting Straight-Line Programs. CoRR (2021)
Moses Ganardi, Bakhadyr Khoussainov
Automatic Equivalence Structures of Polynomial Growth. CSL (2020)
Michael Figelius, Moses Ganardi, Markus Lohrey, Georg Zetzsche
The complexity of knapsack problems in wreath products. CoRR (2020)
Michael Figelius, Moses Ganardi, Markus Lohrey, Georg Zetzsche
The Complexity of Knapsack Problems in Wreath Products. ICALP (2020)
Moses Ganardi, Danny Hucke, Markus Lohrey, Tatiana Starikovskaya
Sliding Window Property Testing for Regular Languages. ISAAC (2019)
Moses Ganardi, Danny Hucke, Markus Lohrey
Derandomization for Sliding Window Algorithms with Strict Correctness. CSR (2019)
Moses Ganardi
Visibly Pushdown Languages over Sliding Windows. STACS (2019)
Moses Ganardi, Artur Jez, Markus Lohrey
Balancing Straight-Line Programs. FOCS (2019)
Moses Ganardi, Danny Hucke, Markus Lohrey, Tatiana Starikovskaya
Sliding window property testing for regular languages. CoRR (2019)
Moses Ganardi, Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner
Universal Tree Source Coding Using Grammar-Based Compression. IEEE Trans. Inf. Theory 65 (10) (2019)
Moses Ganardi, Artur Jez, Markus Lohrey
Balancing Straight-Line Programs. CoRR (2019)
Moses Ganardi, Markus Lohrey
A Universal Tree Balancing Theorem. ACM Trans. Comput. Theory 11 (1) (2019)
Moses Ganardi, Danny Hucke, Markus Lohrey
Randomized sliding window algorithms for regular languages. CoRR (2018)
Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey, Konstantinos Mamouras
Automata Theory on Sliding Windows. STACS (2018)
Moses Ganardi, Stefan Göller, Markus Lohrey
The Complexity of Bisimulation and Simulation on Finite Systems. Log. Methods Comput. Sci. 14 (4) (2018)
Moses Ganardi, Danny Hucke, Markus Lohrey
Randomized Sliding Window Algorithms for Regular Languages. ICALP (2018)
Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey
Circuits and Expressions over Finite Semirings. ACM Trans. Comput. Theory 10 (4) (2018)
Moses Ganardi, Daniel König, Markus Lohrey, Georg Zetzsche
Knapsack Problems for Wreath Products. STACS (2018)
Moses Ganardi, Danny Hucke, Markus Lohrey, Eric Noeth
Tree Compression Using String Grammars. Algorithmica 80 (3) (2018)
Moses Ganardi
Visibly Pushdown Languages over Sliding Windows. CoRR (2018)
Moses Ganardi, Stefan Göller, Markus Lohrey
The Complexity of Bisimulation and Simulation on Finite Systems. CoRR (2018)
Moses Ganardi, Danny Hucke, Markus Lohrey
Sliding Window Algorithms for Regular Languages. LATA (2018)
Moses Ganardi, Artur Jez, Markus Lohrey
Sliding Windows over Context-Free Languages. MFCS (2018)
Moses Ganardi, Danny Hucke, Markus Lohrey
Querying languages over sliding windows. CoRR (2017)
Moses Ganardi, Markus Lohrey
A universal tree balancing theorem. CoRR (2017)
Moses Ganardi, Daniel König, Markus Lohrey, Georg Zetzsche
Knapsack Problems for Wreath Products. CoRR (2017)
Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey
Circuit Evaluation for Finite Semirings. STACS (2017)
Moses Ganardi, Danny Hucke, Artur Jez, Markus Lohrey, Eric Noeth
Constructing small tree grammars and small circuits for formulas. J. Comput. Syst. Sci. 86 (2017)
Moses Ganardi, Danny Hucke, Markus Lohrey, Eric Noeth
Tree Compression Using String Grammars. LATIN (2016)
Moses Ganardi, Danny Hucke, Markus Lohrey
Querying Regular Languages over Sliding Windows. FSTTCS (2016)
Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey
Circuit Evaluation for Finite Semirings. CoRR (2016)
Moses Ganardi, Stefan Göller, Markus Lohrey
On the Parallel Complexity of Bisimulation on Finite Systems. CSL (2016)
Moses Ganardi
Parity Games of Bounded Tree- and Clique-Width. FoSSaCS (2015)
Moses Ganardi, Danny Hucke, Markus Lohrey, Eric Noeth
Tree compression using string grammars. CoRR (2015)

Moses Ganardi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Moses Ganardi