default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarkus L. Schmid
Person information
- affiliation: Humboldt-Universität, Berlin, Germany
- affiliation (former): University of Trier, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j30]Katrin Casel, Tobias Friedrich, Stefan Neubert
, Markus L. Schmid:
Shortest distances as enumeration problem. Discret. Appl. Math. 342: 89-103 (2024)- [j29]Markus L. Schmid, Nicole Schweikardt:
Refl-Spanners: A Purely Regular Approach to Non-Regular Core Spanners. Log. Methods Comput. Sci. 20(4) (2024) - [j28]Markus Lohrey, Markus L. Schmid:
Enumeration for MSO-Queries on Compressed Trees. Proc. ACM Manag. Data 2(2): 78 (2024) - [j27]Pawel Gawrychowski, Florin Manea, Markus L. Schmid:
Revisiting Weighted Information Extraction: A Simpler and Faster Algorithm for Ranked Enumeration. Proc. ACM Manag. Data 2(5): 222:1-222:19 (2024) - 2023
- [j26]Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides:
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. Discret. Comput. Geom. 69(4): 937-980 (2023) - [j25]Katrin Casel, Markus L. Schmid:
Fine-Grained Complexity of Regular Path Queries. Log. Methods Comput. Sci. 19(4) (2023) - 2022
- [j24]Markus L. Schmid:
Conjunctive Regular Path Queries with Capture Groups. ACM Trans. Database Syst. 47(2): 5:1-5:52 (2022) - 2021
- [j23]Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, Markus L. Schmid:
On the Complexity of the Smallest Grammar Problem over Fixed Alphabets. Theory Comput. Syst. 65(2): 344-409 (2021) - 2020
- [j22]Laurent Bulteau, Markus L. Schmid:
Consensus Strings with Small Maximum Distance and Small Distance Sum. Algorithmica 82(5): 1378-1409 (2020) - [j21]Katrin Casel, Jan Dreier, Henning Fernau, Moritz Gobbert, Philipp Kuinke, Fernando Sánchez Villaamil, Markus L. Schmid, Erik Jan van Leeuwen:
Complexity of independency and cliquy trees. Discret. Appl. Math. 272: 2-15 (2020) - [j20]Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid:
Pattern Matching with Variables: Efficient Algorithms and Complexity Results. ACM Trans. Comput. Theory 12(1): 6:1-6:37 (2020) - 2019
- [j19]Dominik D. Freydenberger, Markus L. Schmid:
Deterministic regular expressions with back-references. J. Comput. Syst. Sci. 105: 1-39 (2019) - 2018
- [j18]Florin Manea, Dirk Nowotka, Markus L. Schmid:
On the Complexity of Solving Restricted Word Equations. Int. J. Found. Comput. Sci. 29(5): 893-909 (2018) - [j17]Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, D. Gnanaraj Thomas:
Simple picture processing based on finite automata and regular grammars. J. Comput. Syst. Sci. 95: 232-258 (2018) - [j16]Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid:
Revisiting Shinohara's algorithm for computing descriptive patterns. Theor. Comput. Sci. 733: 44-54 (2018) - 2017
- [j15]Joel D. Day, Daniel Reidenbach, Markus L. Schmid:
Closure properties of pattern languages. J. Comput. Syst. Sci. 84: 11-31 (2017) - [j14]Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, Vojtech Vorel:
Characterization and complexity results on jumping finite automata. Theor. Comput. Sci. 679: 31-52 (2017) - [j13]Markus L. Schmid:
Finding Consensus Strings with Small Length Difference between Input and Solution Strings. ACM Trans. Comput. Theory 9(3): 13:1-13:18 (2017) - 2016
- [j12]Markus L. Schmid:
Characterising REGEX languages by regular languages equipped with factor-referencing. Inf. Comput. 249: 1-17 (2016) - [j11]Henning Fernau, Markus L. Schmid, Yngve Villanger:
On the Parameterised Complexity of String Morphism Problems. Theory Comput. Syst. 59(1): 24-51 (2016) - [j10]Markus L. Schmid:
Computing equality-free and repetitive string factorisations. Theor. Comput. Sci. 618: 42-51 (2016) - 2015
- [j9]Henning Fernau, Rudolf Freund, Markus L. Schmid, K. G. Subramanian, Petra Wiederhold:
Contextual array grammars and array P systems. Ann. Math. Artif. Intell. 75(1-2): 5-26 (2015) - [j8]Henning Fernau, Markus L. Schmid:
Pattern matching with variables: A multivariate complexity analysis. Inf. Comput. 242: 287-305 (2015) - 2014
- [j7]Daniel Reidenbach, Markus L. Schmid:
Patterns with bounded treewidth. Inf. Comput. 239: 87-99 (2014) - [j6]Daniel Reidenbach, Markus L. Schmid:
Automata with modulo counters and nondeterministic counter bounds. Kybernetika 50(1): 66-94 (2014) - [j5]Daniel Reidenbach, Markus L. Schmid:
Regular and context-free pattern languages over small alphabets. Theor. Comput. Sci. 518: 80-95 (2014) - 2013
- [j4]Daniel Reidenbach, Markus L. Schmid:
Finding shuffle words that represent optimal scheduling of shared memory access. Int. J. Comput. Math. 90(6): 1292-1309 (2013) - [j3]Markus L. Schmid:
Inside the Class of regex Languages. Int. J. Found. Comput. Sci. 24(7): 1117-1134 (2013) - [j2]Markus L. Schmid:
A note on the complexity of matching patterns with variables. Inf. Process. Lett. 113(19-21): 729-733 (2013) - 2012
- [j1]Daniel Reidenbach, Markus L. Schmid:
On multi-head automata with restricted nondeterminism. Inf. Process. Lett. 112(14-15): 572-577 (2012)
Conference and Workshop Papers
- 2024
- [c36]Florin Manea, Jonas Richardsen, Markus L. Schmid:
Subsequences with Generalised Gap Constraints: Upper and Lower Complexity Bounds. CPM 2024: 22:1-22:17 - [c35]Markus L. Schmid:
The Information Extraction Framework of Document Spanners - A Very Informal Survey. SOFSEM 2024: 3-22 - 2023
- [c34]Sarah Kleest-Meißner, Rebecca Sattler, Markus L. Schmid, Nicole Schweikardt, Matthias Weidlich:
Discovering Multi-Dimensional Subsequence Queries from Traces - From Theory to Practice. BTW 2023: 511-533 - 2022
- [c33]Sarah Kleest-Meißner, Rebecca Sattler, Markus L. Schmid, Nicole Schweikardt, Matthias Weidlich:
Discovering Event Queries from Traces: Laying Foundations for Subsequence-Queries with Wildcards and Gap-Size Constraints. ICDT 2022: 18:1-18:21 - [c32]Joel D. Day, Maria Kosche, Florin Manea, Markus L. Schmid:
Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems. ISAAC 2022: 64:1-64:18 - [c31]Markus L. Schmid, Nicole Schweikardt:
Query Evaluation over SLP-Represented Document Databases with Complex Document Editing. PODS 2022: 79-89 - [c30]Markus L. Schmid, Nicole Schweikardt:
Document Spanners - A Brief Overview of Concepts, Results, and Recent Developments. PODS 2022: 139-150 - 2021
- [c29]Markus L. Schmid, Nicole Schweikardt:
A Purely Regular Approach to Non-Regular Core Spanners. ICDT 2021: 4:1-4:19 - [c28]Katrin Casel, Markus L. Schmid:
Fine-Grained Complexity of Regular Path Queries. ICDT 2021: 19:1-19:20 - [c27]Markus L. Schmid, Nicole Schweikardt:
Spanner Evaluation over SLP-Compressed Documents. PODS 2021: 153-165 - 2020
- [c26]Markus L. Schmid:
Conjunctive Regular Path Queries with String Variables. PODS 2020: 361-374 - 2019
- [c25]Florin Manea, Markus L. Schmid:
Matching Patterns with Variables. WORDS 2019: 1-27 - [c24]Katrin Casel, Joel D. Day, Pamela Fleischmann, Tomasz Kociumaka, Florin Manea, Markus L. Schmid:
Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number. ICALP 2019: 109:1-109:16 - 2018
- [c23]Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka, Markus L. Schmid:
On Matching Generalised Repetitive Patterns. DLT 2018: 269-281 - [c22]Laurent Bulteau, Markus L. Schmid:
Consensus Strings with Small Maximum Distance and Small Distance Sum. MFCS 2018: 1:1-1:15 - 2017
- [c21]Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides:
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. MFCS 2017: 30:1-30:15 - [c20]Dominik D. Freydenberger, Markus L. Schmid:
Deterministic Regular Expressions with Back-References. STACS 2017: 33:1-33:14 - 2016
- [c19]Florin Manea, Dirk Nowotka, Markus L. Schmid:
On the Solvability Problem for Restricted Classes of Word Equations. DLT 2016: 306-318 - [c18]Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, Markus L. Schmid:
On the Complexity of Grammar-Based Compression over Fixed Alphabets. ICALP 2016: 122:1-122:14 - 2015
- [c17]Markus L. Schmid:
Computing Equality-Free String Factorisations. CiE 2015: 313-323 - [c16]Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, D. Gnanaraj Thomas:
Scanning Pictures the Boustrophedon Way. IWCIA 2015: 202-216 - [c15]Markus L. Schmid:
Finding Consensus Strings with Small Length Difference Between Input and Solution Strings. MFCS (2) 2015: 542-554 - [c14]Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid:
Pattern Matching with Variables: Fast Algorithms and New Hardness Results. STACS 2015: 302-315 - [c13]Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid:
Jumping Finite Automata: Characterizations and Complexity. CIAA 2015: 89-101 - 2014
- [c12]Markus L. Schmid:
Characterising REGEX Languages by Regular Languages Equipped with Factor-Referencing. Developments in Language Theory 2014: 142-153 - [c11]Joel D. Day, Daniel Reidenbach, Markus L. Schmid:
Closure Properties of Pattern Languages. Developments in Language Theory 2014: 279-290 - 2013
- [c10]Henning Fernau, Markus L. Schmid:
Pattern Matching with Variables: A Multivariate Complexity Analysis. CPM 2013: 83-94 - [c9]Henning Fernau, Markus L. Schmid, Yngve Villanger:
On the Parameterised Complexity of String Morphism Problems. FSTTCS 2013: 55-66 - [c8]Henning Fernau, Markus L. Schmid, K. G. Subramanian:
Two-dimensional pattern languages. NCMA 2013: 117-132 - [c7]Henning Fernau, Rudolf Freund, Sergiu Ivanov, Markus L. Schmid, K. G. Subramanian:
Array Insertion and Deletion P Systems. UCNC 2013: 67-78 - 2012
- [c6]Markus L. Schmid:
Inside the Class of REGEX Languages. Developments in Language Theory 2012: 73-84 - [c5]Daniel Reidenbach, Markus L. Schmid:
Regular and Context-Free Pattern Languages over Small Alphabets. Developments in Language Theory 2012: 130-141 - [c4]Daniel Reidenbach, Markus L. Schmid:
Patterns with Bounded Treewidth. LATA 2012: 468-479 - [c3]Daniel Reidenbach, Markus L. Schmid:
Automata with Modulo Counters and Nondeterministic Counter Bounds. CIAA 2012: 361-368 - 2011
- [c2]Daniel Reidenbach, Markus L. Schmid:
Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access. LATA 2011: 465-476 - 2010
- [c1]Daniel Reidenbach, Markus L. Schmid:
A Polynomial Time Match Test for Large Classes of Extended Regular Expressions. CIAA 2010: 241-250
Informal and Other Publications
- 2024
- [i19]Markus Lohrey, Markus L. Schmid:
Enumeration for MSO-Queries on Compressed Trees. CoRR abs/2403.03067 (2024) - [i18]Florin Manea, Jonas Richardsen, Markus L. Schmid:
Subsequences With Generalised Gap Constraints: Upper and Lower Complexity Bounds. CoRR abs/2404.10497 (2024) - [i17]Cristian Riveros, Markus L. Schmid, Nicole Schweikardt:
A framework for extraction and transformation of documents. CoRR abs/2405.12350 (2024) - [i16]Pawel Gawrychowski, Florin Manea, Markus L. Schmid:
Revisiting Weighted Information Extraction: A Simpler and Faster Algorithm for Ranked Enumeration. CoRR abs/2409.18563 (2024) - 2022
- [i15]Joel D. Day, Maria Kosche, Florin Manea, Markus L. Schmid:
Subsequences With Gap Constraints: Complexity Bounds for Matching and Analysis Problems. CoRR abs/2206.13896 (2022) - [i14]Markus L. Schmid:
Extending Shinohara's Algorithm for Computing Descriptive (Angluin-Style) Patterns to Subsequence Patterns. CoRR abs/2206.13918 (2022) - 2021
- [i13]Katrin Casel, Markus L. Schmid:
Fine-Grained Complexity of Regular Path Queries. CoRR abs/2101.01945 (2021) - [i12]Markus L. Schmid, Nicole Schweikardt:
Spanner Evaluation over SLP-Compressed Documents. CoRR abs/2101.10890 (2021) - 2020
- [i11]Katrin Casel, Tobias Friedrich, Stefan Neubert, Markus L. Schmid:
Shortest Distances as Enumeration Problem. CoRR abs/2005.06827 (2020) - [i10]Markus L. Schmid, Nicole Schweikardt:
A Purely Regular Approach to Non-Regular Core Spanners. CoRR abs/2010.13442 (2020) - 2019
- [i9]Katrin Casel, Joel D. Day, Pamela Fleischmann, Tomasz Kociumaka, Florin Manea, Markus L. Schmid:
Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number. CoRR abs/1902.10983 (2019) - [i8]Markus L. Schmid:
Regular Expressions with Backreferences: Polynomial-Time Matching Techniques. CoRR abs/1903.05896 (2019) - [i7]Florin Manea, Markus L. Schmid:
Matching Patterns with Variables. CoRR abs/1906.06965 (2019) - [i6]Markus L. Schmid:
Conjunctive Regular Path Queries with String Variables. CoRR abs/1912.09326 (2019) - 2018
- [i5]Dominik D. Freydenberger, Markus L. Schmid:
Deterministic Regular Expressions With Back-References. CoRR abs/1802.01508 (2018) - 2017
- [i4]Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides:
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. CoRR abs/1706.05906 (2017) - [i3]Henning Fernau, Markus L. Schmid, K. G. Subramanian:
Two-Dimensional Pattern Languages. CoRR abs/1707.04083 (2017) - [i2]Daniel Reidenbach, Markus L. Schmid:
A Polynomial Time Match Test for Large Classes of Extended Regular Expressions. CoRR abs/1707.04097 (2017) - 2015
- [i1]Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, Vojtech Vorel:
Characterization and Complexity Results on Jumping Finite Automata. CoRR abs/1512.00482 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
