Matthias Niewerth

According to our database1, Matthias Niewerth authored at least 18 papers between 2010 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Reasoning About XML Constraints Based on XML-to-Relational Mappings.
Theory Comput. Syst., 2018

Minimization of Tree Patterns.
J. ACM, 2018

Constant-Delay Enumeration for Nondeterministic Document Spanners.
CoRR, 2018

Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic Updates.
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017
BonXai: Combining the Simplicity of DTD with the Expressiveness of XML Schema.
ACM Trans. Database Syst., 2017

Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data.
SIGMOD Record, 2017

2016
Data definition languages for XML repository management systems.
PhD thesis, 2016

Closure properties and descriptional complexity of deterministic regular expressions.
Theor. Comput. Sci., 2016

On the state complexity of closures and interiors of regular languages with subwords and superwords.
Theor. Comput. Sci., 2016

Minimization of Tree Pattern Queries.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

2015
BonXai: Combining the simplicity of DTD with the expressiveness of XML Schema.
Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

Definability by Weakly Deterministic Regular Expressions with Counters is Decidable.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014
Reasoning about XML Constraints based on XML-to-relational mappings.
Proceedings of the Proc. 17th International Conference on Database Theory (ICDT), 2014

2012
Developing and Analyzing XSDs through BonXai.
PVLDB, 2012

Descriptional Complexity of Deterministic Regular Expressions.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011
Two-variable logic and key constraints on data words.
Proceedings of the Database Theory, 2011

2010
Schema design for XML repositories: complexity and tractability.
Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010


  Loading...