The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Wim Martens: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Wim Martens, Joachim Niehren
    Minimizing Tree Automata for Unranked Trees. [Citation Graph (0, 0)][DBLP]
    DBPL, 2005, pp:232-246 [Conf]
  2. Wim Martens, Frank Neven
    Typechecking Top-Down Uniform Unranked Tree Transducers. [Citation Graph (0, 0)][DBLP]
    ICDT, 2003, pp:64-78 [Conf]
  3. Wim Martens, Frank Neven, Thomas Schwentick
    Which XML Schemas Admit 1-Pass Preorder Typing? [Citation Graph (0, 0)][DBLP]
    ICDT, 2005, pp:68-82 [Conf]
  4. Wouter Gelade, Wim Martens, Frank Neven
    Optimizing Schema Languages for XML: Numerical Constraints and Interleaving. [Citation Graph (0, 0)][DBLP]
    ICDT, 2007, pp:269-283 [Conf]
  5. Wim Martens, Frank Neven, Thomas Schwentick
    Complexity of Decision Problems for Simple Regular Expressions. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:889-900 [Conf]
  6. Wim Martens, Frank Neven
    Frontiers of Tractability for Typechecking Simple XML Transformations. [Citation Graph (0, 0)][DBLP]
    PODS, 2004, pp:23-34 [Conf]
  7. Geert Jan Bex, Wim Martens, Frank Neven, Thomas Schwentick
    Expressiveness of XSDs: from practice to theory, there and back again. [Citation Graph (0, 0)][DBLP]
    WWW, 2005, pp:712-721 [Conf]
  8. Wim Martens, Frank Neven
    Frontiers of tractability for typechecking simple XML transformations. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:3, pp:362-390 [Journal]
  9. Wim Martens, Joachim Niehren
    On the minimization of XML Schemas and tree automata for unranked trees. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:4, pp:550-583 [Journal]
  10. Wim Martens, Frank Neven
    On the complexity of typechecking top-down XML transformations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:336, n:1, pp:153-180 [Journal]
  11. Wim Martens, Frank Neven, Thomas Schwentick, Geert Jan Bex
    Expressiveness and complexity of XML Schema. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2006, v:31, n:3, pp:770-813 [Journal]
  12. Henrik Björklund, Wim Martens, Thomas Schwentick
    Conjunctive Query Containment over Trees. [Citation Graph (0, 0)][DBLP]
    DBPL, 2007, pp:66-80 [Conf]
  13. Michaela Götz, Christoph Koch, Wim Martens
    Efficient Algorithms for the Tree Homeomorphism Problem. [Citation Graph (0, 0)][DBLP]
    DBPL, 2007, pp:17-31 [Conf]
  14. Wim Martens, Frank Neven, Marc Gyssens
    On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  15. The Tractability Frontier for NFA Minimization. [Citation Graph (, )][DBLP]


  16. Incremental XPath evaluation. [Citation Graph (, )][DBLP]


  17. Optimizing Conjunctive Queries over Trees Using Schema Information. [Citation Graph (, )][DBLP]


  18. Regular Expressions with Counting: Weak versus Strong Determinism. [Citation Graph (, )][DBLP]


  19. Simplifying XML schema: single-type approximations of regular tree languages. [Citation Graph (, )][DBLP]


  20. Schema design for XML repositories: complexity and tractability. [Citation Graph (, )][DBLP]


  21. Simplifying XML schema: effortless handling of nondeterministic regular expressions. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002