Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Frank Neven
2010 – today
- 2013
[j36]Tom J. Ameloot, Frank Neven, Jan Van den Bussche: Relational transducers for declarative networking. J. ACM 60(2): 15 (2013)- [j35]Wouter Gelade, Tomasz Idziaszek, Wim Martens, Frank Neven, Jan Paredaens: Simplifying XML Schema: Single-type approximations of regular tree languages. J. Comput. Syst. Sci. 79(6): 910-936 (2013)
- [j34]Timos Antonopoulos, Floris Geerts, Wim Martens, Frank Neven: Generating, Sampling and Counting Subclasses of Regular Tree Languages. Theory Comput. Syst. 52(3): 542-585 (2013)
- [j33]Wenfei Fan, Floris Geerts, Frank Neven: Making Queries Tractable on Big Data with Preprocessing. PVLDB 6(9): 685-696 (2013)
- [j32]Peter Boyen, Frank Neven, Dries Van Dyck, Felipe L. Valentim, Aalt D. J. van Dijk: Mining Minimal Motif Pair Sets Maximally Covering Interactions in a Protein-Protein Interaction Network. IEEE/ACM Trans. Comput. Biology Bioinform. 10(1): 73-86 (2013)
- [c50]Timos Antonopoulos, Frank Neven, Frédéric Servais: Definability problems for graph query languages. ICDT 2013: 141-152
- [c49]Marcelo Arenas, Jonny Daenen, Frank Neven, Martin Ugarte, Jan Van den Bussche, Stijn Vansummeren: Discovering XSD keys from XML data. SIGMOD Conference 2013: 61-72
- 2012
- [j31]Wim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick: Developing and Analyzing XSDs through BonXai. PVLDB 5(12): 1994-1997 (2012)
- [j30]Wouter Gelade, Frank Neven: Succinctness of the Complement and Intersection of Regular Expressions. ACM Trans. Comput. Log. 13(1): 4 (2012)
- [c48]Timos Antonopoulos, Dag Hovland, Wim Martens, Frank Neven: Deciding twig-definability of node selecting tree automata. ICDT 2012: 61-73
- 2011
- [j29]Wouter Gelade, Frank Neven: Succinctness of pattern-based schema languages for XML. J. Comput. Syst. Sci. 77(3): 505-519 (2011)
- [j28]Tom J. Ameloot, Maarten Marx, Wim Martens, Frank Neven, Justin van Wees: 30 Years of PODS in facts and figures. SIGMOD Record 40(3): 54-60 (2011)
- [j27]Peter Boyen, Dries Van Dyck, Frank Neven, Roeland C. H. J. van Ham, Aalt D. J. van Dijk: SLIDER: A Generic Metaheuristic for the Discovery of Correlated Motifs in Protein-Protein Interaction Networks. IEEE/ACM Trans. Comput. Biology Bioinform. 8(5): 1344-1357 (2011)
- [c47]Timos Antonopoulos, Floris Geerts, Wim Martens, Frank Neven: Generating, sampling and counting subclasses of regular tree languages. ICDT 2011: 30-41
- [c46]Timos Antonopoulos, Wim Martens, Frank Neven: The complexity of text-preserving XML transformations. PODS 2011: 247-258
- [c45]Tom J. Ameloot, Frank Neven, Jan Van den Bussche: Relational transducers for declarative networking. PODS 2011: 283-292
- 2010
- [j26]Wouter Gelade, Frank Neven: Optimizing the Region Algebra is PSPACE-complete. Inf. Process. Lett. 110(16): 639-643 (2010)
- [j25]Geert Jan Bex, Frank Neven, Thomas Schwentick, Stijn Vansummeren: Inference of concise regular expressions and DTDs. ACM Trans. Database Syst. 35(2) (2010)
- [j24]Geert Jan Bex, Wouter Gelade, Frank Neven, Stijn Vansummeren: Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data. TWEB 4(4) (2010)
- [c44]Wouter Gelade, Tomasz Idziaszek, Wim Martens, Frank Neven: Simplifying XML schema: single-type approximations of regular tree languages. PODS 2010: 251-260
- [i5]Geert Jan Bex, Wouter Gelade, Frank Neven, Stijn Vansummeren: Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data. CoRR abs/1004.2372 (2010)
- [i4]Tom J. Ameloot, Frank Neven, Jan Van den Bussche: Relational transducers for declarative networking. CoRR abs/1012.2858 (2010)
2000 – 2009
- 2009
- [j23]Wouter Gelade, Wim Martens, Frank Neven: Optimizing Schema Languages for XML: Numerical Constraints and Interleaving. SIAM J. Comput. 38(5): 2021-2043 (2009)
- [j22]Wim Martens, Frank Neven, Thomas Schwentick: Complexity of Decision Problems for XML Schemas and Chain Regular Expressions. SIAM J. Comput. 39(4): 1486-1530 (2009)
- [c43]Peter Boyen, Frank Neven, Dries Van Dyck, Aalt-Jan van Dijk, Roeland C. H. J. van Ham: SLIDER: Mining Correlated Motifs in Protein-Protein Interaction Networks. ICDM 2009: 716-721
- [c42]Geert Jan Bex, Wouter Gelade, Wim Martens, Frank Neven: Simplifying XML schema: effortless handling of nondeterministic regular expressions. SIGMOD Conference 2009: 731-744
- [r1]
- 2008
- [j21]Wim Martens, Frank Neven, Marc Gyssens: Typechecking top-down XML transformations: Fixed input or output schemas. Inf. Comput. 206(7): 806-827 (2008)
- [j20]Anastasios Kementsietsidis, Frank Neven, Dieter Van de Craen, Stijn Vansummeren: Scalable multi-query optimization for exploratory queries over federated scientific databases. PVLDB 1(1): 16-27 (2008)
- [j19]Wenfei Fan, Floris Geerts, Frank Neven: Expressiveness and complexity of XML publishing transducers. ACM Trans. Database Syst. 33(4) (2008)
- [c41]Wim Martens, Frank Neven, Thomas Schwentick: Deterministic top-down tree automata: past, present, and future. Logic and Automata 2008: 505-530
- [c40]Anastasios Kementsietsidis, Frank Neven, Dieter Van de Craen: BioScout: a life-science query monitoring system. EDBT 2008: 730-734
- [c39]Wenfei Fan, Floris Geerts, Wouter Gelade, Frank Neven, Antonella Poggi: Complexity and composition of synthesized web services. PODS 2008: 231-240
- [c38]Geert Jan Bex, Frank Neven, Stijn Vansummeren: SchemaScope: a system for inferring and cleaning XML schemas. SIGMOD Conference 2008: 1259-1262
- [c37]Wouter Gelade, Frank Neven: Succinctness of the Complement and Intersection of Regular Expressions. STACS 2008: 325-336
- [c36]Geert Jan Bex, Wouter Gelade, Frank Neven, Stijn Vansummeren: Learning deterministic regular expressions for the inference of schemas from XML data. WWW 2008: 825-834
- [i3]Wouter Gelade, Frank Neven: Succinctness of the Complement and Intersection of Regular Expressions. CoRR abs/0802.2869 (2008)
- 2007
- [j18]Wim Martens, Frank Neven: Frontiers of tractability for typechecking simple XML transformations. J. Comput. Syst. Sci. 73(3): 362-390 (2007)
- [j17]Wim Martens, Frank Neven, Thomas Schwentick: Simple off the shelf abstractions for XML schema. SIGMOD Record 36(3): 15-22 (2007)
- [j16]Michael Benedikt, Leonid Libkin, Frank Neven: Logical definability and query languages over ranked and unranked trees. ACM Trans. Comput. Log. 8(2) (2007)
- [c35]Wouter Gelade, Frank Neven: Succinctness of Pattern-Based Schema Languages for XML. DBPL 2007: 201-215
- [c34]Wouter Gelade, Wim Martens, Frank Neven: Optimizing Schema Languages for XML: Numerical Constraints and Interleaving. ICDT 2007: 269-283
- [c33]Wenfei Fan, Floris Geerts, Frank Neven: Expressiveness and complexity of xml publishing transducers. PODS 2007: 83-92
- [c32]Geert Jan Bex, Frank Neven, Stijn Vansummeren: Inferring XML Schema Definitions from XML Data. VLDB 2007: 998-1009
- 2006
- [j15]Frank Neven, Thomas Schwentick: On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logical Methods in Computer Science 2(3) (2006)
- [j14]Wim Martens, Frank Neven, Thomas Schwentick, Geert Jan Bex: Expressiveness and complexity of XML Schema. ACM Trans. Database Syst. 31(3): 770-813 (2006)
- [c31]Dieter Van de Craen, Frank Neven, Kerstin Koch: An Extensible Light-Weight XML-Based Monitoring System for Sequence Databases. DILS 2006: 280-296
- [c30]Frank Neven, Dieter Van de Craen: Optimizing Monitoring Queries over Distributed Data. EDBT 2006: 829-846
- [c29]Geert Jan Bex, Frank Neven, Thomas Schwentick, Karl Tuyls: Inference of Concise DTDs from XML Data. VLDB 2006: 115-126
- [i2]Frank Neven, Thomas Schwentick: On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. CoRR abs/cs/0606065 (2006)
- [i1]Wim Martens, Frank Neven, Marc Gyssens: On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas. CoRR abs/cs/0606094 (2006)
- 2005
- [j13]Frank Neven: Attribute grammars for unranked trees as a query language for structured documents. J. Comput. Syst. Sci. 70(2): 221-257 (2005)
- [j12]Wim Martens, Frank Neven: On the complexity of typechecking top-down XML transformations. Theor. Comput. Sci. 336(1): 153-180 (2005)
- [c28]Frank Neven, Thomas Schwentick, Dan Suciu: 05061 Abstracts Collection - Foundations of Semistructured Data. Foundations of Semistructured Data 2005
- [c27]Frank Neven, Thomas Schwentick, Dan Suciu: 05061 Summary - Foundations of Semi-structured Data. Foundations of Semistructured Data 2005
- [c26]Wim Martens, Frank Neven, Thomas Schwentick: Which XML Schemas Admit 1-Pass Preorder Typing? ICDT 2005: 68-82
- [c25]Geert Jan Bex, Wim Martens, Frank Neven, Thomas Schwentick: Expressiveness of XSDs: from practice to theory, there and back again. WWW 2005: 712-721
- [e3]Frank Neven, Thomas Schwentick, Dan Suciu (Eds.): Foundations of Semistructured Data, 6.-11. February 2005. Dagstuhl Seminar Proceedings 05061, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2005
- [e2]AnHai Doan, Frank Neven, Robert McCann, Geert Jan Bex (Eds.): Proceedings of the Eight International Workshop on the Web & Databases (WebDB 2005), Baltimore, Maryland, USA, Collocated mith ACM SIGMOD/PODS 2005, June 16-17, 2005. 2005
- 2004
- [j11]Frank Neven, Thomas Schwentick, Victor Vianu: Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Log. 5(3): 403-435 (2004)
- [c24]Wim Martens, Frank Neven, Thomas Schwentick: Complexity of Decision Problems for Simple Regular Expressions. MFCS 2004: 889-900
- [c23]Wim Martens, Frank Neven: Frontiers of Tractability for Typechecking Simple XML Transformations. PODS 2004: 23-34
- [c22]Geert Jan Bex, Frank Neven, Jan Van den Bussche: DTDs versus XML Schema: A Practical Study. WebDB 2004: 79-84
- 2003
- [j10]Frank Neven, Thomas Schwentick: On the power of tree-walking automata. Inf. Comput. 183(1): 86-103 (2003)
- [j9]Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu: XML with data values: typechecking revisited. J. Comput. Syst. Sci. 66(4): 688-727 (2003)
- [j8]Kenneth A. Ross, Frank Neven, Beng Chin Ooi: Reminiscences on Influential Papers. SIGMOD Record 32(2): 89 (2003)
- [j7]Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu: Typechecking XML views of relational databases. ACM Trans. Comput. Log. 4(3): 315-354 (2003)
- [c21]
- [c20]Frank Neven, Thomas Schwentick: XPath Containment in the Presence of Disjunction, DTDs, and Variables. ICDT 2003: 312-326
- [c19]Leonid Libkin, Frank Neven: Logical Definability and Query Languages over Unranked Trees. LICS 2003: 178-187
- [e1]Frank Neven, Catriel Beeri, Tova Milo (Eds.): Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 9-12, 2003, San Diego, CA, USA. ACM 2003, ISBN 1-58113-670-6
- 2002
- [j6]Geert Jan Bex, Sebastian Maneth, Frank Neven: A formal model for an expressive fragment of XSLT. Inf. Syst. 27(1): 21-39 (2002)
- [j5]Frank Neven, Jan Van den Bussche: Expressiveness of structured document query languages based on attribute grammars. J. ACM 49(1): 56-100 (2002)
- [j4]
- [j3]Frank Neven, Thomas Schwentick: Query automata over finite trees. Theor. Comput. Sci. 275(1-2): 633-674 (2002)
- [c18]
- [c17]
- 2001
- [j2]Frank Neven, Martin Otto, Jerzy Tyszkiewicz, Jan Van den Bussche: Adding For-Loops to First-Order Logic. Inf. Comput. 168(2): 156-186 (2001)
- [c16]Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu: Typechecking XML Views of Relational Databases. LICS 2001: 421-430
- [c15]Frank Neven, Thomas Schwentick, Victor Vianu: Towards Regular Languages over Infinite Alphabets. MFCS 2001: 560-572
- [c14]Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu: XML with Data Values: Typechecking Revisited. PODS 2001
- [c13]Frank Neven, Thomas Schwentick: Automata-and Logic-Based Pattern Languages for Tree-Structured Data. Semantics in Databases 2001: 160-178
- 2000
- [c12]Geert Jan Bex, Sebastian Maneth, Frank Neven: A Formal Model for an Expressive Fragment of XSLT. Computational Logic 2000: 1137-1151
- [c11]
- [c10]Frank Neven, Thomas Schwentick: Expressive and Efficient Pattern Languages for Tree-Structured Data. PODS 2000: 145-156
1990 – 1999
- 1999
- [j1]Frank Neven, Jan Van den Bussche, Dirk Van Gucht, Gottfried Vossen: Typed Query Languages for Databases Containing Queries. Inf. Syst. 24(7): 569-595 (1999)
- [c9]
- [c8]
- [c7]Frank Neven, Thomas Schwentick: Automata for Unary Queries on Trees. Grundlagen von Datenbanken 1999: 102-106
- [c6]Frank Neven, Martin Otto, Jerzy Tyszkiewicz, Jan Van den Bussche: Adding For-Loops to First-Order Logic. ICDT 1999: 58-69
- [c5]
- 1998
- [c4]Frank Neven: Structured Document Query Languages Based on Attribute Grammars: Locality and Non-Determinism. FMLDO 1998: 129-142
- [c3]Frank Neven, Jan Van den Bussche: Expressiveness of Structured Document Query Languages Based on Attribute Grammars. PODS 1998: 11-17
- [c2]Frank Neven, Jan Van den Bussche, Dirk Van Gucht, Gottfried Vossen: Typed Query Languages for Databases Containing Queries. PODS 1998: 189-196
- 1997
- [c1]Frank Neven, Jan Van den Bussche: On Implementing Structured Document Query Facilities on Top of a DOOD. DOOD 1997: 351-367
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:03 CEST by the dblp team