World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
39
Citations
6081
World Ranking
9799
National Ranking
615

Overview

Michael Benedikt is affiliated with the University of Oxford in the United Kingdom and works primarily in the field of Computer Science. Their research contributions span several subfields including Artificial Intelligence, Computer Networks and Communications, and Computational Theory and Mathematics.

The scientist's work focuses on topics such as Advanced Database Systems and Queries, Semantic Web and Ontologies, Logic, Reasoning, and Knowledge, semigroups and automata theory, Formal Methods in Verification, Data Management and Algorithms, and Computability, Logic, AI Algorithms.

The list of recent publications by Michael Benedikt includes:

  • Two Variable Logic with Ultimately Periodic Counting, 2020, arXiv (Cornell University)
  • Rewriting the infinite chase, 2022, Proceedings of the VLDB Endowment

Michael Benedikt frequently collaborates with several co-authors, among them Enrique Casanovas, Matthias Aschenbrenner, Verónica Becher, Lev D. Beklemishev, and Stephen Jackson, each with multiple joint publications.

The main publication venues for this scientist include:

  • arXiv (Cornell University)
  • Journal of Symbolic Logic
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Proceedings of the VLDB Endowment
  • ACM Transactions on Computational Logic

Best Publications

  • XPath satisfiability in the presence of DTDs

    Michael Benedikt;Wenfei Fan;Floris Geerts

  • E-services: a look behind the curtain

    Richard Hull;Michael Benedikt;Vassilis Christophides;Jianwen Su

  • VeriWeb: Automatically Testing Dynamic Web Sites

    Michael Benedikt;Juliana Freire;Patrice Godefroid

  • Analysis of recursive state machines

    Rajeev Alur;Michael Benedikt;Kousha Etessami;Patrice Godefroid

  • Safe Constraint Queries

    Michael Benedikt;Leonid Libkin

  • Relational expressive power of constraint query languages

    Michael Benedikt;Guozhu Dong;Leonid Libkin;Limsoon Wong

  • Relational expressive power of constraint query languages

    Michael Benedikt;Guozhu Dong;Leonid Libkin;Limsoon Wong

  • Structural Properties of XPath Fragments

    Michael Benedikt;Wenfei Fan;Gabriel M. Kuper

  • XPath leashed

    Michael Benedikt;Christoph Koch

  • XPath satisfiability in the presence of DTDs

    Michael Benedikt;Wenfei Fan;Floris Geerts

  • Efficient network aware search in collaborative tagging sites

    Sihem Amer Yahia;Michael Benedikt;Laks V. S. Lakshmanan;Julia Stoyanovich

  • Computational Models of Space: Isovists and Isovist Fields

    L. S. Davis;M. L. Benedikt

  • Automatic exploration and testing of dynamic Web sites

    Michael Abraham Benedikt;Juliana Freire Silva;Patrice Ismael Godefroid;Avinash Vyas

  • Structured voicemail messages

    Thomas J. Ball;Michael Abraham Benedikt;Peter Andrew Mataga;Carlos Miguel Puchol

  • Method and apparatus for generating program code for world wide web service applications

    Michael Abraham Benedikt;David Alan Ladd;James Christopher Ramming

  • Benchmarking the Chase

    Michael Benedikt;George Konstantinidis;Giansalvatore Mecca;Boris Motik

  • Integrated web and telephone service creation

    David L. Atkins;Thomas Ball;Thomas R. Baran;Michael A. Benedikt

  • Structural properties of XPath fragments

    Michael Benedikt;Wenfei Fan;Gabriel Kuper

  • A Decidable Logic for Describing Linked Data Structures

    Michael Benedikt;Thomas W. Reps;Shmuel Sagiv

  • LTL model checking of interval markov chains

    Michael Benedikt;Rastislav Lenhardt;James Worrell

  • Model Checking of Unrestricted Hierarchical State Machines

    Michael Benedikt;Patrice Godefroid;Thomas W. Reps

Frequent Co-Authors

Leonid Libkin
Leonid Libkin University of Edinburgh
Thomas Ball
Thomas Ball Microsoft (United States)
Wenfei Fan
Wenfei Fan University of Edinburgh
Luc Segoufin
Luc Segoufin French Institute for Research in Computer Science and Automation - INRIA
Juliana Freire
Juliana Freire New York University
Rajeev Rastogi
Rajeev Rastogi Amazon (United States)
Patrice Godefroid
Patrice Godefroid Microsoft (United States)
James Cheney
James Cheney University of Edinburgh
Georg Gottlob
Georg Gottlob University of Calabria
Thomas Reps
Thomas Reps University of Wisconsin–Madison

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 online degree options in Computer Science opens many career pathways. As tech innovation evolves rapidly, choosing the top degrees for the future can help you stay competitive in a dynamic job market. Many students consider programs that offer both flexibility and relevance, especially those that target high-demand sectors like data science and cybersecurity.

For those looking to upskill quickly, the availability of some of the easiest masters degrees can be appealing. These programs often focus on foundational knowledge and are structured for working professionals.

If you're interested in advanced research, finding the cheapest doctoral programs online allows you to minimize costs while pursuing top academic credentials. Additionally, educators in tech may consider the accelerated doctoral programs in education online to move quickly into educational leadership or policy roles.

Ultimately, the increasing variety of online options lets students balance affordability, speed, and specialization on the path to rewarding tech careers.

Best Scientists Citing Michael Benedikt

Trending Scientists

Recently Published Articles