Moses Ganardi

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