World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
38
Citations
5564
World Ranking
10318
National Ranking
98

Overview

Frank Neven is affiliated with Hasselt University in Belgium, where they conduct research primarily in the field of Computer Science. Their work spans various subfields including Computer Networks and Communications, Artificial Intelligence, Management Science and Operations Research, Signal Processing, and Molecular Biology.

The main topics covered in Frank Neven's research include:

  • Distributed systems and fault tolerance
  • Advanced Data Storage Technologies
  • Advanced Database Systems and Queries
  • Data Quality and Management
  • Data Management and Algorithms
  • Biomedical Text Mining and Ontologies
  • Security and Verification in Computing

A selection of recent papers authored or co-authored by Frank Neven demonstrates a multidisciplinary approach and contributions to various aspects of data systems and biomedical informatics. These include:

  • Using natural language processing for automated classification of disease and to identify misclassified ICD codes in cardiac disease, 2024, published in European Heart Journal - Digital Health
  • Robustness Against Read Committed for Transaction Templates with Functional Constraints, 2022, published in arXiv (Cornell University)
  • Population age and household structures shape transmission dynamics of emerging infectious diseases: a longitudinal microsimulation approach, 2023, published in Journal of The Royal Society Interface
  • Concurrency control for database theorists, 2023, published in ACM SIGMOD Record
  • Deciding Robustness for Lower SQL Isolation Levels, 2022, published in ACM Transactions on Database Systems

Frank Neven frequently publishes in venues such as:

  • arXiv (Cornell University)
  • Proceedings of the VLDB Endowment
  • ACM SIGMOD Record
  • ACM Transactions on Database Systems
  • European Heart Journal - Digital Health

Collaborations appear to be an important part of their research activities, with frequent co-authors including:

  • Brecht Vandevoort
  • Bas Ketsman
  • Stijn Vansummeren
  • Niel Hens
  • Marcel Parciak

Best Publications

  • Finite state machines for strings over infinite alphabets

    Frank Neven;Thomas Schwentick;Victor Vianu

  • XPath Containment in the Presence of Disjunction, DTDs, and Variables

    Frank Neven;Thomas Schwentick

  • Automata theory for XML researchers

    Frank Neven

  • Automata, Logic, and XML

    Frank Neven

  • DTDs versus XML schema: a practical study

    Geert Jan Bex;Frank Neven;Jan Van den Bussche

  • Expressiveness and complexity of XML Schema

    Wim Martens;Frank Neven;Thomas Schwentick;Geert Jan Bex

  • Inference of concise DTDs from XML data

    Geert Jan Bex;Frank Neven;Thomas Schwentick;Karl Tuyls

  • Query automata over finite trees

    Frank Neven;Thomas Schwentick

  • Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data

    Geert Jan Bex;Wouter Gelade;Frank Neven;Stijn Vansummeren

  • Inferring XML schema definitions from XML data

    Geert Jan Bex;Frank Neven;Stijn Vansummeren

  • Expressive and Efficient Pattern Languages for Tree-Structured Data.

    Frank Neven;Thomas Schwentick

  • Learning deterministic regular expressions for the inference of schemas from XML data

    Geert Jan Bex;Wouter Gelade;Frank Neven;Stijn Vansummeren

  • A formal model for an expressive fragment of XSLT

    Geert Jan Bex;Sebastian Maneth;Frank Neven

  • On The Complexity Of Xpath Containment In The Presence Of Disjunction, Dtds, And Variables

    Frank Neven;Thomas Schwentick

  • Inference of concise regular expressions and DTDs

    Geert Jan Bex;Frank Neven;Thomas Schwentick;Stijn Vansummeren

  • XML with data values: typechecking revisited

    Noga Alon;Tova Milo;Frank Neven;Dan Suciu

  • Frontiers of tractability for typechecking simple XML transformations

    Wim Martens;Frank Neven

  • Relational transducers for declarative networking

    Tom J. Ameloot;Frank Neven;Jan Van Den Bussche

  • Frontiers of tractability for typechecking simple XML transformations

    Wim Martens;Frank Neven

  • Towards Regular Languages over Infinite Alphabets

    Frank Neven;Thomas Schwentick;Victor Vianu

Frequent Co-Authors

Thomas Schwentick
Thomas Schwentick TU Dortmund University
Jan Van den Bussche
Jan Van den Bussche Hasselt University
Victor Vianu
Victor Vianu University of California, San Diego
Dan Suciu
Dan Suciu University of Washington
Floris Geerts
Floris Geerts University of Antwerp
Tova Milo
Tova Milo Tel Aviv University
Leonid Libkin
Leonid Libkin University of Edinburgh
Wenfei Fan
Wenfei Fan University of Edinburgh
Serge Abiteboul
Serge Abiteboul École Normale Supérieure
Noga Alon
Noga Alon Tel Aviv University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens doors to diverse, flexible learning options and career routes. For those seeking to maximize career prospects, consider programs that are known as the best masters degree to get. These advanced qualifications can give you an edge in fields like data science, software engineering, and cybersecurity.

If you're looking to start your academic journey or switch careers, associates degrees online in Computer Science or related areas offer a practical, affordable entry point. These programs provide foundational skills and are suitable for those balancing work and study.

Cost is often a concern, but there are many opportunities to pursue the cheapest online degrees without sacrificing quality. Affordable study paths make it easier for students from all backgrounds to access top education and grow their careers.

Even if your academic record includes a few stumbles, many online graduate programs that accept 2.0 gpa provide a second chance. These programs are designed for motivated students eager to advance, regardless of prior GPA.

Best Scientists Citing Frank Neven

Trending Scientists

Recently Published Articles