| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Frank Neven Frank Neven, Thomas Schwentick : XPath Containment in the Presence of Disjunction, DTDs, and Variables. ICDT 2003 : 315-329 Wim Martens , Frank Neven: Typechecking Top-Down Uniform Unranked Tree Transducers. ICDT 2003 : 64-78 Leonid Libkin , Frank Neven: Logical Definability and Query Languages over Unranked Trees. LICS 2003 : 178-187 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) Frank Neven, Thomas Schwentick : On the power of tree-walking automata. Inf. Comput. 183 (1): 86-103 (2003) 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) Kenneth A. Ross , Frank Neven, Beng Chin Ooi : Reminiscences on Influential Papers. SIGMOD Record 32 (2): 89 (2003) Frank Neven: Automata, Logic, and XML. CSL 2002 : 2-26 Frank Neven: On the Power of Walking for Querying Tree-Structured Data. PODS 2002 : 77-84 Geert Jan Bex , Sebastian Maneth , Frank Neven: A formal model for an expressive fragment of XSLT. Inf. Syst. 27 (1): 21-39 (2002) Frank Neven, Jan Van den Bussche : Expressiveness of structured document query languages based on attribute grammars. J. ACM 49 (1): 56-100 (2002) Frank Neven: Automata Theory for XML Researchers. SIGMOD Record 31 (3): 39-46 (2002) Frank Neven, Thomas Schwentick : Query automata over finite trees. Theor. Comput. Sci. 275 (1-2): 633-674 (2002) Noga Alon , Tova Milo , Frank Neven, Dan Suciu , Victor Vianu : Typechecking XML Views of Relational Databases. LICS 2001 : 421-430 Frank Neven, Thomas Schwentick , Victor Vianu : Towards Regular Languages over Infinite Alphabets. MFCS 2001 : 560-572 Noga Alon , Tova Milo , Frank Neven, Dan Suciu , Victor Vianu : XML with Data Values: Typechecking Revisited. PODS 2001 Frank Neven, Thomas Schwentick : Automata-and Logic-Based Pattern Languages for Tree-Structured Data. Semantics in Databases 2001 : 160-178 Frank Neven, Martin Otto , Jerzy Tyszkiewicz , Jan Van den Bussche : Adding For-Loops to First-Order Logic. Inf. Comput. 168 (2): 156-186 (2001) Geert Jan Bex , Sebastian Maneth , Frank Neven: A Formal Model for an Expressive Fragment of XSLT. Computational Logic 2000 : 1137-1151 Frank Neven, Thomas Schwentick : On the Power of Tree-Walking Automata. ICALP 2000 : 547-560 Frank Neven, Thomas Schwentick : Expressive and Efficient Pattern Languages for Tree-Structured Data. PODS 2000 : 145-156 Sebastian Maneth , Frank Neven: Structured Document Transformations Based on XSL. DBPL 1999 : 80-98 Frank Neven: Extensions of Attribute Grammars for Structured Document Queries. DBPL 1999 : 99-116 Frank Neven, Thomas Schwentick : Automata for Unary Queries on Trees. Grundlagen von Datenbanken 1999 : 102-106 Frank Neven, Martin Otto , Jerzy Tyszkiewicz , Jan Van den Bussche : Adding For-Loops to First-Order Logic. ICDT 1999 : 58-69 Frank Neven, Thomas Schwentick : Query Automata. PODS 1999 : 205-214 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) Frank Neven: Structured Document Query Languages Based on Attribute Grammars: Locality and Non-Determinism. FMLDO 1998 : 129-142 Frank Neven, Jan Van den Bussche : Expressiveness of Structured Document Query Languages Based on Attribute Grammars. PODS 1998 : 11-17 Frank Neven, Jan Van den Bussche , Dirk Van Gucht , Gottfried Vossen : Typed Query Languages for Databases Containing Queries. PODS 1998 : 189-196 Frank Neven, Jan Van den Bussche : On Implementing Structured Document Query Facilities on Top of a DOOD. DOOD 1997 : 351-367 1 [ 16 ] [ 18 ] [ 26 ] [ 28 ] 2 [ 13 ] [ 22 ] 3 [ 1 ] [ 2 ] [ 3 ] [ 5 ] [ 7 ] [ 14 ] [ 21 ] 4 [ 2 ] [ 5 ] 5 [ 29 ] 6 [ 10 ] [ 13 ] [ 22 ] 7 [ 30 ] 8 [ 16 ] [ 18 ] [ 26 ] [ 28 ] 9 [ 25 ] 10 [ 7 ] [ 14 ] 11 [ 25 ] 12 [ 6 ] [ 8 ] [ 11 ] [ 12 ] [ 15 ] [ 17 ] [ 19 ] [ 27 ] [ 31 ] 13 [ 16 ] [ 18 ] [ 26 ] [ 28 ] 14 [ 7 ] [ 14 ] 15 [ 16 ] [ 17 ] [ 18 ] [ 26 ] [ 28 ] 16 [ 2 ] [ 5 ]  ©2004 Association for Computing Machinery |
