default search action
Moses Ganardi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche:
Ramsey Quantifiers in Linear Arithmetics. Proc. ACM Program. Lang. 8(POPL): 1-32 (2024) - [c29]Moses Ganardi, Irmak Saglam, Georg Zetzsche:
Directed Regular and Context-Free Languages. STACS 2024: 36:1-36:20 - [i24]Moses Ganardi, Irmak Saglam, Georg Zetzsche:
Directed Regular and Context-Free Languages. CoRR abs/2401.07106 (2024) - [i23]Moses Ganardi, Danny Hucke, Markus Lohrey, Konstantinos Mamouras, Tatiana Starikovskaya:
Regular Languages in the Sliding Window Model. CoRR abs/2402.13385 (2024) - 2023
- [j11]Moses Ganardi, Markus Lohrey, Georg Zetzsche:
Knapsack and the power word problem in solvable Baumslag-Solitar groups. Int. J. Algebra Comput. 33(3): 617-639 (2023) - [j10]Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche:
Existential Definability over the Subword Ordering. Log. Methods Comput. Sci. 19(4) (2023) - [j9]Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
Context-Bounded Verification of Context-Free Specifications. Proc. ACM Program. Lang. 7(POPL): 2141-2170 (2023) - [c28]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: 240-264 - [c27]Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
Context-Bounded Analysis of Concurrent Programs (Invited Talk). ICALP 2023: 3:1-3:16 - [c26]Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
Checking Refinement of Asynchronous Programs Against Context-Free Specifications. ICALP 2023: 110:1-110:20 - [c25]Pascal Bergsträßer, Moses Ganardi:
Revisiting Membership Problems in Subclasses of Rational Relations. LICS 2023: 1-14 - [i22]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 abs/2301.10198 (2023) - [i21]Pascal Bergsträßer, Moses Ganardi:
Revisiting Membership Problems in Subclasses of Rational Relations. CoRR abs/2304.11034 (2023) - [i20]Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
Checking Refinement of Asynchronous Programs against Context-Free Specifications. CoRR abs/2306.13058 (2023) - [i19]Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche:
Ramsey Quantifiers in Linear Arithmetics. CoRR abs/2311.04031 (2023) - 2022
- [c24]Moses Ganardi, Louis Jachiet, Markus Lohrey, Thomas Schwentick:
Low-Latency Sliding Window Algorithms for Formal Languages. FSTTCS 2022: 38:1-38:23 - [c23]Moses Ganardi, Rupak Majumdar, Andreas Pavlogiannis, Lia Schütze, Georg Zetzsche:
Reachability in Bidirected Pushdown VASS. ICALP 2022: 124:1-124:20 - [c22]Moses Ganardi, Rupak Majumdar, Georg Zetzsche:
The Complexity of Bidirected Reachability in Valence Systems. LICS 2022: 26:1-26:15 - [c21]Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche:
Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification. LICS 2022: 28:1-28:14 - [c20]Moses Ganardi, Pawel Gawrychowski:
Pattern Matching on Grammar-Compressed Strings in Linear Time. SODA 2022: 2833-2846 - [c19]Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche:
Existential Definability over the Subword Ordering. STACS 2022: 7:1-7:15 - [i18]Moses Ganardi, Rupak Majumdar, Andreas Pavlogiannis, Lia Schütze, Georg Zetzsche:
Reachability in Bidirected Pushdown VASS. CoRR abs/2204.11799 (2022) - [i17]Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche:
Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification. CoRR abs/2205.09015 (2022) - [i16]Moses Ganardi, Louis Jachiet, Markus Lohrey, Thomas Schwentick:
Low-Latency Sliding Window Algorithms for Formal Languages. CoRR abs/2209.14835 (2022) - [i15]Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche:
Existential Definability over the Subword Ordering. CoRR abs/2210.15642 (2022) - 2021
- [j8]Moses Ganardi, Artur Jez, Markus Lohrey:
Balancing Straight-line Programs. J. ACM 68(4): 27:1-27:40 (2021) - [j7]Moses Ganardi, Danny Hucke, Markus Lohrey:
Derandomization for Sliding Window Algorithms with Strict Correctness∗. Theory Comput. Syst. 65(3): 1-18 (2021) - [c18]Moses Ganardi:
Compression by Contracting Straight-Line Programs. ESA 2021: 45:1-45:16 - [c17]Pascal Bergsträßer, Moses Ganardi, Georg Zetzsche:
A Characterization of Wreath Products Where Knapsack Is Decidable. STACS 2021: 11:1-11:17 - [i14]Moses Ganardi:
Compression by Contracting Straight-Line Programs. CoRR abs/2107.00446 (2021) - [i13]Moses Ganardi, Rupak Majumdar, Georg Zetzsche:
The complexity of bidirected reachability in valence systems. CoRR abs/2110.03654 (2021) - [i12]Moses Ganardi, Pawel Gawrychowski:
Pattern Matching on Grammar-Compressed Strings in Linear Time. CoRR abs/2111.05016 (2021) - 2020
- [c16]Moses Ganardi, Bakhadyr Khoussainov:
Automatic Equivalence Structures of Polynomial Growth. CSL 2020: 21:1-21:16 - [c15]Michael Figelius, Moses Ganardi, Markus Lohrey, Georg Zetzsche:
The Complexity of Knapsack Problems in Wreath Products. ICALP 2020: 126:1-126:18 - [i11]Michael Figelius, Moses Ganardi, Markus Lohrey, Georg Zetzsche:
The complexity of knapsack problems in wreath products. CoRR abs/2002.08086 (2020)
2010 – 2019
- 2019
- [b1]Moses Ganardi:
Language recognition in the sliding window model. University of Siegen, Germany, 2019 - [j6]Moses Ganardi, Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner:
Universal Tree Source Coding Using Grammar-Based Compression. IEEE Trans. Inf. Theory 65(10): 6399-6413 (2019) - [j5]Moses Ganardi, Markus Lohrey:
A Universal Tree Balancing Theorem. ACM Trans. Comput. Theory 11(1): 1:1-1:25 (2019) - [c14]Moses Ganardi, Danny Hucke, Markus Lohrey:
Derandomization for Sliding Window Algorithms with Strict Correctness. CSR 2019: 237-249 - [c13]Moses Ganardi, Artur Jez, Markus Lohrey:
Balancing Straight-Line Programs. FOCS 2019: 1169-1183 - [c12]Moses Ganardi, Danny Hucke, Markus Lohrey, Tatiana Starikovskaya:
Sliding Window Property Testing for Regular Languages. ISAAC 2019: 6:1-6:13 - [c11]Moses Ganardi:
Visibly Pushdown Languages over Sliding Windows. STACS 2019: 29:1-29:17 - [i10]Moses Ganardi, Artur Jez, Markus Lohrey:
Balancing Straight-Line Programs. CoRR abs/1902.03568 (2019) - [i9]Moses Ganardi, Danny Hucke, Markus Lohrey, Tatiana Starikovskaya:
Sliding window property testing for regular languages. CoRR abs/1909.10261 (2019) - 2018
- [j4]Moses Ganardi, Danny Hucke, Markus Lohrey, Eric Noeth:
Tree Compression Using String Grammars. Algorithmica 80(3): 885-917 (2018) - [j3]Moses Ganardi, Stefan Göller, Markus Lohrey:
The Complexity of Bisimulation and Simulation on Finite Systems. Log. Methods Comput. Sci. 14(4) (2018) - [j2]Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey:
Circuits and Expressions over Finite Semirings. ACM Trans. Comput. Theory 10(4): 15:1-15:30 (2018) - [c10]Moses Ganardi, Danny Hucke, Markus Lohrey:
Randomized Sliding Window Algorithms for Regular Languages. ICALP 2018: 127:1-127:13 - [c9]Moses Ganardi, Danny Hucke, Markus Lohrey:
Sliding Window Algorithms for Regular Languages. LATA 2018: 26-35 - [c8]Moses Ganardi, Artur Jez, Markus Lohrey:
Sliding Windows over Context-Free Languages. MFCS 2018: 15:1-15:15 - [c7]Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey, Konstantinos Mamouras:
Automata Theory on Sliding Windows. STACS 2018: 31:1-31:14 - [c6]Moses Ganardi, Daniel König, Markus Lohrey, Georg Zetzsche:
Knapsack Problems for Wreath Products. STACS 2018: 32:1-32:13 - [i8]Moses Ganardi, Danny Hucke, Markus Lohrey:
Randomized sliding window algorithms for regular languages. CoRR abs/1802.07600 (2018) - [i7]Moses Ganardi, Stefan Göller, Markus Lohrey:
The Complexity of Bisimulation and Simulation on Finite Systems. CoRR abs/1806.00256 (2018) - [i6]Moses Ganardi:
Visibly Pushdown Languages over Sliding Windows. CoRR abs/1812.11549 (2018) - 2017
- [j1]Moses Ganardi, Danny Hucke, Artur Jez, Markus Lohrey, Eric Noeth:
Constructing small tree grammars and small circuits for formulas. J. Comput. Syst. Sci. 86: 136-158 (2017) - [c5]Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey:
Circuit Evaluation for Finite Semirings. STACS 2017: 35:1-35:14 - [i5]Moses Ganardi, Danny Hucke, Markus Lohrey:
Querying languages over sliding windows. CoRR abs/1702.04376 (2017) - [i4]Moses Ganardi, Markus Lohrey:
A universal tree balancing theorem. CoRR abs/1704.08705 (2017) - [i3]Moses Ganardi, Daniel König, Markus Lohrey, Georg Zetzsche:
Knapsack Problems for Wreath Products. CoRR abs/1709.09598 (2017) - 2016
- [c4]Moses Ganardi, Stefan Göller, Markus Lohrey:
On the Parallel Complexity of Bisimulation on Finite Systems. CSL 2016: 12:1-12:17 - [c3]Moses Ganardi, Danny Hucke, Markus Lohrey:
Querying Regular Languages over Sliding Windows. FSTTCS 2016: 18:1-18:14 - [c2]Moses Ganardi, Danny Hucke, Markus Lohrey, Eric Noeth:
Tree Compression Using String Grammars. LATIN 2016: 590-604 - [i2]Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey:
Circuit Evaluation for Finite Semirings. CoRR abs/1602.04560 (2016) - 2015
- [c1]Moses Ganardi:
Parity Games of Bounded Tree- and Clique-Width. FoSSaCS 2015: 390-404 - [i1]Moses Ganardi, Danny Hucke, Markus Lohrey, Eric Noeth:
Tree compression using string grammars. CoRR abs/1504.05535 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-31 02:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint