The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Frank Neven: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  55. BioScout: a life-science query monitoring system. [Citation Graph (, )][DBLP]


  56. SLIDER: Mining Correlated Motifs in Protein-Protein Interaction Networks. [Citation Graph (, )][DBLP]


  57. Complexity and composition of synthesized web services. [Citation Graph (, )][DBLP]


  58. Simplifying XML schema: single-type approximations of regular tree languages. [Citation Graph (, )][DBLP]


  59. SchemaScope: a system for inferring and cleaning XML schemas. [Citation Graph (, )][DBLP]


  60. Simplifying XML schema: effortless handling of nondeterministic regular expressions. [Citation Graph (, )][DBLP]


  61. Succinctness of the Complement and Intersection of Regular Expressions. [Citation Graph (, )][DBLP]


  62. Learning deterministic regular expressions for the inference of schemas from XML data. [Citation Graph (, )][DBLP]


  63. Succinctness of the Complement and Intersection of Regular Expressions [Citation Graph (, )][DBLP]


  64. Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data [Citation Graph (, )][DBLP]


Search in 0.032secs, Finished in 0.035secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002