5 citations · 8 across the 5 of their papers we have counts for
7 papers
Streaming Rewriting Games: Winning Strategies and Complexity
Christian Coester, Thomas Schwentick, Martin Schuster
Context-free games on strings are two-player rewriting games based on a set of production rules and a regular target language. In each round, the first player selects a position of…
Formal Semantics of the Language Cypher
Nadime Francis, Alastair Green, Paolo Guagliardo +8
Cypher is a query language for property graphs. It was originally designed and implemented as part of the Neo4j graph database, and it is currently used in a growing number of comm…
New Abilities and Limitations of Spectral Graph Bisection
Martin R. Schuster, Maciej Liskiewicz
Spectral based heuristics belong to well-known commonly used methods which determines provably minimal graph bisection or outputs "fail" when the optimality cannot be certified. In…
Transducer-based Rewriting Games for Active XML
Martin Schuster
Context-free games are two-player rewriting games that are played on nested strings representing XML documents with embedded function symbols. These games were introduced to model…
Games for Active XML Revisited
Martin Schuster, Thomas Schwentick
The paper studies the rewriting mechanisms for intensional documents in the Active XML framework, abstracted in the form of active context-free games. The safe rewriting problem st…
On optimum left-to-right strategies for active context-free games
Henrik Björklund, Martin Schuster, Thomas Schwentick +1
Active context-free games are two-player games on strings over finite alphabets with one player trying to rewrite the input string to match a target specification. These games have…