Markus L. Schmid

From MaRDI portal
Person:315523

Available identifiers

zbMath Open schmid.markus-lMaRDI QIDQ315523

List of research outcomes





PublicationDate of PublicationType
Subsequences with gap constraints: complexity bounds for matching and analysis problems2024-09-11Paper
A short note on the mutually beneficial relationship between information extraction in database theory and classical formal language theory2024-08-21Paper
Discovering event queries from traces: laying foundations for subsequence-queries with wildcards and gap-size constraints2024-04-25Paper
Discovering event queries from traces: laying foundations for subsequence-queries with wildcards and gap-size constraints2024-04-23Paper
Shortest distances as enumeration problem2024-01-24Paper
Fine-Grained Complexity of Regular Path Queries2024-01-16Paper
Combinatorial properties and recognition of unit square visibility graphs2023-05-12Paper
Pattern Matching with Variables2022-12-05Paper
https://portal.mardi4nfdi.de/entity/Q50912712022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50050952021-08-04Paper
On the complexity of the smallest grammar problem over fixed alphabets2021-06-24Paper
https://portal.mardi4nfdi.de/entity/Q51112442020-05-26Paper
Consensus strings with small maximum distance and small distance sum2020-04-01Paper
Complexity of independency and cliquy trees2019-12-30Paper
Finding Consensus Strings with Small Length Difference between Input and Solution Strings2019-12-06Paper
Matching patterns with variables2019-11-06Paper
Deterministic regular expressions with back-references2019-08-07Paper
On matching generalised repetitive patterns2018-11-22Paper
On the Complexity of Solving Restricted Word Equations2018-09-20Paper
Revisiting Shinohara's algorithm for computing descriptive patterns2018-06-05Paper
Simple picture processing based on finite automata and regular grammars2018-05-08Paper
https://portal.mardi4nfdi.de/entity/Q46366312018-04-19Paper
On the Complexity of Grammar-Based Compression over Fixed Alphabets2017-12-19Paper
Characterization and complexity results on jumping finite automata2017-06-19Paper
https://portal.mardi4nfdi.de/entity/Q29638972017-02-21Paper
https://portal.mardi4nfdi.de/entity/Q29550042017-01-24Paper
Closure properties of pattern languages2016-11-14Paper
On the parameterised complexity of string morphism problems2016-09-21Paper
On the Solvability Problem for Restricted Classes of Word Equations2016-08-30Paper
Characterising REGEX languages by regular languages equipped with factor-referencing2016-07-07Paper
Scanning Pictures the Boustrophedon Way2016-03-10Paper
Computing equality-free and repetitive string factorisations2016-02-18Paper
Computing Equality-Free String Factorisations2015-10-20Paper
Contextual array grammars and array P systems2015-10-06Paper
Jumping Finite Automata: Characterizations and Complexity2015-09-23Paper
Finding Consensus Strings with Small Length Difference Between Input and Solution Strings2015-09-16Paper
Pattern matching with variables: a multivariate complexity analysis2015-06-01Paper
Patterns with bounded treewidth2014-11-28Paper
Closure Properties of Pattern Languages2014-10-14Paper
Characterising REGEX Languages by Regular Languages Equipped with Factor-Referencing2014-10-14Paper
INSIDE THE CLASS OF REGEX LANGUAGES2014-08-04Paper
https://portal.mardi4nfdi.de/entity/Q54163622014-05-20Paper
A note on the complexity of matching patterns with variables2014-04-14Paper
Regular and context-free pattern languages over small alphabets2014-01-13Paper
Finding shuffle words that represent optimal scheduling of shared memory access2013-10-22Paper
Array Insertion and Deletion P Systems2013-06-28Paper
Pattern Matching with Variables: A Multivariate Complexity Analysis2013-06-14Paper
Regular and Context-Free Pattern Languages over Small Alphabets2012-11-02Paper
Inside the Class of REGEX Languages2012-11-02Paper
Automata with Modulo Counters and Nondeterministic Counter Bounds2012-09-20Paper
On multi-head automata with restricted nondeterminism2012-07-25Paper
Patterns with Bounded Treewidth2012-06-08Paper
Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access2011-06-03Paper
A Polynomial Time Match Test for Large Classes of Extended Regular Expressions2011-02-11Paper
Mirage phenomena in superconducting quantum corrals2005-10-06Paper
Mirages, anti-mirages, and further surprises in quantum corrals with non-magnetic impurities2004-02-12Paper

Research outcomes over time

This page was built for person: Markus L. Schmid