| 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 | 344* | 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 | 255* | 2006 |
| Automata theory for XML researchers F Neven ACM Sigmod Record 31 (3), 39-46, 2002 | 239 | 2002 |
| XPath containment in the presence of disjunction, DTDs, and variables F Neven, T Schwentick Database Theory—ICDT 2003, 315-329, 2002 | 239 | 2002 |
| Automata, logic, and XML F Neven International Workshop on Computer Science Logic, 2-26, 2002 | 215 | 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 | 209 | 2004 |
| Query automata over finite trees F Neven, T Schwentick Theoretical Computer Science 275 (1-2), 633-674, 2002 | 203* | 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 | 158 | 2006 |
| 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 | 148 | 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), 1-32, 2010 | 143 | 2010 |
| Expressive and efficient pattern languages for tree-structured data F Neven, T Schwentick Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on …, 2000 | 141 | 2000 |
| 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 | 123 | 2003 |
| 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 | 109 | 2010 |
| A formal model for an expressive fragment of XSLT GJ Bex, S Maneth, F Neven Information Systems 27 (1), 21-39, 2002 | 109 | 2002 |
| On the complexity of XPath containment in the presence of disjunction, DTDs, and variables F Neven, T Schwentick arXiv preprint cs/0606065, 2006 | 104 | 2006 |
| Competitor analysis and its defenses in the e-marketplace YP Sheng, PP Mykytyn Jr, CR Litecky Communications of the ACM 48 (8), 107-112, 2005 | 101* | 2005 |
| Frontiers of tractability for typechecking simple XML transformations W Martens, F Neven Journal of Computer and System Sciences 73 (3), 362-390, 2007 | 86 | 2007 |
| Automata: from logics to algorithms. MY Vardi, T Wilke Logic and automata 2, 629-736, 2008 | 83* | 2008 |
| Relational transducers for declarative networking TJ Ameloot, F Neven, J Van den Bussche Journal of the ACM (JACM) 60 (2), 1-38, 2013 | 82 | 2013 |
| Typechecking top-down uniform unranked tree transducers W Martens, F Neven International Conference on Database Theory, 64-78, 2003 | 82 | 2003 |
Geert Jan BexHasselt UniversityGeverifieerd e-mailadres voor uhasselt.be
