M
Moses Ganardi
Researcher at Max Planck Society
Publications - 49
Citations - 257
Moses Ganardi is an academic researcher from Max Planck Society. The author has contributed to research in topics: Sliding window protocol & Computer science. The author has an hindex of 8, co-authored 39 publications receiving 180 citations. Previous affiliations of Moses Ganardi include Folkwang University of the Arts & University of Siegen.
Papers
More filters
Proceedings ArticleDOI
Balancing Straight-Line Programs
TL;DR: This article showed that a context-free grammar of size m that produces a single string w of length n (such a grammar is also called a string straight-line program) can be transformed in linear time into a context free grammar for w of size O(m), whose unique derivation tree has depth O(log n).
Proceedings ArticleDOI
Querying Regular Languages over Sliding Windows
TL;DR: The space complexity of querying regular languages over data streams in the sliding window model is studied to show that for every regular language the optimal space requirement is either in Theta (n), Theta(log(n), or constant, where $n$ is the size of the slidingwindow.
Journal ArticleDOI
Constructing small tree grammars and small circuits for formulas
TL;DR: It is shown that every tree of size n over a fixed set of different ranked symbols can be produced by a so called straight-line linear context-free tree grammar of size O ( n log n ) , which can be used as a compressed representation of the input tree.
Proceedings ArticleDOI
Knapsack Problems for Wreath Products
TL;DR: In this article, the decidability of knapsack problems for non-commutative groups with wreath products has been studied and it is shown that for every non-trivial abelian group G, the problem is NP-complete.
Posted Content
Automata theory on sliding windows
TL;DR: This paper presents natural characterizations for the constant and logarithmic space classes and establishes tight relationships to the concept of language growth and considers the decision problem whether a language given by a DFA/NFA admits a sliding window algorithm using logarathmic/constant space.