Martens, Wim - Fachbereich Informatik, Universität Dortmund

• Expressiveness of XSDs: from Practice to Theory, There and Back Again
• The Tractability Frontier for NFA Minimization6 Henrik Bjorklunda
• The Tractability Frontier for NFA Minimization Henrik Bjorklund and Wim Martens
• Conjunctive Query Containment over Trees Henrik Bjorklund, Wim Martens, and Thomas Schwentick
• OPTIMIZING SCHEMA LANGUAGES FOR XML: NUMERICAL CONSTRAINTS AND INTERLEAVING
• Generating, sampling and counting subclasses of regular tree languages
• On the Minimization of XML Schemas and Tree Automata for Unranked Trees
• Incremental XPath Evaluation Henrik Bjrklund
• Optimizing Schema Languages for XML: Numerical Constraints and Interleaving
• Conjunctive Query Containment over Trees Henrik Bjorklund Wim Martens Thomas Schwentick
• Incremental XPath Evaluation HENRIK BJORKLUND
• Incremental XPath Evaluation Wim Martens
• Simplifying XML Schema: Effortless Handling of Nondeterministic Regular Expressions
• Efficient Algorithms for Descendant-Only Tree Pattern Michaela Gotza
• The Tractability Frontier for NFA Minimization Henrik Bjorklund Wim Martens
• Deterministic Top-Down Tree Automata: Past, Present, and Future
• Efficient Algorithms for the Tree Homeomorphism Problem
• Simple off the shelf abstractions for XML Schema Wim Martens
• Frontiers of Tractability for Typechecking Simple XML Transformations
• Acknowledgments I would like to take this opportunity to thank the many people who have contributed
• XML Schemas Admitting 1-Pass Preorder Typing
• Minimizing Tree Automata for Unranked Trees
• The Typechecking Problem for XML Transformations: Methods and Formal Models
• On the Complexity of Typechecking Top-Down XML Transformations
• Complexity of Decision Problems for Simple Regular Expressions
• Frontiers of Tractability for Typechecking Simple XML Transformations
• Frontiers of Tractability for Typechecking Simple XML
• Typechecking Top-Down XML Transformations
• Simplifying XML Schema: Single-Type Approximations of Regular Tree Languages
• Complexity of Decision Problems for Simple Regular Expressions
• Schema Design for XML Repositories: Complexity and Tractability
• Regular Expressions with Counting: Weak versus Strong Determinism
• Conjunctive Query Containment over Trees Henrik Bjorklund Wim Martens Thomas Schwentick
• Regular Expressions with Counting: Weak versus Strong Determinism
• Typechecking Top-Down XML Tranformations: Fixed Input or Output
• COMPLEXITY OF DECISION PROBLEMS FOR XML SCHEMAS AND CHAIN REGULAR EXPRESSIONS
• Expressiveness and Complexity of XML Schema WIM MARTENS
• Optimizing Schema Languages for XML: Numerical Constraints and Interleaving
• Typechecking Top-Down Uniform Unranked Tree Transducers
• XML Research for Formal Language Theorists Wim Martens
• Simplifying XML Schema: Effortless Handling of Nondeterministic Regular Expressions