| Finite state machines for strings over infinite alphabets F Neven, T Schwentick, V Vianu ACM Transactions on Computational Logic (TOCL) 5 (3), 403-435, 2004 | 408* | 2004 |
| Expressiveness and complexity of XML Schema W Martens, F Neven, T Schwentick, GJ Bex ACM Transactions on Database Systems (TODS) 31 (3), 770-813, 2006 | 273* | 2006 |
| XPath containment in the presence of disjunction, DTDs, and variables F Neven, T Schwentick Database Theory—ICDT 2003, 315-329, 2002 | 251 | 2002 |
| Automata theory for XML researchers F Neven ACM Sigmod Record 31 (3), 39-46, 2002 | 244 | 2002 |
| Automata, logic, and XML F Neven Computer Science Logic: 16th International Workshop, CSL 2002 11th Annual …, 2002 | 227 | 2002 |
| DTDs versus XML Schema: A practical study GJ Bex, F Neven, J Van den Bussche Proceedings of the 7th international workshop on the web and databases …, 2004 | 220 | 2004 |
| Query automata over finite trees F Neven, T Schwentick Theoretical Computer Science 275 (1-2), 633-674, 2002 | 209* | 2002 |
| Inference of concise DTDs from XML data GJ Bex, F Neven, T Schwentick, K Tuyls ACM Press, 2006 | 175 | 2006 |
| Learning deterministic regular expressions for the inference of schemas from XML data GJ Bex, W Gelade, F Neven, S Vansummeren ACM Transactions on the Web (TWEB) 4 (4), 1-32, 2010 | 159 | 2010 |
| Inferring XML schema definitions from XML data GJ Bex, F Neven, S Vansummeren VLDB Endowment, 2007 | 159 | 2007 |
| A formal model for an expressive fragment of XSLT GJ Bex, S Maneth, F Neven Information Systems 27 (1), 21-39, 2002 | 159 | 2002 |
| Expressive and efficient pattern languages for tree-structured data F Neven, T Schwentick Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on …, 2000 | 152 | 2000 |
| XML with data values: typechecking revisited N Alon, T Milo, F Neven, D Suciu, V Vianu Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on …, 2001 | 129 | 2001 |
| Inference of concise regular expressions and DTDs GJ Bex, F Neven, T Schwentick, S Vansummeren ACM Transactions on Database Systems (TODS) 35 (2), 1-47, 2010 | 128 | 2010 |
| On the complexity of XPath containment in the presence of disjunction, DTDs, and variables F Neven, T Schwentick arXiv preprint cs/0606065, 2006 | 106 | 2006 |
| Expressiveness of structured document query languages based on attribute grammars F Neven, J Van den Bussche Journal of the ACM (JACM) 49 (1), 56-100, 2002 | 99 | 2002 |
| Frontiers of tractability for typechecking simple XML transformations W Martens, F Neven Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on …, 2004 | 94 | 2004 |
| Relational transducers for declarative networking TJ Ameloot, F Neven, J Van den Bussche Journal of the ACM (JACM) 60 (2), 1-38, 2013 | 93 | 2013 |
| Typechecking top-down uniform unranked tree transducers W Martens, F Neven Database Theory—ICDT 2003: 9th International Conference Siena, Italy …, 2003 | 86 | 2003 |
| Complexity of decision problems for simple regular expressions W Martens, F Neven, T Schwentick Mathematical Foundations of Computer Science 2004: 29th International …, 2004 | 78 | 2004 |
Geert Jan BexHasselt UniversityVerified email at uhasselt.be
