Wim Martens

From MaRDI portal
Person:265076

Available identifiers

zbMath Open martens.wimMaRDI QIDQ265076

List of research outcomes

PublicationDate of PublicationType
A Trichotomy for Regular Trail Queries2024-01-16Paper
The Complexity of Aggregates over Extractions by Regular Expressions2023-08-26Paper
https://portal.mardi4nfdi.de/entity/Q58742772023-02-07Paper
Weight Annotation in Information Extraction2023-02-07Paper
Formal languages in information extraction and graph databases2022-12-16Paper
https://portal.mardi4nfdi.de/entity/Q50284762022-02-09Paper
Learning algorithms2022-02-04Paper
https://portal.mardi4nfdi.de/entity/Q33053602020-08-06Paper
Evaluation and Enumeration Problems for Regular Path Queries2020-08-06Paper
Minimization of Tree Patterns2019-02-25Paper
https://portal.mardi4nfdi.de/entity/Q45602192018-12-10Paper
Querying Graphs with Data2018-08-02Paper
MSO queries on trees2018-04-23Paper
Conjunctive query containment over trees using schema information2018-02-28Paper
Deciding definability by deterministic regular expressions2017-06-30Paper
https://portal.mardi4nfdi.de/entity/Q57389372017-06-13Paper
Deciding twig-definability of node selecting tree automata2016-04-18Paper
Closure properties and descriptional complexity of deterministic regular expressions2016-04-01Paper
A Note on Decidable Separability by Piecewise Testable Languages2015-09-29Paper
The complexity of regular expressions and property paths in SPARQL2015-09-03Paper
Simplifying XML schema: single-type approximations of regular tree languages2014-01-20Paper
Validity of Tree Pattern Queries with Respect to Schema Information2013-09-20Paper
Generating, sampling and counting subclasses of regular tree languages2013-08-23Paper
Efficient Separability of Regular Languages by Subsequences and Suffixes2013-08-07Paper
Deciding Definability by Deterministic Regular Expressions2013-03-18Paper
Descriptional Complexity of Deterministic Regular Expressions2012-09-25Paper
Regular Expressions with Counting: Weak versus Strong Determinism2012-05-30Paper
The tractability frontier for NFA minimization2012-05-11Paper
Conjunctive query containment over trees2011-05-04Paper
https://portal.mardi4nfdi.de/entity/Q30869312011-03-30Paper
Complexity of Decision Problems for XML Schemas and Chain Regular Expressions2010-09-06Paper
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving2009-11-06Paper
Regular Expressions with Counting: Weak versus Strong Determinism2009-10-16Paper
Optimizing Conjunctive Queries over Trees Using Schema Information2009-02-03Paper
The Tractability Frontier for NFA Minimization2008-08-19Paper
Typechecking top-down XML transformations: Fixed input or output schemas2008-08-14Paper
On the minimization of XML schemas and tree automata for unranked trees2007-05-23Paper
Frontiers of tractability for typechecking simple XML transformations2007-04-26Paper
Database Programming Languages2006-10-20Paper
Database Theory - ICDT 20052005-09-13Paper
Mathematical Foundations of Computer Science 20042005-08-22Paper
On the complexity of typechecking top-down XML transformations2005-06-10Paper
https://portal.mardi4nfdi.de/entity/Q44145262003-07-25Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Wim Martens