| 2007 |
|---|
| 57 | EE | Wouter Gelade,
Frank Neven:
Succinctness of Pattern-Based Schema Languages for XML.
DBPL 2007: 201-215 |
| 56 | EE | Wouter Gelade,
Wim Martens,
Frank Neven:
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving.
ICDT 2007: 269-283 |
| 55 | EE | Wenfei Fan,
Floris Geerts,
Frank Neven:
Expressiveness and complexity of xml publishing transducers.
PODS 2007: 83-92 |
| 54 | EE | Geert Jan Bex,
Frank Neven,
Stijn Vansummeren:
Inferring XML Schema Definitions from XML Data.
VLDB 2007: 998-1009 |
| 53 | EE | Michael Benedikt,
Leonid Libkin,
Frank Neven:
Logical definability and query languages over ranked and unranked trees.
ACM Trans. Comput. Log. 8(2): (2007) |
| 52 | EE | Wim Martens,
Frank Neven:
Frontiers of tractability for typechecking simple XML transformations.
J. Comput. Syst. Sci. 73(3): 362-390 (2007) |
| 51 | EE | Wim Martens,
Frank Neven,
Thomas Schwentick:
Simple off the shelf abstractions for XML schema.
SIGMOD Record 36(3): 15-22 (2007) |
| 2006 |
|---|
| 50 | EE | Dieter Van de Craen,
Frank Neven,
Kerstin Koch:
An Extensible Light-Weight XML-Based Monitoring System for Sequence Databases.
DILS 2006: 280-296 |
| 49 | EE | Frank Neven,
Dieter Van de Craen:
Optimizing Monitoring Queries over Distributed Data.
EDBT 2006: 829-846 |
| 48 | EE | Geert Jan Bex,
Frank Neven,
Thomas Schwentick,
Karl Tuyls:
Inference of Concise DTDs from XML Data.
VLDB 2006: 115-126 |
| 47 | EE | Wim Martens,
Frank Neven,
Thomas Schwentick,
Geert Jan Bex:
Expressiveness and complexity of XML Schema.
ACM Trans. Database Syst. 31(3): 770-813 (2006) |
| 46 | EE | Frank Neven,
Thomas Schwentick:
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
CoRR abs/cs/0606065: (2006) |
| 45 | EE | Wim Martens,
Frank Neven,
Marc Gyssens:
On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas
CoRR abs/cs/0606094: (2006) |
| 44 | EE | 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) |
| 2005 |
|---|
| 43 | | Frank Neven,
Thomas Schwentick,
Dan Suciu:
Foundations of Semistructured Data, 6.-11. February 2005
IBFI, Schloss Dagstuhl, Germany 2005 |
| 42 | EE | AnHai Doan,
Frank Neven,
Robert McCann,
Geert Jan Bex:
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
WebDB 2005 |
| 41 | EE | Frank Neven,
Thomas Schwentick,
Dan Suciu:
05061 Abstracts Collection - Foundations of Semistructured Data.
Foundations of Semistructured Data 2005 |
| 40 | EE | Frank Neven,
Thomas Schwentick,
Dan Suciu:
05061 Summary - Foundations of Semi-structured Data.
Foundations of Semistructured Data 2005 |
| 39 | EE | Wim Martens,
Frank Neven,
Thomas Schwentick:
Which XML Schemas Admit 1-Pass Preorder Typing?
ICDT 2005: 68-82 |
| 38 | EE | Geert Jan Bex,
Wim Martens,
Frank Neven,
Thomas Schwentick:
Expressiveness of XSDs: from practice to theory, there and back again.
WWW 2005: 712-721 |
| 37 | EE | Frank Neven:
Attribute grammars for unranked trees as a query language for structured documents.
J. Comput. Syst. Sci. 70(2): 221-257 (2005) |
| 36 | EE | Wim Martens,
Frank Neven:
On the complexity of typechecking top-down XML transformations.
Theor. Comput. Sci. 336(1): 153-180 (2005) |
| 2004 |
|---|
| 35 | EE | Wim Martens,
Frank Neven,
Thomas Schwentick:
Complexity of Decision Problems for Simple Regular Expressions.
MFCS 2004: 889-900 |
| 34 | EE | Wim Martens,
Frank Neven:
Frontiers of Tractability for Typechecking Simple XML Transformations.
PODS 2004: 23-34 |
| 33 | EE | Geert Jan Bex,
Frank Neven,
Jan Van den Bussche:
DTDs versus XML Schema: A Practical Study.
WebDB 2004: 79-84 |
| 32 | EE | Frank Neven,
Thomas Schwentick,
Victor Vianu:
Finite state machines for strings over infinite alphabets.
ACM Trans. Comput. Log. 5(3): 403-435 (2004) |
| 2003 |
|---|
| 31 | EE | Frank Neven,
Thomas Schwentick:
XPath Containment in the Presence of Disjunction, DTDs, and Variables.
ICDT 2003: 312-326 |
| 30 | EE | Wim Martens,
Frank Neven:
Typechecking Top-Down Uniform Unranked Tree Transducers.
ICDT 2003: 64-78 |
| 29 | EE | Leonid Libkin,
Frank Neven:
Logical Definability and Query Languages over Unranked Trees.
LICS 2003: 178-187 |
| 28 | EE | 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) |
| 27 | EE | Frank Neven,
Thomas Schwentick:
On the power of tree-walking automata.
Inf. Comput. 183(1): 86-103 (2003) |
| 26 | EE | 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) |
| 25 | EE | Kenneth A. Ross,
Frank Neven,
Beng Chin Ooi:
Reminiscences on Influential Papers.
SIGMOD Record 32(2): 89 (2003) |
| 2002 |
|---|
| 24 | EE | Frank Neven:
Automata, Logic, and XML.
CSL 2002: 2-26 |
| 23 | EE | Frank Neven:
On the Power of Walking for Querying Tree-Structured Data.
PODS 2002: 77-84 |
| 22 | EE | Geert Jan Bex,
Sebastian Maneth,
Frank Neven:
A formal model for an expressive fragment of XSLT.
Inf. Syst. 27(1): 21-39 (2002) |
| 21 | EE | Frank Neven,
Jan Van den Bussche:
Expressiveness of structured document query languages based on attribute grammars.
J. ACM 49(1): 56-100 (2002) |
| 20 | EE | Frank Neven:
Automata Theory for XML Researchers.
SIGMOD Record 31(3): 39-46 (2002) |
| 19 | EE | Frank Neven,
Thomas Schwentick:
Query automata over finite trees.
Theor. Comput. Sci. 275(1-2): 633-674 (2002) |
| 2001 |
|---|
| 18 | | Noga Alon,
Tova Milo,
Frank Neven,
Dan Suciu,
Victor Vianu:
Typechecking XML Views of Relational Databases.
LICS 2001: 421-430 |
| 17 | EE | Frank Neven,
Thomas Schwentick,
Victor Vianu:
Towards Regular Languages over Infinite Alphabets.
MFCS 2001: 560-572 |
| 16 | EE | Noga Alon,
Tova Milo,
Frank Neven,
Dan Suciu,
Victor Vianu:
XML with Data Values: Typechecking Revisited.
PODS 2001 |
| 15 | EE | Frank Neven,
Thomas Schwentick:
Automata-and Logic-Based Pattern Languages for Tree-Structured Data.
Semantics in Databases 2001: 160-178 |
| 14 | | Frank Neven,
Martin Otto,
Jerzy Tyszkiewicz,
Jan Van den Bussche:
Adding For-Loops to First-Order Logic.
Inf. Comput. 168(2): 156-186 (2001) |
| 2000 |
|---|
| 13 | EE | Geert Jan Bex,
Sebastian Maneth,
Frank Neven:
A Formal Model for an Expressive Fragment of XSLT.
Computational Logic 2000: 1137-1151 |
| 12 | EE | Frank Neven,
Thomas Schwentick:
On the Power of Tree-Walking Automata.
ICALP 2000: 547-560 |
| 11 | EE | Frank Neven,
Thomas Schwentick:
Expressive and Efficient Pattern Languages for Tree-Structured Data.
PODS 2000: 145-156 |
| 1999 |
|---|
| 10 | EE | Sebastian Maneth,
Frank Neven:
Structured Document Transformations Based on XSL.
DBPL 1999: 80-98 |
| 9 | EE | Frank Neven:
Extensions of Attribute Grammars for Structured Document Queries.
DBPL 1999: 99-116 |
| 8 | | Frank Neven,
Thomas Schwentick:
Automata for Unary Queries on Trees.
Grundlagen von Datenbanken 1999: 102-106 |
| 7 | EE | Frank Neven,
Martin Otto,
Jerzy Tyszkiewicz,
Jan Van den Bussche:
Adding For-Loops to First-Order Logic.
ICDT 1999: 58-69 |
| 6 | EE | Frank Neven,
Thomas Schwentick:
Query Automata.
PODS 1999: 205-214 |
| 5 | EE | 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) |
| 1998 |
|---|
| 4 | | Frank Neven:
Structured Document Query Languages Based on Attribute Grammars: Locality and Non-Determinism.
FMLDO 1998: 129-142 |
| 3 | EE | Frank Neven,
Jan Van den Bussche:
Expressiveness of Structured Document Query Languages Based on Attribute Grammars.
PODS 1998: 11-17 |
| 2 | EE | Frank Neven,
Jan Van den Bussche,
Dirk Van Gucht,
Gottfried Vossen:
Typed Query Languages for Databases Containing Queries.
PODS 1998: 189-196 |
| 1997 |
|---|
| 1 | | Frank Neven,
Jan Van den Bussche:
On Implementing Structured Document Query Facilities on Top of a DOOD.
DOOD 1997: 351-367 |
