- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j17 |      | Timos Antonopoulos, Floris Geerts, Wim Martens, Frank Neven: Generating, Sampling and Counting Subclasses of Regular Tree Languages. Theory Comput. Syst. 52(3): 542-585 (2013) |
| c25 | | Wojciech Czerwinski, Claire David, Katja Losemann, Wim Martens: Deciding Definability by Deterministic Regular Expressions. FoSSaCS 2013: 289-304 |
| c24 | | |
| c23 | | Claire David, Amélie Gheerbrant, Leonid Libkin, Wim Martens: Containment of pattern-based queries over data trees. ICDT 2013: 201-212 |
| i2 | | Wojciech Czerwinski, Wim Martens, Tomás Masopust: Efficient Separability of Regular Languages by Subsequences and Suffixes. CoRR abs/1303.0966 (2013) |
| 2012 | ||
| j16 | | Henrik Björklund, Wim Martens: The tractability frontier for NFA minimization. J. Comput. Syst. Sci. 78(1): 198-210 (2012) |
| j15 | | Wim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick: Developing and Analyzing XSDs through BonXai. PVLDB 5(12): 1994-1997 (2012) |
| j14 | | Wouter Gelade, Marc Gyssens, Wim Martens: Regular Expressions with Counting: Weak versus Strong Determinism. SIAM J. Comput. 41(1): 160-190 (2012) |
| c22 | | Timos Antonopoulos, Dag Hovland, Wim Martens, Frank Neven: Deciding twig-definability of node selecting tree automata. ICDT 2012: 61-73 |
| c21 | | Katja Losemann, Wim Martens, Matthias Niewerth: Descriptional Complexity of Deterministic Regular Expressions. MFCS 2012: 643-654 |
| c20 | | Katja Losemann, Wim Martens: The complexity of evaluating path expressions in SPARQL. PODS 2012: 101-112 |
| 2011 | ||
| j13 | | Henrik Björklund, Wim Martens, Thomas Schwentick: Conjunctive query containment over trees. J. Comput. Syst. Sci. 77(3): 450-472 (2011) |
| j12 | | Tom J. Ameloot, Maarten Marx, Wim Martens, Frank Neven, Justin van Wees: 30 Years of PODS in facts and figures. SIGMOD Record 40(3): 54-60 (2011) |
| c19 | | Timos Antonopoulos, Floris Geerts, Wim Martens, Frank Neven: Generating, sampling and counting subclasses of regular tree languages. ICDT 2011: 30-41 |
| c18 | | Timos Antonopoulos, Wim Martens, Frank Neven: The complexity of text-preserving XML transformations. PODS 2011: 247-258 |
| 2010 | ||
| j11 | | Henrik Björklund, Wim Martens, Nicole Schweikardt, Thomas Schwentick: Logik und Automaten: ein echtes Dreamteam. Informatik Spektrum 33(5): 452-461 (2010) |
| j10 | | Henrik Björklund, Wouter Gelade, Wim Martens: Incremental XPath evaluation. ACM Trans. Database Syst. 35(4): 29 (2010) |
| c17 | | Wim Martens, Matthias Niewerth, Thomas Schwentick: Schema design for XML repositories: complexity and tractability. PODS 2010: 239-250 |
| c16 | | Wouter Gelade, Tomasz Idziaszek, Wim Martens, Frank Neven: Simplifying XML schema: single-type approximations of regular tree languages. PODS 2010: 251-260 |
| 2009 | ||
| j9 | | Michaela Götz, Christoph Koch, Wim Martens: Efficient algorithms for descendant-only tree pattern queries. Inf. Syst. 34(7): 602-623 (2009) |
| j8 | | Wouter Gelade, Wim Martens, Frank Neven: Optimizing Schema Languages for XML: Numerical Constraints and Interleaving. SIAM J. Comput. 38(5): 2021-2043 (2009) |
| j7 | | Wim Martens, Frank Neven, Thomas Schwentick: Complexity of Decision Problems for XML Schemas and Chain Regular Expressions. SIAM J. Comput. 39(4): 1486-1530 (2009) |
| c15 | | Henrik Björklund, Wouter Gelade, Marcel Marquardt, Wim Martens: Incremental XPath evaluation. ICDT 2009: 162-173 |
| c14 | | Wouter Gelade, Marc Gyssens, Wim Martens: Regular Expressions with Counting: Weak versus Strong Determinism. MFCS 2009: 369-381 |
| c13 | | Geert Jan Bex, Wouter Gelade, Wim Martens, Frank Neven: Simplifying XML schema: effortless handling of nondeterministic regular expressions. SIGMOD Conference 2009: 731-744 |
| 2008 | ||
| j6 | | Wim Martens, Frank Neven, Marc Gyssens: Typechecking top-down XML transformations: Fixed input or output schemas. Inf. Comput. 206(7): 806-827 (2008) |
| c12 |  | Wim Martens, Frank Neven, Thomas Schwentick: Deterministic top-down tree automata: past, present, and future. Logic and Automata 2008: 505-530 |
| c11 | | Henrik Björklund, Wim Martens: The Tractability Frontier for NFA Minimization. ICALP (2) 2008: 27-38 |
| c10 | | Henrik Björklund, Wim Martens, Thomas Schwentick: Optimizing Conjunctive Queries over Trees Using Schema Information. MFCS 2008: 132-143 |
| 2007 | ||
| j5 | | Wim Martens, Frank Neven: Frontiers of tractability for typechecking simple XML transformations. J. Comput. Syst. Sci. 73(3): 362-390 (2007) |
| j4 | | Wim Martens, Joachim Niehren: On the minimization of XML Schemas and tree automata for unranked trees. J. Comput. Syst. Sci. 73(4): 550-583 (2007) |
| j3 | | Wim Martens, Frank Neven, Thomas Schwentick: Simple off the shelf abstractions for XML schema. SIGMOD Record 36(3): 15-22 (2007) |
| c9 | | Michaela Götz, Christoph Koch, Wim Martens: Efficient Algorithms for the Tree Homeomorphism Problem. DBPL 2007: 17-31 |
| c8 | | Henrik Björklund, Wim Martens, Thomas Schwentick: Conjunctive Query Containment over Trees. DBPL 2007: 66-80 |
| c7 | | Wouter Gelade, Wim Martens, Frank Neven: Optimizing Schema Languages for XML: Numerical Constraints and Interleaving. ICDT 2007: 269-283 |
| 2006 | ||
| j2 | | Wim Martens, Frank Neven, Thomas Schwentick, Geert Jan Bex: Expressiveness and complexity of XML Schema. ACM Trans. Database Syst. 31(3): 770-813 (2006) |
| i1 | | Wim Martens, Frank Neven, Marc Gyssens: On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas. CoRR abs/cs/0606094 (2006) |
| 2005 | ||
| j1 | | Wim Martens, Frank Neven: On the complexity of typechecking top-down XML transformations. Theor. Comput. Sci. 336(1): 153-180 (2005) |
| c6 | | |
| c5 | | Wim Martens, Frank Neven, Thomas Schwentick: Which XML Schemas Admit 1-Pass Preorder Typing? ICDT 2005: 68-82 |
| c4 | | Geert Jan Bex, Wim Martens, Frank Neven, Thomas Schwentick: Expressiveness of XSDs: from practice to theory, there and back again. WWW 2005: 712-721 |
| 2004 | ||
| c3 | | Wim Martens, Frank Neven, Thomas Schwentick: Complexity of Decision Problems for Simple Regular Expressions. MFCS 2004: 889-900 |
| c2 | | Wim Martens, Frank Neven: Frontiers of Tractability for Typechecking Simple XML Transformations. PODS 2004: 23-34 |
| 2003 | ||
| c1 | | |
Data released under the ODC-BY 1.0 license — See also our legal information page