Frank Neven 个人学术档案 - 学术资源搜索

引用次数

	总计	2019 年至今
引用	5139	753
h 指数	38	16
i10 指数	67	22

340

170

255

1999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202419 51 49 120 219 204 257 234 288 276 329 300 281 297 264 184 289 236 186 196 199 126 132 122 123 51

开放获取的出版物数量

查看全部

32 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Thomas SchwentickProfessor of Computer Science, TU Dortmund University在 udo.edu 的电子邮件经过验证
Wim MartensUniversity of Bayreuth在 uni-bayreuth.de 的电子邮件经过验证
Geert Jan BexHasselt University在 uhasselt.be 的电子邮件经过验证
Stijn VansummerenProfessor of Computer Science, Hasselt University在 uhasselt.be 的电子邮件经过验证
Jan Van den BusscheProfessor, Hasselt University在 uhasselt.be 的电子邮件经过验证
Bas KetsmanVrije Universiteit Brussel (VUB)在 vub.be 的电子邮件经过验证
Wouter GeladeNational Bank of Belgium and University of Namur在 unamur.be 的电子邮件经过验证
Dan SuciuUniversity of Washington在 cs.washington.edu 的电子邮件经过验证
Tova MiloProfessor of Computer Science, Tel Aviv University在 cs.tau.ac.il 的电子邮件经过验证
Sebastian ManethProfessor für Informatik, Universität Bremen在 uni-bremen.de 的电子邮件经过验证
Leonid LibkinProfessor of Computer Science, University of Edinburgh在 inf.ed.ac.uk 的电子邮件经过验证
Marcelo ArenasProfessor of Computer Science, Pontificia Universidad Católica de Chile and IMFD Chile.在 ing.puc.cl 的电子邮件经过验证
Benny KimelfeldTechnion - Israel Institute of Technology在 cs.technion.ac.il 的电子邮件经过验证
Floris GeertsUniversity of Antwerp在 uantwerp.be 的电子邮件经过验证
Serge AbiteboulINRIA Saclay在 inria.fr 的电子邮件经过验证
Wenfei FanProfessor of Web Data Management, University of Edinburgh在 inf.ed.ac.uk 的电子邮件经过验证
Christoph KochProfessor of Computer Science, EPFL在 epfl.ch 的电子邮件经过验证
Noga AlonPrinceton University and Tel Aviv University在 tau.ac.il 的电子邮件经过验证
Anastasios KementsietsidisGoogle Research在 google.com 的电子邮件经过验证
Timos Antonopoulos在 yale.edu 的电子邮件经过验证

关注

Frank Neven

Professor of Computer Science, Hasselt University

在 uhasselt.be 的电子邮件经过验证 - 首页

Databases


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
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	423*	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	271*	2006
XPath containment in the presence of disjunction, DTDs, and variables F Neven, T Schwentick Database Theory—ICDT 2003, 315-329, 2002	253	2002
Automata theory for XML researchers F Neven ACM Sigmod Record 31 (3), 39-46, 2002	244	2002
Automata, logic, and XML F Neven International Workshop on Computer Science Logic, 2-26, 2002	226	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	224	2004
Query automata over finite trees F Neven, T Schwentick Theoretical Computer Science 275 (1-2), 633-674, 2002	206*	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	174	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	161	2010
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	161	2007
Expressive and efficient pattern languages for tree-structured data F Neven, T Schwentick Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on …, 2000	153	2000
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	131	2010
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	131	2001
A formal model for an expressive fragment of XSLT GJ Bex, S Maneth, F Neven Information Systems 27 (1), 21-39, 2002	115	2002
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables F Neven, T Schwentick Logical Methods in Computer Science 2, 2006	104	2006
Relational transducers for declarative networking TJ Ameloot, F Neven, J Van den Bussche Journal of the ACM (JACM) 60 (2), 1-38, 2013	103	2013
Frontiers of tractability for typechecking simple XML transformations W Martens, F Neven Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on …, 2004	93	2004
Typechecking top-down uniform unranked tree transducers W Martens, F Neven International Conference on Database Theory, 64-78, 2002	86	2002
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	78	2004
Extensions of attribute grammars for structured document queries F Neven International Symposium on Database Programming Languages, 99-117, 1999	78	1999

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用