3 citations · 5 across the 7 of their papers we have counts for
15 papers
Tractable Gap-Constraint Languages for Complex Event Recognition
Antoine Amarilli, Florin Manea, Tina Ringleb +1
For strings , a subsequence embedding of in is a function with for every $i \in \{1,2,…
Extending Shinohara's Algorithm for Computing Descriptive (Angluin-Style) Patterns to Subsequence Patterns
Markus L. Schmid
The introduction of pattern languages in the seminal work [Angluin, ``Finding Patterns Common to a Set of Strings'', JCSS 1980] has revived the classical model of inductive inferen…
Subsequences With Gap Constraints: Complexity Bounds for Matching and Analysis Problems
Joel D. Day, Maria Kosche, Florin Manea +1
We consider subsequences with gap constraints, i.e., length-k subsequences p that can be embedded into a string w such that the induced gaps (i.e., the factors of w between the pos…
Spanner Evaluation over SLP-Compressed Documents
Markus L. Schmid, Nicole Schweikardt
We consider the problem of evaluating regular spanners over compressed documents, i.e., we wish to solve evaluation tasks directly on the compressed data, without decompression. As…
Refl-Spanners: A Purely Regular Approach to Non-Regular Core Spanners
Markus L. Schmid, Nicole Schweikardt
The regular spanners (characterised by vset-automata) are closed under the algebraic operations of union, join and projection, and have desirable algorithmic properties. The core s…
Shortest Distances as Enumeration Problem
Katrin Casel, Tobias Friedrich, Stefan Neubert +1
We investigate the single source shortest distance (SSSD) and all pairs shortest distance (APSD) problems as enumeration problems (on unweighted and integer weighted graphs), meani…