| 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 | 300* | 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 | 234* | 2006 |
| Automata Theory for XML Researchers. F Neven AMC, 2002 | 227 | 2002 |
| XPath containment in the presence of disjunction, DTDs, and variables F Neven, T Schwentick Database Theory—ICDT 2003, 315-329, 2002 | 222 | 2002 |
| Automata, logic, and XML F Neven International Workshop on Computer Science Logic, 2-26, 2002 | 211 | 2002 |
| Query automata over finite trees F Neven, T Schwentick Theoretical Computer Science 275 (1-2), 633-674, 2002 | 205* | 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 | 193 | 2004 |
| A formal model for an expressive fragment of XSLT GJ Bex, S Maneth, F Neven Information Systems 27 (1), 21-39, 2002 | 145 | 2002 |
| Inference of concise DTDs from XML data GJ Bex, F Neven, T Schwentick, K Tuyls Proceedings of the 32nd international conference on Very large data bases …, 2006 | 142 | 2006 |
| Expressive and efficient pattern languages for tree-structured data F Neven, T Schwentick Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on …, 2000 | 134 | 2000 |
| Inferring XML schema definitions from XML data GJ Bex, F Neven, S Vansummeren Proceedings of the 33rd international conference on Very large data bases …, 2007 | 130 | 2007 |
| 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), 14, 2010 | 121 | 2010 |
| XML with data values: typechecking revisited N Alon, T Milo, F Neven, D Suciu, V Vianu Journal of Computer and System Sciences 66 (4), 688-727, 2003 | 120 | 2003 |
| Frontiers of tractability for typechecking simple XML transformations W Martens, F Neven Journal of Computer and System Sciences 73 (3), 362-390, 2007 | 110 | 2007 |
| 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 | 102 | 2002 |
| On the complexity of XPath containment in the presence of disjunction, DTDs, and variables F Neven, T Schwentick arXiv preprint cs/0606065, 2006 | 96 | 2006 |
| Succinctness of the complement and intersection of regular expressions W Gelade, F Neven ACM Transactions on Computational Logic (TOCL) 13 (1), 4, 2012 | 90 | 2012 |
| Inference of concise regular expressions and DTDs GJ Bex, F Neven, T Schwentick, S Vansummeren ACM Transactions on Database Systems (TODS) 35 (2), 11, 2010 | 89 | 2010 |
| Relational transducers for declarative networking TJ Ameloot, F Neven, J Van den Bussche Journal of the ACM (JACM) 60 (2), 15, 2013 | 76 | 2013 |
| Typechecking top-down uniform unranked tree transducers W Martens, F Neven International Conference on Database Theory, 64-78, 2003 | 75 | 2003 |
Geert Jan BexHasselt UniversityGeverifieerd e-mailadres voor uhasselt.be
