Follow
Markus L. Schmid
Markus L. Schmid
Post-Doc Researcher, Theoretical Computer Science, Humboldt University Berlin
Verified email at mlschmid.de
Title
Cited by
Cited by
Year
Pattern matching with variables: A multivariate complexity analysis
H Fernau, ML Schmid
Information and Computation 242, 287-305, 2015
472015
Characterising REGEX languages by regular languages equipped with factor-referencing
ML Schmid
Information and Computation 249, 1-17, 2016
432016
Characterization and complexity results on jumping finite automata
H Fernau, M Paramasivan, ML Schmid, V Vorel
Theoretical Computer Science 679, 31-52, 2017
392017
Deterministic regular expressions with back-references
DD Freydenberger, ML Schmid
Journal of Computer and System Sciences 105, 1-39, 2019
372019
Patterns with bounded treewidth
D Reidenbach, ML Schmid
Information and Computation 239, 87-99, 2014
372014
On the parameterised complexity of string morphism problems
H Fernau, ML Schmid, Y Villanger
Theory of Computing Systems 59 (1), 24-51, 2016
362016
Pattern matching with variables: Fast algorithms and new hardness results
H Fernau, F Manea, R Mercas, ML Schmid
32nd International Symposium on Theoretical Aspects of Computer Science …, 2015
352015
Jumping finite automata: characterizations and complexity
H Fernau, M Paramasivan, ML Schmid
Implementation and Application of Automata: 20th International Conference …, 2015
312015
A purely regular approach to non-regular core spanners
ML Schmid, N Schweikardt
arXiv preprint arXiv:2010.13442, 2020
272020
Contextual array grammars and array P systems
H Fernau, R Freund, ML Schmid, KG Subramanian, P Wiederhold
Annals of Mathematics and Artificial Intelligence 75, 5-26, 2015
272015
A polynomial time match test for large classes of extended regular expressions
D Reidenbach, ML Schmid
Implementation and Application of Automata: 15th International Conference …, 2011
232011
Simple picture processing based on finite automata and regular grammars
H Fernau, M Paramasivan, ML Schmid
Journal of Computer and System Sciences 95, 232-258, 2018
212018
On the complexity of grammar-based compression over fixed alphabets
K Casel, H Fernau, S Gaspers, B Gras, ML Schmid
43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016
202016
Fine-grained complexity of regular path queries
K Casel, ML Schmid
Logical Methods in Computer Science 19, 2023
182023
Spanner evaluation over SLP-compressed documents
ML Schmid, N Schweikardt
Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2021
172021
Matching patterns with variables
F Manea, ML Schmid
Combinatorics on Words: 12th International Conference, WORDS 2019 …, 2019
162019
Revisiting Shinohara's algorithm for computing descriptive patterns
H Fernau, F Manea, R Mercaş, ML Schmid
Theoretical Computer Science 733, 44-54, 2018
162018
Discovering event queries from traces: Laying foundations for subsequence-queries with wildcards and gap-size constraints
S Kleest-Meißner, R Sattler, ML Schmid, N Schweikardt, M Weidlich
25th International Conference on Database Theory (ICDT 2022), 2022
142022
Scanning pictures the boustrophedon way
H Fernau, M Paramasivan, ML Schmid, DG Thomas
Combinatorial Image Analysis: 17th International Workshop, IWCIA 2015 …, 2015
132015
On the complexity of the smallest grammar problem over fixed alphabets
K Casel, H Fernau, S Gaspers, B Gras, ML Schmid
Theory of Computing Systems 65, 344-409, 2021
122021
The system can't perform the operation now. Try again later.
Articles 1–20