World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
37
Citations
4362
World Ranking
10932
National Ranking
265

Overview

Laurent Doyen is affiliated with the École Normale Supérieure in France. Their research primarily focuses on the field of Computer Science, with a strong emphasis on formal methods and computational theory.

The scientist's recent publications cover a range of topics within the area of theoretical computer science and stochastic processes. Key recent papers include:

  • "Observation and Distinction: Representing Information in Infinite Games" (2022) published in Theory of Computing Systems
  • "Stochastic Processes with Expected Stopping Time" (2021) published on arXiv (Cornell University)
  • "Stochastic Processes with Expected Stopping Time" (2024) published in Logical Methods in Computer Science
  • "Graph Planning with Expected Finite Horizon" (2022) published in Journal of Computer and System Sciences
  • "Bounds for Synchronizing Markov Decision Processes" (2022) published on arXiv (Cornell University)

Doyen's frequent collaborators include Krishnendu Chatterjee, Pranshu Gaba, Shibashis Guha, Marie van den Bogaard, and Dietmar Berwanger. These collaborations suggest active research partnerships within the domains of stochastic processes and computational theory.

Publications by Doyen have appeared predominantly in the following venues:

  • arXiv (Cornell University)
  • Logical Methods in Computer Science
  • Theory of Computing Systems
  • Journal of Computer and System Sciences
  • Journal of the ACM

The main areas of study for Doyen include:

  • Computer Science

Within these, subfields of particular focus are:

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Management Science and Operations Research
  • Artificial Intelligence
  • Molecular Biology

Specific research topics addressed in their work include:

  • Formal Methods in Verification
  • Distributed Systems and Fault Tolerance
  • Game Theory and Applications
  • Petri Nets in System Modeling
  • Computability, Logic, AI Algorithms
  • Optimization and Search Problems
  • Stochastic Processes and Financial Applications

Best Publications

  • Quantitative Languages

    Krishnendu Chatterjee;Laurent Doyen;Thomas A. Henzinger

  • Antichains: a new algorithm for checking universality of finite automata

    M. De Wulf;L. Doyen;T. A. Henzinger;J. F. Raskin

  • Algorithms for Omega-Regular Games with Imperfect Information

    Jean-François Raskin;Krishnendu Chatterjee;Laurent Doyen;Thomas A. Henzinger

  • Generalized Mean-payoff and Energy Games

    Krishnendu Chatterjee;Laurent Doyen;Thomas A. Henzinger;Jean-François Raskin

  • Energy parity games

    Krishnendu Chatterjee;Laurent Doyen

  • Antichains: A new algorithm for checking universality of finite automata

    Martin De Wulf;Laurent Doyen;Thomas A. Henzinger;Jean-François Raskin

  • Faster algorithms for mean-payoff games

    L. Brim;J. Chaloupka;L. Doyen;R. Gentilini

  • Almost ASAP Semantics: From Timed Models to Timed Implementations

    Martin De Wulf;Laurent Doyen;Jean-François Raskin

  • Algorithms for Omega-Regular Games with Imperfect Information

    Krishnendu Chatterjee;Laurent Doyen;Thomas A. Henzinger;Jean-Francois Raskin

  • The complexity of multi-mean-payoff and multi-energy games

    Yaron Velner;Krishnendu Chatterjee;Laurent Doyen;Thomas A. Henzinger

  • Interface theories with component reuse

    Laurent Doyen;Thomas A. Henzinger;Barbara Jobstmann;Tatjana Petrov

  • Algorithms for omega-regular games with imperfect information

    Krishnendu Chatterjee;Laurent Doyen;Thomas A. Henzinger;Jean-François Raskin

  • Antichain algorithms for finite automata

    Laurent Doyen;Jean-François Raskin

  • Expressiveness And Closure Properties For Quantitative Languages

    Krishnendu Chatterjee;Laurent Doyen;Thomas A. Henzinger

  • Energy and mean-payoff games with imperfect information

    Aldric Degorre;Laurent Doyen;Raffaella Gentilini;Jean-François Raskin

  • Robustness and Implementability of Timed Automata

    Martin De Wulf;Laurent Doyen;Nicolas N. Markey;Jean-François Raskin

  • Robust safety of timed automata

    Martin Wulf;Laurent Doyen;Nicolas Markey;Jean-François Raskin

  • Antichains: alternative algorithms for LTL satisfiability and model-checking

    M. De Wulf;L. Doyen;N. Maquet;J. F. Raskin

  • Qualitative analysis of partially-observable Markov decision processes

    Krishnendu Chatterjee;Laurent Doyen;Thomas A. Henzinger

  • Alternating weighted automata

    Krishnendu Chatterjee;Laurent Doyen;Thomas A. Henzinger

  • Almost ASAP semantics: from timed models to timed implementations

    Martin De Wulf;Laurent Doyen;Jean-François Raskin

Frequent Co-Authors

Krishnendu Chatterjee
Krishnendu Chatterjee Institute of Science and Technology Austria
Jean-François Raskin
Jean-François Raskin Université Libre de Bruxelles
Thomas A. Henzinger
Thomas A. Henzinger Institute of Science and Technology Austria
Moshe Y. Vardi
Moshe Y. Vardi Rice University
Nicolas Markey
Nicolas Markey French Institute for Research in Computer Science and Automation - INRIA
Herbert Edelsbrunner
Herbert Edelsbrunner Institute of Science and Technology Austria
Joël Ouaknine
Joël Ouaknine Max Planck Institute for Software Systems
Axel Legay
Axel Legay Université Catholique de Louvain
André Platzer
André Platzer Karlsruhe Institute of Technology
George J. Pappas
George J. Pappas University of Pennsylvania

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 degrees opens up a world of accessible options for students interested in Computer Science. Associate's degree online programs offer a flexible start to your academic journey, ideal for those balancing work or family commitments.

Financial concerns are also a major consideration. Many students search for affordable online courses to reduce debt and manage tuition costs. This makes advanced education more attainable for a broader range of learners.

If you’re worried about your academic record, don’t lose hope. There are online schools that accept low gpa, offering second chances and supporting diverse learning backgrounds.

Completing a Computer Science degree online doesn’t limit your career choices. In fact, many graduates expand into tech-focused roles in other fields. For example, you can find jobs with elementary education and environmental science degree, especially where technology and science intersect.

Online study provides flexible, affordable pathways and a broad range of future opportunities, no matter your starting point.

Best Scientists Citing Laurent Doyen

Trending Scientists