default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaurent Doyen 0001
Person information
- affiliation: CNRS & LMF, ENS Paris-Saclay, France
- affiliation: LSV, Cachan, France
Other persons with the same name
- Laurent Doyen 0002
![[0000-0002-3788-5696]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-3788-5696")
— LJK, Grenoble, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j23]Laurent Doyen:
Top-down complementation of automata on finite trees. Inf. Process. Lett. 187: 106499 (2025)- 2024
- [j22]Krishnendu Chatterjee, Laurent Doyen:
Stochastic Processes with Expected Stopping Time. Log. Methods Comput. Sci. 20(4) (2024) - [c58]Laurent Doyen, Thomas Soullard:
Regular Games with Imperfect Information Are Not That Regular. CONCUR 2024: 23:1-23:19 - [c57]Laurent Doyen, Pranshu Gaba, Shibashis Guha:
Stochastic Window Mean-Payoff Games. FoSSaCS (1) 2024: 34-54 - [i35]Laurent Doyen, Thomas Soullard:
Regular Games with Imperfect Information Are Not That Regular. CoRR abs/2403.20133 (2024) - [i34]Laurent Doyen, Pranshu Gaba, Shibashis Guha:
Expectation in Stochastic Window Mean-Payoff Games. CoRR abs/2405.18048 (2024) - 2023
- [j21]Laurent Doyen:
Stochastic Games with Synchronization Objectives. J. ACM 70(3): 23:1-23:35 (2023) - [j20]Dietmar Berwanger, Laurent Doyen:
Observation and Distinction: Representing Information in Infinite Games. Theory Comput. Syst. 67(1): 4-27 (2023) - [i33]Laurent Doyen, Pranshu Gaba, Shibashis Guha:
Stochastic Window Mean-payoff Games. CoRR abs/2304.11563 (2023) - [i32]Dietmar Berwanger, Laurent Doyen, Thomas Soullard:
Synthesising Full-Information Protocols. CoRR abs/2307.01063 (2023) - 2022
- [j19]Krishnendu Chatterjee, Laurent Doyen:
Graph planning with expected finite horizon. J. Comput. Syst. Sci. 129: 1-21 (2022) - [c56]Laurent Doyen, Marie van den Bogaard:
Bounds for Synchronizing Markov Decision Processes. CSR 2022: 133-151 - [c55]Laurent Doyen:
Stochastic Games with Synchronizing Objectives. LICS 2022: 43:1-43:12 - [e1]Jean-François Raskin, Krishnendu Chatterjee, Laurent Doyen, Rupak Majumdar:
Principles of Systems Design - Essays Dedicated to Thomas A. Henzinger on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 13660, Springer 2022, ISBN 978-3-031-22336-5 [contents] - [i31]Laurent Doyen:
Stochastic Games with Synchronizing Objectives. CoRR abs/2202.12767 (2022) - [i30]Laurent Doyen, Marie van den Bogaard:
Bounds for Synchronizing Markov Decision Processes. CoRR abs/2204.12814 (2022) - 2021
- [c54]Krishnendu Chatterjee, Laurent Doyen:
Stochastic Processes with Expected Stopping Time. LICS 2021: 1-13 - [i29]Krishnendu Chatterjee, Laurent Doyen:
Stochastic Processes with Expected Stopping Time. CoRR abs/2104.07278 (2021) - 2020
- [c53]Dietmar Berwanger, Laurent Doyen:
Observation and Distinction. Representing Information in Infinite Games. STACS 2020: 48:1-48:17
2010 – 2019
- 2019
- [j18]Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi:
The complexity of synchronizing Markov decision processes. J. Comput. Syst. Sci. 100: 96-129 (2019) - [c52]Krishnendu Chatterjee, Laurent Doyen:
Graph Planning with Expected Finite Horizon. LICS 2019: 1-13 - 2018
- [p2]Laurent Doyen, Goran Frehse, George J. Pappas, André Platzer:
Verification of Hybrid Systems. Handbook of Model Checking 2018: 1047-1110 - [i28]Krishnendu Chatterjee, Laurent Doyen:
Graph Planning with Expected Finite Horizon. CoRR abs/1802.03642 (2018) - [i27]Dietmar Berwanger, Laurent Doyen:
Observation and Distinction. Representing Information in Infinite Games. CoRR abs/1809.05978 (2018) - 2017
- [j17]Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot, Jean-François Raskin:
Doomsday equilibria for omega-regular games. Inf. Comput. 254: 296-315 (2017) - [c51]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
The Cost of Exactness in Quantitative Reachability. Models, Algorithms, Logics and Tools 2017: 367-381 - [c50]Laurent Doyen:
The Multiple Dimensions of Mean-Payoff Games - (Extended Abstract). RP 2017: 1-8 - 2016
- [c49]Krishnendu Chatterjee, Laurent Doyen:
Computation Tree Logic for Synchronization Properties. ICALP 2016: 98:1-98:14 - [c48]Krishnendu Chatterjee, Laurent Doyen:
Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives. LICS 2016: 247-256 - [i26]Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi:
The Complexity of Synchronizing Markov Decision Processes. CoRR abs/1604.01942 (2016) - [i25]Krishnendu Chatterjee, Laurent Doyen:
Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives. CoRR abs/1604.06376 (2016) - [i24]Krishnendu Chatterjee, Laurent Doyen:
Computation Tree Logic for Synchronization Properties. CoRR abs/1604.06384 (2016) - 2015
- [j16]Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Moshe Rabinovich, Jean-François Raskin:
The complexity of multi-mean-payoff and multi-energy games. Inf. Comput. 241: 177-196 (2015) - [j15]Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, Jean-François Raskin:
Looking at mean-payoff and total-payoff through windows. Inf. Comput. 242: 25-52 (2015) - [j14]Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Thomas A. Henzinger:
Randomness for free. Inf. Comput. 245: 3-16 (2015) - [c47]Krishnendu Chatterjee, Laurent Doyen, Moshe Y. Vardi:
The Complexity of Synthesis from Probabilistic Components. ICALP (2) 2015: 108-120 - [i23]Krishnendu Chatterjee, Laurent Doyen, Moshe Y. Vardi:
The Complexity of Synthesis from Probabilistic Components. CoRR abs/1502.04844 (2015) - 2014
- [j13]Krishnendu Chatterjee, Laurent Doyen:
Partial-Observation Stochastic Games: How to Win when Belief Fails. ACM Trans. Comput. Log. 15(2): 16:1-16:44 (2014) - [c46]Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi:
Robust Synchronization in Markov Decision Processes. CONCUR 2014: 234-248 - [c45]Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi:
Limit Synchronization in Markov Decision Processes. FoSSaCS 2014: 58-72 - [c44]Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Youssouf Oualhadj:
Perfect-Information Stochastic Mean-Payoff Parity Games. FoSSaCS 2014: 210-225 - [c43]Krishnendu Chatterjee, Laurent Doyen, Sumit Nain, Moshe Y. Vardi:
The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies. FoSSaCS 2014: 242-257 - [c42]Laurent Doyen, Line Juhl, Kim Guldstrand Larsen, Nicolas Markey, Mahsa Shirmohammadi:
Synchronizing Words for Weighted and Timed Automata. FSTTCS 2014: 121-132 - [c41]Krishnendu Chatterjee, Laurent Doyen:
Games with a Weak Adversary. ICALP (2) 2014: 110-121 - [c40]Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot, Jean-François Raskin:
Doomsday Equilibria for Omega-Regular Games. VMCAI 2014: 78-97 - [i22]Krishnendu Chatterjee, Laurent Doyen, Sumit Nain, Moshe Y. Vardi:
The Complexity of Partial-observation Stochastic Parity Games With Finite-memory Strategies. CoRR abs/1401.3289 (2014) - [i21]Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi:
Robust Synchronization in Markov Decision Processes. CoRR abs/1402.2840 (2014) - [i20]Krishnendu Chatterjee, Laurent Doyen:
Games with a Weak Adversary. CoRR abs/1404.5453 (2014) - 2013
- [j12]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
A survey of partial-observation stochastic parity games. Formal Methods Syst. Des. 43(2): 268-284 (2013) - [c39]Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell:
Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points. ATVA 2013: 55-70 - [c38]Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, Jean-François Raskin:
Looking at Mean-Payoff and Total-Payoff through Windows. ATVA 2013: 118-132 - [i19]Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, Jean-François Raskin:
Looking at Mean-Payoff and Total-Payoff through Windows. CoRR abs/1302.4248 (2013) - [i18]Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi:
Limit Synchronization in Markov Decision Processes. CoRR abs/1310.2935 (2013) - [i17]Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot, Jean-François Raskin:
Doomsday Equilibria for Omega-Regular Games. CoRR abs/1311.3238 (2013) - 2012
- [j11]Krishnendu Chatterjee, Laurent Doyen:
Energy parity games. Theor. Comput. Sci. 458: 49-60 (2012) - [c37]Krishnendu Chatterjee, Laurent Doyen:
Partial-Observation Stochastic Games: How to Win When Belief Fails. LICS 2012: 175-184 - [i16]Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi:
Infinite Synchronizing Words for Probabilistic Automata (Erratum). CoRR abs/1206.0995 (2012) - [i15]Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Rabinovich, Jean-François Raskin:
The Complexity of Multi-Mean-Payoff and Multi-Energy Games. CoRR abs/1209.3234 (2012) - [i14]Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell:
Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints. CoRR abs/1211.1276 (2012) - 2011
- [j10]Lubos Brim, Jakub Chaloupka, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin:
Faster algorithms for mean-payoff games. Formal Methods Syst. Des. 38(2): 97-118 (2011) - [c36]Thomas Brihaye, Véronique Bruyère, Laurent Doyen, Marc Ducobu, Jean-François Raskin:
Antichain-Based QBF Solving. ATVA 2011: 183-197 - [c35]Krishnendu Chatterjee, Laurent Doyen, Rohit Singh:
On Memoryless Quantitative Objectives. FCT 2011: 148-159 - [c34]Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell:
On Reachability for Hybrid Automata over Bounded Time. ICALP (2) 2011: 416-427 - [c33]Krishnendu Chatterjee, Laurent Doyen:
Games and Markov Decision Processes with Mean-Payoff Parity and Energy Parity Objectives. MEMICS 2011: 37-46 - [c32]Krishnendu Chatterjee, Laurent Doyen:
Energy and Mean-Payoff Parity Markov Decision Processes. MFCS 2011: 206-218 - [c31]Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi:
Infinite Synchronizing Words for Probabilistic Automata. MFCS 2011: 278-289 - [c30]Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi:
Synchronizing Objectives for Markov Decision Processes. iWIGP 2011: 61-75 - [p1]Laurent Doyen, Jean-François Raskin:
Games with imperfect information: theory and algorithms. Lectures in Game Theory for Computer Scientists 2011: 185-212 - [i13]Krishnendu Chatterjee, Laurent Doyen:
Energy and Mean-Payoff Parity Markov Decision Processes. CoRR abs/1104.2909 (2011) - [i12]Krishnendu Chatterjee, Laurent Doyen, Rohit Singh:
On Memoryless Quantitative Objectives. CoRR abs/1104.3211 (2011) - [i11]Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell:
On Reachability for Hybrid Automata over Bounded Time. CoRR abs/1104.5335 (2011) - [i10]Krishnendu Chatterjee, Laurent Doyen:
Partial-Observation Stochastic Games: How to Win when Belief Fails. CoRR abs/1107.2141 (2011) - 2010
- [j9]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
Expressiveness and Closure Properties for Quantitative Languages. Log. Methods Comput. Sci. 6(3) (2010) - [j8]Dietmar Berwanger, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, Thomas A. Henzinger:
Strategy construction for parity games with imperfect information. Inf. Comput. 208(10): 1206-1220 (2010) - [j7]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
Quantitative languages. ACM Trans. Comput. Log. 11(4): 23:1-23:38 (2010) - [c29]Laurent Doyen, Thomas A. Henzinger, Axel Legay, Dejan Nickovic:
Robustness of Sequential Circuits. ACSD 2010: 77-84 - [c28]Krishnendu Chatterjee, Laurent Doyen, Herbert Edelsbrunner, Thomas A. Henzinger, Philippe Rannou:
Mean-Payoff Automaton Expressions. CONCUR 2010: 269-283 - [c27]Aldric Degorre, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin, Szymon Torunczyk:
Energy and Mean-Payoff Games with Imperfect Information. CSL 2010: 260-274 - [c26]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin:
Generalized Mean-payoff and Energy Games. FSTTCS 2010: 505-516 - [c25]Krishnendu Chatterjee, Laurent Doyen:
Energy Parity Games. ICALP (2) 2010: 599-610 - [c24]Krishnendu Chatterjee, Laurent Doyen:
The Complexity of Partial-Observation Parity Games. LPAR (Yogyakarta) 2010: 1-14 - [c23]Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Thomas A. Henzinger:
Randomness for Free. MFCS 2010: 246-257 - [c22]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
Qualitative Analysis of Partially-Observable Markov Decision Processes. MFCS 2010: 258-269 - [c21]Laurent Doyen, Jean-François Raskin:
Antichain Algorithms for Finite Automata. TACAS 2010: 2-22 - [i9]Krishnendu Chatterjee, Laurent Doyen:
Energy Parity Games. CoRR abs/1001.5183 (2010) - [i8]Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Thomas A. Henzinger:
Randomness for Free. CoRR abs/1006.0673 (2010) - [i7]Krishnendu Chatterjee, Laurent Doyen, Herbert Edelsbrunner, Thomas A. Henzinger, Philippe Rannou:
Mean-payoff Automaton Expressions. CoRR abs/1006.1492 (2010) - [i6]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin:
Generalized Mean-payoff and Energy Games. CoRR abs/1007.1669 (2010)
2000 – 2009
- 2009
- [j6]Laurent Doyen, Jean-François Raskin:
Antichains for the Automata-Based Approach to Model-Checking. Log. Methods Comput. Sci. 5(1) (2009) - [c20]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
Probabilistic Weighted Automata. CONCUR 2009: 244-258 - [c19]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
Alternating Weighted Automata. FCT 2009: 3-13 - [c18]Laurent Doyen, Gilles Geeraerts, Jean-François Raskin, Julien Reichert:
Realizability of Real-Time Logics. FORMATS 2009: 133-148 - [c17]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
A Survey of Stochastic Games with Limsup and Liminf Objectives. ICALP (2) 2009: 1-15 - [c16]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
Expressiveness and Closure Properties for Quantitative Languages. LICS 2009: 199-208 - [c15]Dietmar Berwanger, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, Thomas A. Henzinger:
Alpaga: A Tool for Solving Parity Games with Imperfect Information. TACAS 2009: 58-61 - [i5]Dietmar Berwanger, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, Thomas A. Henzinger:
Alpaga: A Tool for Solving Parity Games with Imperfect Information. CoRR abs/0901.4728 (2009) - [i4]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
Expressiveness and Closure Properties for Quantitative Languages. CoRR abs/0905.2195 (2009) - [i3]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
Qualitative Analysis of Partially-observable Markov Decision Processes. CoRR abs/0909.1645 (2009) - [i2]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
Probabilistic Weighted Automata. CoRR abs/0909.1647 (2009) - 2008
- [j5]Martin De Wulf, Laurent Doyen, Nicolas Markey, Jean-François Raskin:
Robust safety of timed automata. Formal Methods Syst. Des. 33(1-3): 45-84 (2008) - [j4]Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin:
Equivalence of Labeled Markov Chains. Int. J. Found. Comput. Sci. 19(3): 549-563 (2008) - [c14]Martin De Wulf, Laurent Doyen, Nicolas Maquet, Jean-François Raskin:
Alaska. ATVA 2008: 240-245 - [c13]Dietmar Berwanger, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Sangram Raje:
Strategy Construction for Parity Games with Imperfect Information. CONCUR 2008: 325-339 - [c12]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
Quantitative Languages. CSL 2008: 385-400 - [c11]Laurent Doyen, Thomas A. Henzinger, Barbara Jobstmann, Tatjana Petrov:
Interface theories with component reuse. EMSOFT 2008: 79-88 - [c10]Dietmar Berwanger, Laurent Doyen:
On the Power of Imperfect Information. FSTTCS 2008: 73-82 - [c9]Martin De Wulf, Laurent Doyen, Nicolas Maquet, Jean-François Raskin:
Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking. TACAS 2008: 63-77 - 2007
- [j3]Laurent Doyen:
Robust parametric reachability for timed automata. Inf. Process. Lett. 102(5): 208-213 (2007) - [j2]Jean-François Raskin, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
Algorithms for Omega-Regular Games with Imperfect Information. Log. Methods Comput. Sci. 3(3) (2007) - [c8]Laurent Doyen, Jean-François Raskin:
Improved Algorithms for the Automata-Based Approach to Model-Checking. TACAS 2007: 451-465 - [i1]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin:
Algorithms for Omega-Regular Games with Imperfect Information. CoRR abs/0706.2619 (2007) - 2006
- [c7]Martin De Wulf, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin:
Antichains: A New Algorithm for Checking Universality of Finite Automata. CAV 2006: 17-30 - [c6]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin:
Algorithms for Omega-Regular Games with Imperfect Information, . CSL 2006: 287-302 - [c5]Martin De Wulf, Laurent Doyen, Jean-François Raskin:
A Lattice Theory for Solving Games of Imperfect Information. HSCC 2006: 153-168 - 2005
- [j1]Martin De Wulf, Laurent Doyen, Jean-François Raskin:
Almost ASAP semantics: from timed models to timed implementations. Formal Aspects Comput. 17(3): 319-341 (2005) - [c4]Martin De Wulf, Laurent Doyen, Jean-François Raskin:
Systematic Implementation of Real-Time Models. FM 2005: 139-156 - [c3]Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin:
Automatic Rectangular Refinement of Affine Hybrid Systems. FORMATS 2005: 144-161 - 2004
- [c2]Martin De Wulf, Laurent Doyen, Nicolas Markey, Jean-François Raskin:
Robustness and Implementability of Timed Automata. FORMATS/FTRTFT 2004: 118-133 - [c1]Martin De Wulf, Laurent Doyen, Jean-François Raskin:
Almost ASAP Semantics: From Timed Models to Timed Implementations. HSCC 2004: 296-310
Coauthor Index
[j22] [j19] [e1] [c54] [i29] [c52] [i28] [j17] [c51] [c49] [c48] [i25] [i24] [j16] [j15] [j14] [c47] [i23] [j13] [c44] [c43] [c41] [c40] [i22] [i20] [j12] [c38] [i19] [i17] [j11] [c37] [i15] [c35] [c33] [c32] [i13] [i12] [i10] [j9] [j8] [j7] [c28] [c26] [c25] [c24] [c23] [c22] [i9] [i8] [i7] [i6] [c20] [c19] [c17] [c16] [c15] [i5] [i4] [i3] [i2] [c13] [c12] [j2] [i1] [c6]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
