Follow
Frank Neven
Frank Neven
Professor of Computer Science, Hasselt University
Verified email at uhasselt.be - Homepage
Title
Cited by
Cited by
Year
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
393*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
272*2006
XPath containment in the presence of disjunction, DTDs, and variables
F Neven, T Schwentick
Database Theory—ICDT 2003, 315-329, 2002
2432002
Automata theory for XML researchers
F Neven
ACM Sigmod Record 31 (3), 39-46, 2002
2392002
Automata, logic, and XML
F Neven
International Workshop on Computer Science Logic, 2-26, 2002
2192002
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
2172004
Query automata over finite trees
F Neven, T Schwentick
Theoretical Computer Science 275 (1-2), 633-674, 2002
201*2002
Inference of concise DTDs from XML data
GJ Bex, F Neven, T Schwentick, K Tuyls
ACM Press, 2006
1692006
Inferring XML schema definitions from XML data
GJ Bex, F Neven, S Vansummeren
VLDB Endowment, 2007
1592007
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
1572010
A formal model for an expressive fragment of XSLT
GJ Bex, S Maneth, F Neven
Information Systems 27 (1), 21-39, 2002
1522002
Expressive and efficient pattern languages for tree-structured data
F Neven, T Schwentick
Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on …, 2000
1482000
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
1232010
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
1192001
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
F Neven, T Schwentick
arXiv preprint cs/0606065, 2006
1072006
Frontiers of tractability for typechecking simple XML transformations
W Martens, F Neven
Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on …, 2004
902004
Relational transducers for declarative networking
TJ Ameloot, F Neven, J Van den Bussche
Journal of the ACM (JACM) 60 (2), 1-38, 2013
892013
Typechecking top-down uniform unranked tree transducers
W Martens, F Neven
International Conference on Database Theory, 64-78, 2003
812003
Complexity of decision problems for simple regular expressions
W Martens, F Neven, T Schwentick
International Symposium on Mathematical Foundations of Computer Science, 889-900, 2004
772004
Extensions of attribute grammars for structured document queries
F Neven
International Symposium on Database Programming Languages, 99-117, 1999
751999
The system can't perform the operation now. Try again later.
Articles 1–20