default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Brihaye
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c54]Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko:
Semantics of Attack-Defense Trees for Dynamic Countermeasures and a New Hierarchy of Star-Free Languages. LATIN (2) 2024: 257-271- 2023
- [c53]Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko:
Sémantique Formelle à Deux Joueurs pour Arbres d'Attaque. CNIA 2023 - [c52]Thomas Brihaye, Aline Goeminne, James C. A. Main, Mickael Randour:
Reachability Games and Friends: A Journey Through the Lens of Memory and Complexity (Invited Talk). FSTTCS 2023: 1:1-1:26 - [c51]Louise Sadoine, Zacharie De Grève, Thomas Brihaye:
Impact of retail electricity prices and grid tariff structure on the operation of resources scheduling in Renewable Energy Communities. ISGT EUROPE 2023: 1-5 - [c50]Thomas Brihaye
, Véronique Bruyère, Gaspard Reghem:
Quantitative Reachability Stackelberg-Pareto Synthesis Is NEXPTIME-Complete. RP 2023: 70-84 - [c49]Thomas Brihaye, Aline Goeminne:
Multi-weighted Reachability Games. RP 2023: 85-97 - [i27]Louise Sadoine, Zacharie De Grève, Thomas Brihaye:
Valuing the Electricity Produced Locally in Renewable Energy Communities through Noncooperative Resources Scheduling Games. CoRR abs/2305.04085 (2023) - [i26]Thomas Brihaye, Véronique Bruyère, Gaspard Reghem:
Quantitative Reachability Stackelberg-Pareto Synthesis is NEXPTIME-Complete. CoRR abs/2308.09443 (2023) - [i25]Thomas Brihaye, Aline Goeminne:
Multi-Weighted Reachability Games. CoRR abs/2308.09625 (2023) - [i24]Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko:
Semantics of Attack-Defense Trees for Dynamic Countermeasures and a New Hierarchy of Star-free Languages. CoRR abs/2312.00458 (2023) - 2022
- [j26]Patricia Bouyer, Thomas Brihaye, Mickael Randour, Cédric Rivière, Pierre Vandenhove:
Decisiveness of stochastic systems and its application to hybrid models. Inf. Comput. 289(Part): 104861 (2022) - [j25]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege:
One-Clock Priced Timed Games with Negative Weights. Log. Methods Comput. Sci. 18(3) (2022) - [c48]Louise Sadoine, Martin Hupez, Zacharie De Grève, Thomas Brihaye:
Towards Decentralized Models for Day-Ahead Scheduling of Energy Resources in Renewable Energy Communities. OR 2022: 321-329 - [c47]Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko:
Adversarial Formal Semantics of Attack Trees and Related Problems. GandALF 2022: 162-177 - 2021
- [j24]Mikolaj Bojanczyk, Thomas Brihaye, Christoph Haase, Slawomir Lasota, Joël Ouaknine, Igor Potapov:
Preface. Inf. Comput. 277: 104579 (2021) - [j23]Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin:
Constrained existence problem for weak subgame perfect equilibria with ω-regular Boolean objectives. Inf. Comput. 278: 104594 (2021) - [j22]Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Nathan Thomasset:
On relevant equilibria in reachability games. J. Comput. Syst. Sci. 119: 211-230 (2021) - 2020
- [j21]Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Stéphane Le Roux:
On the termination of dynamics in sequential games. Inf. Comput. 272: 104505 (2020) - [j20]Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard:
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games. Log. Methods Comput. Sci. 16(4) (2020) - [j19]Thomas Brihaye, Florent Delgrange, Youssouf Oualhadj, Mickael Randour:
Life is Random, Time is Not: Markov Decision Processes with Window Objectives. Log. Methods Comput. Sci. 16(4) (2020) - [c46]Thomas Brihaye, Aline Goeminne:
On Subgame Perfect Equilibria in Turn-Based Reachability Timed Games. FORMATS 2020: 94-110 - [c45]Patricia Bouyer, Thomas Brihaye, Mickael Randour, Cédric Rivière, Pierre Vandenhove:
Decisiveness of Stochastic Systems and its Application to Hybrid Models. GandALF 2020: 149-165 - [i23]Thomas Brihaye, Aline Goeminne:
On Subgame Perfect Equilibria in Turn-Based Reachability Timed Games. CoRR abs/2006.10491 (2020) - [i22]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Paulin Fournier:
Taming denumerable Markov decision processes with decisiveness. CoRR abs/2008.10426 (2020) - [i21]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege:
One-Clock Priced Timed Games with Arbitrary Weights. CoRR abs/2009.03074 (2020) - [i20]Patricia Bouyer, Thomas Brihaye, Mickael Randour, Cédric Rivière, Pierre Vandenhove:
Decisiveness of Stochastic Systems and its Application to Hybrid Models (Full Version). CoRR abs/2009.13152 (2020)
2010 – 2019
- 2019
- [c44]Thomas Brihaye, Florent Delgrange, Youssouf Oualhadj, Mickael Randour:
Life Is Random, Time Is Not: Markov Decision Processes with Window Objectives. CONCUR 2019: 8:1-8:18 - [c43]Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard:
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games. CONCUR 2019: 13:1-13:16 - [c42]Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Benjamin Monmege, Bruno Quoitin:
Dynamics on Games: Simulation-Based Techniques and Applications to Routing. FSTTCS 2019: 35:1-35:14 - [c41]Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Nathan Thomasset:
On Relevant Equilibria in Reachability Games. RP 2019: 48-62 - [i19]Thomas Brihaye, Florent Delgrange, Youssouf Oualhadj, Mickael Randour:
Life is Random, Time is Not: Markov Decision Processes with Window Objectives. CoRR abs/1901.03571 (2019) - [i18]Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard:
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games (full version). CoRR abs/1905.00784 (2019) - [i17]Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Nathan Thomasset:
On Relevant Equilibria in Reachability Games. CoRR abs/1907.05481 (2019) - [i16]Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Benjamin Monmege, Bruno Quoitin:
Dynamics on Games: Simulation-Based Techniques and Applications to Routing. CoRR abs/1910.00094 (2019) - 2018
- [j18]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Pierre Carlier:
When are stochastic transition systems tameable? J. Log. Algebraic Methods Program. 99: 41-96 (2018) - [c40]Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Arthur Milchior, Benjamin Monmege:
Efficient Algorithms and Tools for MITL Model-Checking and Synthesis. ICECCS 2018: 180-184 - [c39]Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin:
Constrained Existence Problem for Weak Subgame Perfect Equilibria with ω-Regular Boolean Objectives. GandALF 2018: 16-29 - [i15]Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin:
Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives. CoRR abs/1806.05544 (2018) - 2017
- [j17]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege:
Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games. Acta Informatica 54(1): 85-125 (2017) - [c38]Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege:
MightyL: A Compositional Translation from MITL to Timed Automata. CAV (1) 2017: 421-440 - [c37]Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege:
Timed-Automata-Based Verification of MITL over Signals. TIME 2017: 7:1-7:19 - [c36]Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Stéphane Le Roux:
Dynamics and Coalitions in Sequential Games. GandALF 2017: 136-150 - [i14]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Pierre Carlier:
When are Stochastic Transition Systems Tameable? CoRR abs/1703.04806 (2017) - 2016
- [c35]Patricia Bouyer, Thomas Brihaye, Pierre Carlier, Quentin Menet:
Compositional Design of Stochastic Timed Automata. CSR 2016: 117-130 - [c34]Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege, Nathalie Sznajder:
Real-Time Synthesis is Hard! FORMATS 2016: 105-120 - [c33]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Pierre Carlier:
Analysing Decisive Stochastic Processes. ICALP 2016: 101:1-101:14 - [c32]Thomas Brihaye, Amit Kumar Dhar, Gilles Geeraerts, Axel Haddad, Benjamin Monmege:
Efficient Energy Distribution in a Smart Grid using Multi-Player Games. Cassting/SynCoP 2016: 1-12 - [e1]Thomas Brihaye, Benoît Delahaye, Loïg Jezequel, Nicolas Markey, Jirí Srba:
Proceedings Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters, Cassting/SynCoP 2016, Eindhoven, The Netherlands, April 2-3, 2016. EPTCS 220, 2016 [contents] - [i13]Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege, Nathalie Sznajder:
Real-Time Synthesis is Hard! CoRR abs/1606.07124 (2016) - 2015
- [j16]Thomas Brihaye, Axel Haddad, Quentin Menet:
Simple strategies for Banach-Mazur games and sets of probability 1. Inf. Comput. 245: 17-35 (2015) - [c31]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege:
To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. CONCUR 2015: 297-310 - [c30]Thomas Brihaye, Véronique Bruyère, Noémie Meunier, Jean-François Raskin:
Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability. CSL 2015: 504-518 - [c29]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege:
Simple Priced Timed Games are not That Simple. FSTTCS 2015: 278-292 - [c28]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, Gabriel Renault:
Quantitative Games under Failures. FSTTCS 2015: 293-306 - [i12]Thomas Brihaye, Véronique Bruyère, Noémie Meunier, Jean-François Raskin:
Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability. CoRR abs/1504.01557 (2015) - [i11]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, Gabriel Renault:
Quantitative Games under Failures. CoRR abs/1504.06744 (2015) - [i10]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege:
Simple Priced Timed Games Are Not That Simple. CoRR abs/1507.03786 (2015) - 2014
- [j15]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Quentin Menet, Christel Baier, Marcus Größer, Marcin Jurdzinski:
Stochastic Timed Automata. Log. Methods Comput. Sci. 10(4) (2014) - [j14]Thomas Brihaye, Véronique Bruyère, Julie De Pril:
On Equilibria in Quantitative Games with Reachability/Safety Objectives. Theory Comput. Syst. 54(2): 150-189 (2014) - [c27]Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, Ashutosh Trivedi:
Adding Negative Prices to Priced Timed Games. CONCUR 2014: 560-575 - [c26]Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts:
On MITL and Alternating Timed Automata over Infinite Words. FORMATS 2014: 69-84 - [c25]Nathalie Bertrand, Thomas Brihaye, Blaise Genest:
Deciding the Value 1 Problem for Reachability in 1-Clock Decision Stochastic Timed Automata. QEST 2014: 313-328 - [i9]Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, Ashutosh Trivedi:
Adding Negative Prices to Priced Timed Games. CoRR abs/1404.5894 (2014) - [i8]Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts:
On MITL and alternating timed automata over infinite words. CoRR abs/1406.4395 (2014) - [i7]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege:
To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. CoRR abs/1407.5030 (2014) - 2013
- [c24]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 - [c23]Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts:
On MITL and Alternating Timed Automata. FORMATS 2013: 47-61 - [c22]Thomas Brihaye, Julie De Pril, Sven Schewe:
Multiplayer Cost Games with Simple Nash Equilibria. LFCS 2013: 59-73 - [c21]Thomas Brihaye, Quentin Menet:
Fairly Correct Systems: Beyond omega-regularity. GandALF 2013: 21-34 - [i6]Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts:
On MITL and alternating timed automata. CoRR abs/1304.2814 (2013) - [i5]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Amélie Stainer:
Emptiness and Universality Problems in Timed Automata with Positive Frequency. CoRR abs/1309.2842 (2013) - 2012
- [j13]Thomas Brihaye, Véronique Bruyère, Julie De Pril, Hugo Gimbert:
On Subgame Perfection in Quantitative Reachability Games. Log. Methods Comput. Sci. 9(1) (2012) - [c20]Thomas Brihaye, Véronique Bruyère, Julie De Pril, Hugo Gimbert:
Subgame Perfection for Equilibria in Quantitative Reachability Games. FoSSaCS 2012: 286-300 - [c19]Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski, Quentin Menet:
Almost-Sure Model-Checking of Reactive Timed Automata. QEST 2012: 138-147 - [i4]Thomas Brihaye, Véronique Bruyère, Julie De Pril:
On Equilibria in Quantitative Games with Reachability/Safety Objectives. CoRR abs/1205.4889 (2012) - [i3]Thomas Brihaye, Julie De Pril, Sven Schewe:
Multiplayer Cost Games with Simple Nash Equilibria. CoRR abs/1210.3548 (2012) - [i2]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
- [c18]Thomas Brihaye, Véronique Bruyère, Laurent Doyen, Marc Ducobu, Jean-François Raskin:
Antichain-Based QBF Solving. ATVA 2011: 183-197 - [c17]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Amélie Stainer:
Emptiness and Universality Problems in Timed Automata with Positive Frequency. ICALP (2) 2011: 246-257 - [c16]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 - [i1]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) - 2010
- [j12]Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier:
O-Minimal Hybrid Reachability Games. Log. Methods Comput. Sci. 6(1) (2010) - [j11]Thomas Brihaye, Marc Jungers, Samson Lasaulce, Nicolas Markey, Ghassan Oreiby:
Using Model Checking for Analyzing Distributed Power Control Problems. EURASIP J. Wirel. Commun. Netw. 2010 (2010) - [j10]Thomas Brihaye, Véronique Bruyère, Elaine Render:
Formal language properties of hybrid systems with strong resets. RAIRO Theor. Informatics Appl. 44(1): 79-111 (2010) - [c15]Thomas Brihaye, Véronique Bruyère, Julie De Pril:
Equilibria in Quantitative Reachability Games. CSR 2010: 72-83
2000 – 2009
- 2009
- [j9]Thomas Brihaye, Christian Michaux, Cédric Rivière:
Cell decomposition and dimension function in the theory of closed ordered differential fields. Ann. Pure Appl. Log. 159(1-2): 111-128 (2009) - [j8]Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier:
Weighted o-minimal hybrid systems. Ann. Pure Appl. Log. 161(3): 268-288 (2009) - [c14]Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye:
When Are Timed Automata Determinizable? ICALP (2) 2009: 43-54 - [c13]Thomas Brihaye, Arnaud Da Costa Lopes, François Laroussinie, Nicolas Markey:
ATL with Strategy Contexts and Bounded Memory. LFCS 2009: 92-106 - 2008
- [c12]Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski:
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets. FORMATS 2008: 63-77 - [c11]Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer:
Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata. LICS 2008: 217-226 - [c10]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Nicolas Markey:
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics. QEST 2008: 55-64 - [c9]Thomas Brihaye, Nicolas Markey, Mohamed Ghannem, Lionel Rieg:
Good Friends are Hard to Find! TIME 2008: 32-40 - 2007
- [j7]Thomas Brihaye:
Words and Bisimulations of Dynamical Systems. Discret. Math. Theor. Comput. Sci. 9(2) (2007) - [j6]Patricia Bouyer, Thomas Brihaye, Véronique Bruyère, Jean-François Raskin:
On the optimal reachability problem of weighted timed automata. Formal Methods Syst. Des. 31(2): 135-175 (2007) - [c8]Thomas Brihaye, François Laroussinie, Nicolas Markey, Ghassan Oreiby:
Timed Concurrent Game Structures. CONCUR 2007: 445-459 - [c7]Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer:
Probabilistic and Topological Semantics for Timed Automata. FSTTCS 2007: 179-191 - [c6]Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Prabhu, Jean-François Raskin:
Minimum-Time Reachability in Timed Games. ICALP 2007: 825-837 - [c5]Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier:
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata! LFCS 2007: 69-83 - 2006
- [j5]Thomas Brihaye, Véronique Bruyère, Jean-François Raskin:
On model-checking timed automata with stopwatch observers. Inf. Comput. 204(3): 408-433 (2006) - [j4]Patricia Bouyer, Thomas Brihaye, Nicolas Markey:
Improved undecidability results on weighted timed automata. Inf. Process. Lett. 98(5): 188-194 (2006) - [j3]Thomas Brihaye, Christian Michaux:
Corrigendum to "On the expressiveness and decidability of o-minimal hybrid systems" [J. Complexity 21 (2005) 447-478]. J. Complex. 22(3): 431-434 (2006) - [j2]Thomas Brihaye:
A note on the undecidability of the reachability problem for o-minimal dynamical systems. Math. Log. Q. 52(2): 165-170 (2006) - [c4]Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier:
Control in o-minimal Hybrid Systems. LICS 2006: 367-378 - 2005
- [j1]Thomas Brihaye, Christian Michaux:
On the expressiveness and decidability of o-minimal hybrid systems. J. Complex. 21(4): 447-478 (2005) - [c3]Thomas Brihaye, Véronique Bruyère, Jean-François Raskin:
On Optimal Timed Strategies. FORMATS 2005: 49-64 - 2004
- [c2]Thomas Brihaye, Véronique Bruyère, Jean-François Raskin:
Model-Checking for Weighted Timed Automata. FORMATS/FTRTFT 2004: 277-292 - [c1]Thomas Brihaye, Christian Michaux, Cédric Rivière, Christophe Troestler:
On O-Minimal Hybrid Systems. HSCC 2004: 219-233
Coauthor Index
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-09-13 00:45 CEST 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:
