default search action
Laurent Fribourg
Person information
- affiliation: ENS Cachan, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j26]Anas Makdesi
, Antoine Girard
Data-Driven Models of Monotone Systems. IEEE Trans. Autom. Control. 69(8): 5294-5309 (2024) - 2023
- [j25]Daniel M. Xavier
Training and Generalization Errors for Underparameterized Neural Networks. IEEE Control. Syst. Lett. 7: 3926-3931 (2023) - [j24]Anas Makdesi
Safe learning-based model predictive control using the compatible models approach. Eur. J. Control 74: 100849 (2023) - [i15]Jawher Jerray, Laurent Fribourg:
Proving the Convergence to Limit Cycles using Periodically Decreasing Jacobian Matrix Measures. CoRR abs/2304.01691 (2023) - 2022
- [j23]Jawher Jerray, Adnane Saoud
Using Euler's Method to Prove the Convergence of Neural Networks. IEEE Control. Syst. Lett. 6: 3224-3228 (2022) - [j22]Jawher Jerray, Adnane Saoud, Laurent Fribourg
Asymptotic error in Euler's method with a constant step size. Eur. J. Control 68: 100694 (2022) - 2021
- [j21]Adnane Saoud, Antoine Girard, Laurent Fribourg:
Assume-guarantee contracts for continuous-time systems. Autom. 134: 109910 (2021) - [j20]Étienne André, Emmanuel Coquard, Laurent Fribourg, Jawher Jerray, David Lesens:
Parametric Schedulability Analysis of a Launcher Flight Control System under Reactivity Constraints. Fundam. Informaticae 182(1): 31-67 (2021) - [j19]Laurent Fribourg, Eric Goubault, Sameh Mohamed, Marian Mrozek, Sylvie Putot:
A topological method for finding invariant sets of continuous systems. Inf. Comput. 277: 104581 (2021) - [j18]Adnane Saoud
Contract-Based Design of Symbolic Controllers for Safety in Distributed Multiperiodic Sampled-Data Systems. IEEE Trans. Autom. Control. 66(3): 1055-1070 (2021) - [c86]Anas Makdesi, Antoine Girard, Laurent Fribourg:
Efficient Data-Driven Abstraction of Monotone Systems with Disturbances. ADHS 2021: 49-54 - [c85]Jawher Jerray
Determination of limit cycles using stroboscopic set-valued maps. ADHS 2021: 139-144 - [c84]Jawher Jerray
An Approximation of Minimax Control using Random Sampling and Symbolic Computation. ADHS 2021: 265-270 - [c83]Jawher Jerray
Robust optimal periodic control using guaranteed Euler's method. ACC 2021: 986-991 - [c82]Mohamed Fnadi
Guaranteed Identification of Viscous Friction for a Nonlinear Inverted Pendulum Through Interval Analysis and Set Inversion. ACC 2021: 3920-3926 - [c81]Anas Makdesi, Antoine Girard, Laurent Fribourg:
Data-Driven Abstraction of Monotone Systems. L4DC 2021: 803-814 - [i14]Jawher Jerray
Robust optimal periodic control using guaranteed Euler's method. CoRR abs/2103.10125 (2021) - [i13]Jawher Jerray, Laurent Fribourg:
Constructing invariant tori using guaranteed Euler method. CoRR abs/2106.04251 (2021) - [i12]Étienne André, Emmanuel Coquard, Laurent Fribourg, Jawher Jerray, David Lesens:
Parametric schedulability analysis of a launcher flight control system under reactivity constraints. CoRR abs/2112.07548 (2021) - 2020
- [c80]Jawher Jerray
Guaranteed phase synchronization of hybrid oscillators using symbolic Euler's method (verification challenge). ARCH 2020: 197-208 - [e4]Laurent Fribourg, Matthias Heizmann:
Proceedings 8th International Workshop on Verification and Program Transformation and 7th Workshop on Horn Clauses for Verification and Synthesis, VPT/HCVS@ETAPS 2020, Dublin, Ireland, 25-26th April 2020. EPTCS 320, 2020 [contents] - [i11]Jawher Jerray
Guaranteed phase synchronization of hybrid oscillators using symbolic Euler's method: The Brusselator and biped examples. CoRR abs/2006.09993 (2020) - [i10]Jawher Jerray, Laurent Fribourg, Étienne André:
Robust optimal control using dynamic programming and guaranteed Euler's method. CoRR abs/2007.13644 (2020) - [i9]Jawher Jerray, Laurent Fribourg:
Generation of bounded invariants via stroboscopic set-valued maps: Application to the stability analysis of parametric time-periodic systems. CoRR abs/2012.09310 (2020)
2010 – 2019
- 2019
- [c79]Étienne André, Emmanuel Coquard, Laurent Fribourg, Jawher Jerray
Parametric Schedulability Analysis of a Launcher Flight Control System Under Reactivity Constraints. ACSD 2019: 13-22 - [c78]Adrien Le Coënt, Laurent Fribourg:
Guaranteed Control of Sampled Switched Systems using Semi-Lagrangian Schemes and One-Sided Lipschitz Constants. CDC 2019: 599-604 - [c77]Adrien Le Coënt, Laurent Fribourg:
Guaranteed Optimal Reachability Control of Reaction-Diffusion Equations Using One-Sided Lipschitz Constants and Model Reduction. CyPhy/WESE 2019: 181-202 - [c76]Jean-Luc Danger, Laurent Fribourg, Ulrich Kühne, Maha Naceur:
LAOCOÖN: A Run-Time Monitoring and Verification Approach for Hardware Trojan Detection. DSD 2019: 269-276 - [c75]Daniele Zonetti
A symbolic approach to voltage stability and power sharing in time-varying DC microgrids. ECC 2019: 903-909 - [c74]Étienne André, Laurent Fribourg, Jean-Marc Mota, Romain Soulat:
Verification of an Industrial Asynchronous Leader Election Algorithm Using Abstractions and Parametric Model Checking. VMCAI 2019: 409-424 - [i8]Adrien Le Coënt, Laurent Fribourg:
Guaranteed Control of Sampled Switched Systems using Semi-Lagrangian Schemes and One-Sided Lipschitz Constants. CoRR abs/1903.05882 (2019) - [i7]Étienne André, Emmanuel Coquard, Laurent Fribourg, Jawher Jerray
Parametric schedulability analysis of a launcher flight control system under reactivity constraints. CoRR abs/1903.07217 (2019) - [i6]Adrien Le Coënt, Laurent Fribourg:
Controlled Recurrence of a Biped with Torso. CoRR abs/1903.10746 (2019) - [i5]Adrien Le Coënt, Laurent Fribourg:
Guaranteed optimal reachability control of reaction-diffusion equations using one-sided Lipschitz constants and model reduction. CoRR abs/1907.12155 (2019) - 2018
- [j17]Adrien Le Coënt, Julien Alexandre Dit Sandretto, Alexandre Chapoutot
An improved algorithm for the control synthesis of nonlinear sampled switched systems. Formal Methods Syst. Des. 53(3): 363-383 (2018) - [j16]Adrien Le Coënt, Laurent Fribourg, Nicolas Markey
Compositional synthesis of state-dependent switching control. Theor. Comput. Sci. 750: 53-68 (2018) - [c73]Adrien Le Coënt, Laurent Fribourg, Jonathan Vacher
Control Synthesis for Stochastic Switched Systems using the Tamed Euler Method. ADHS 2018: 259-264 - [c72]Adnane Saoud, Antoine Girard, Laurent Fribourg:
Contract Based Design of Symbolic Controllers for Interconnected Multiperiodic Sampled-Data Systems. CDC 2018: 773-779 - [c71]Adrien Le Coënt, Laurent Fribourg:
Controlled Recurrence of a Biped with Torso. CyPhy/WESE 2018: 154-169 - [c70]Adnane Saoud, Antoine Girard, Laurent Fribourg:
On the Composition of Discrete and Continuous-time Assume-Guarantee Contracts for Invariance. ECC 2018: 435-440 - [c69]Adnane Saoud, Antoine Girard, Laurent Fribourg:
Contract based Design of Symbolic Controllers for Vehicle Platooning. HSCC 2018: 277-278 - [i4]Étienne André, Laurent Fribourg, Jean-Marc Mota, Romain Soulat:
Verification of an industrial asynchronous leader election algorithm using abstractions and parametric model checking. CoRR abs/1812.08949 (2018) - 2017
- [c68]Laurent Fribourg:
Euler's Method Applied to the Control of Switched Systems. FORMATS 2017: 3-21 - [c67]Adrien Le Coënt, Julien Alexandre Dit Sandretto, Alexandre Chapoutot
Distributed Control Synthesis Using Euler's Method. RP 2017: 118-131 - [c66]Adrien Le Coënt, Florian De Vuyst, Ludovic Chamoin, Laurent Fribourg:
Control Synthesis of Nonlinear Sampled Switched Systems using Euler's Method. SNR@ETAPS 2017: 18-33 - 2016
- [c65]Laurent Fribourg, Eric Goubault, Sylvie Putot, Sameh Mohamed:
A Topological Method for Finding Invariant Sets of Switched Systems. HSCC 2016: 61-70 - [c64]Adrien Le Coënt, Laurent Fribourg, Nicolas Markey
Distributed Synthesis of State-Dependent Switching Control. RP 2016: 119-133 - [c63]Adrien Le Coënt, Laurent Fribourg, Romain Soulat:
Compositional Analysis of Boolean Networks Using Local Fixed-Point Iterations. RP 2016: 134-147 - [i3]Adrien Le Coënt, Laurent Fribourg, Nicolas Markey, Florian De Vuyst, Ludovic Chamoin:
Distributed Synthesis of State-Dependent Switching Control. CoRR abs/1604.01745 (2016) - [i2]Adrien Le Coënt, Julien Alexandre Dit Sandretto, Alexandre Chapoutot, Laurent Fribourg:
Control of nonlinear switched systems based on validated simulation. CoRR abs/1611.06692 (2016) - 2015
- [c62]Laurent Fribourg, Eric Goubault, Sameh Mohamed, Marian Mrozek, Sylvie Putot:
A Topological Method for Finding Invariant Sets of Continuous Systems. RP 2015: 63-75 - [c61]Adrien Le Coënt, Florian De Vuyst
Guaranteed control of switched control systems using model order reduction and state-space bisection. SynCoP 2015: 33-47 - [c60]Laurent Fribourg, Ulrich Kühne, Nicolas Markey:
Game-based Synthesis of Distributed Controllers for Sampled Switched Systems. SynCoP 2015: 48-62 - 2014
- [j15]Laurent Fribourg, Ulrich Kühne, Romain Soulat:
Finite controlled invariants for sampled switched systems. Formal Methods Syst. Des. 45(3): 303-329 (2014) - [c59]Youcheng Sun
Component-based analysis of hierarchical scheduling using linear hybrid automata. RTCSA 2014: 1-10 - [c58]Gilles Feld, Laurent Fribourg, Denis Labrousse, Bertrand Revol
Correct-by-design Control Synthesis for Multilevel Converters using State Space Decomposition. FSFMA 2014: 5-16 - [c57]Youcheng Sun
Toward Parametric Timed Interfaces for Real-Time Components. SynCoP 2014: 49-64 - 2013
- [j14]Étienne André
An extension of the inverse method to probabilistic timed automata. Formal Methods Syst. Des. 42(2): 119-145 (2013) - [j13]Laurent Fribourg, Ulrich Kühne:
Parametric Verification and Test Coverage for Hybrid Automata using the inverse Method. Int. J. Found. Comput. Sci. 24(2): 233-250 (2013) - [c56]Étienne André
Merge and Conquer: State Merging in Parametric Timed Automata. ATVA 2013: 381-396 - [c55]Laurent Fribourg:
Control of Switching Systems by Invariance Analysis (Invited Talk). FSFMA 2013: 1 - [c54]Laurent Fribourg, Ulrich Kühne, Romain Soulat:
Constructing Attractors of Nonlinear Dynamical Systems. FSFMA 2013: 53-60 - [c53]Youcheng Sun
Parametric Schedulability Analysis of Fixed Priority Real-Time Distributed Systems. FTSCS 2013: 212-228 - [c52]Laurent Fribourg, Romain Soulat:
Stability Controllers for Sampled Switched Systems. RP 2013: 135-145 - [e3]Víctor A. Braberman, Laurent Fribourg:
Formal Modeling and Analysis of Timed Systems - 11th International Conference, FORMATS 2013, Buenos Aires, Argentina, August 29-31, 2013. Proceedings. Lecture Notes in Computer Science 8053, Springer 2013, ISBN 978-3-642-40228-9 [contents] - [i1]Youcheng Sun, Romain Soulat, Giuseppe Lipari, Étienne André, Laurent Fribourg:
Parametric Schedulability Analysis of Fixed Priority Real-Time Distributed Systems. CoRR abs/1302.1306 (2013) - 2012
- [c51]Étienne André
IMITATOR 2.5: A Tool for Analyzing Robustness in Scheduling Problems. FM 2012: 33-36 - [c50]Étienne André
Enhancing the Inverse Method with State Merging. NASA Formal Methods 2012: 100-105 - [c49]Laurent Fribourg, Romain Soulat, David Lesens, Pierre Moro:
Robustness Analysis for Scheduling Problems Using the Inverse Method. TIME 2012: 73-80 - 2011
- [c48]Laurent Fribourg, Ulrich Kühne:
Parametric Verification and Test Coverage for Hybrid Automata Using the Inverse Method. RP 2011: 191-204 - [c47]Laurent Fribourg, Bertrand Revol, Romain Soulat:
Synthesis of Switching Rules for Ensuring Reachability Properties of Sampled Linear Systems. INFINITY 2011: 35-48 - 2010
- [c46]Étienne André
Behavioral Cartography of Timed Automata. RP 2010: 76-90
2000 – 2009
- 2009
- [j12]Étienne André, Laurent Fribourg, Jeremy Sproston:
An Extension of the Inverse Method to Probabilistic Timed Automata. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 23 (2009) - [j11]Remy Chevallier, Emmanuelle Encrenaz-Tiphène, Laurent Fribourg, Weiwen Xu:
Timed verification of the generic architecture of a memory circuit using parametric timed automata. Formal Methods Syst. Des. 34(1): 59-81 (2009) - [j10]Étienne André
An Inverse Method for Parametric Timed Automata. Int. J. Found. Comput. Sci. 20(5): 819-836 (2009) - [c45]Laurent Fribourg, Étienne André:
An Inverse Method for Policy-Iteration Based Algorithms. INFINITY 2009: 44-61 - 2008
- [c44]Najla Chamseddine, Marie Duflot
Computing Expected Absorption Times for Parametric Determinate Probabilistic Timed Automata. QEST 2008: 254-263 - [c43]Étienne André
An Inverse Method for Parametric Timed Automata. RP 2008: 29-46 - 2006
- [j9]Laurent Fribourg, Stéphane Messika, Claudine Picaronny:
Coupling and self-stabilization. Distributed Comput. 18(3): 221-232 (2006) - [c42]Remy Chevallier, Emmanuelle Encrenaz-Tiphène, Laurent Fribourg, Weiwen Xu:
Verification of the Generic Architecture of a Memory Circuit Using Parametric Timed Automata. FORMATS 2006: 113-127 - [c41]Emmanuelle Encrenaz, Laurent Fribourg:
Time Separation of Events: An Inverse Method. LIX 2006: 135-148 - 2005
- [c40]Laurent Fribourg, Stéphane Messika:
Brief announcement: coupling for Markov decision processes - application to self-stabilization with arbitrary schedulers. PODC 2005: 322 - 2004
- [j8]Marie Duflot
Randomized dining philosophers without fairness assumption. Distributed Comput. 17(1): 65-76 (2004) - [c39]Laurent Fribourg, Stéphane Messika, Claudine Picaronny:
Coupling and Self-stabilization.. DISC 2004: 201-215 - [c38]Marie Duflot, Laurent Fribourg, Thomas Hérault
Probabilistic Model Checking of the CSMA/CD Protocol Using PRISM and APMC. AVoCS 2004: 195-214 - 2003
- [j7]Béatrice Bérard, Laurent Fribourg, Francis Klay, Jean-François Monin:
Compared Study of Two Correctness Proofs for the Standardized. Formal Methods Syst. Des. 22(1): 59-86 (2003) - 2002
- [c37]Marie Duflot
Randomized Dining Philosophers without Fairness Assumption. IFIP TCS 2002: 169-180 - 2001
- [j6]Joffroy Beauquier, Béatrice Bérard, Laurent Fribourg, Frédéric Magniette
Proving convergence of self-stabilizing systems using first-order rewriting and regular languages. Distributed Comput. 14(2): 83-95 (2001) - [c36]Marie Duflot
Unavoidable Configurations of Parameterized Rings of Processes. CONCUR 2001: 472-486 - [c35]Marie Duflot
Randomized Finite-State Distributed Algorithms as Markov Chains. DISC 2001: 240-254 - [e2]Laurent Fribourg:
Computer Science Logic, 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001, Proceedings. Lecture Notes in Computer Science 2142, Springer 2001, ISBN 3-540-42554-3 [contents] - 2000
- [c34]Laurent Fribourg:
Petri Nets, Flat Languages and Linear Arithmetic. WFLP 2000: 344-365
1990 – 1999
- 1999
- [c33]Béatrice Bérard, Laurent Fribourg:
Automated Verification of a Parametric Real-Time Program: The ABR Conformance Protocol. CAV 1999: 96-107 - [c32]Béatrice Bérard, Laurent Fribourg:
Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic. CONCUR 1999: 178-193 - [c31]Laurent Fribourg:
Constraint Logic Programming Applied to Model Checking. LOPSTR 1999: 30-41 - [c30]Joffroy Beauquier, Béatrice Bérard, Laurent Fribourg:
A New Rewrite Method for Convergence of Self-Stabilizing Systems. DISC 1999: 240-253 - 1998
- [c29]Marcos Veloso Peixoto, Laurent Fribourg:
Unfolding Parametric Automata. LATIN 1998: 88-101 - 1997
- [j5]Laurent Fribourg, Hans Olsén:
A Decompositional Approach for Computing Least Fixed-Points of Datalog Programs with Z-Counters. Constraints An Int. J. 2(3/4): 305-335 (1997) - [c28]Laurent Fribourg, Hans Olsén:
Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic. CONCUR 1997: 213-227 - [c27]Laurent Fribourg, Hans Olsén:
Reachability sets of parameterized rings as regular languages. INFINITY 1997: 40 - 1996
- [c26]Laurent Fribourg, Julian Richardson:
Symbolic Verification with Gap-Order Constraints. LOPSTR 1996: 20-37 - [c25]Laurent Fribourg, Hans Olsén:
Reductions of Petri Nets and Unfolding of Propositional Logic Programs. LOPSTR 1996: 187-203 - 1994
- [c24]Laurent Fribourg, Marcos Veloso Peixoto:
Bottom-up Evaluation of Datalog Programs with Arithmetic Constraints. CADE 1994: 311-325 - [c23]Laurent Fribourg, Marcos Veloso Peixoto:
Bottom-Up Evaluation of Datalog Programs with Incremental Arguments and Linear Arithmetic Constraints. ILPS Workshop: Constraints and Databases 1994 - [e1]Laurent Fribourg, Franco Turini:
Logic Programming Synthesis and Transformation - Meta-Programming in Logic. 4th Internation Workshops, LOPSTR'94 and META'94, Pisa, Italy, June 20-21, 1994, Proceedings. Lecture Notes in Computer Science 883, Springer 1994, ISBN 3-540-58792-6 [contents] - 1993
- [c22]Laurent Fribourg, Marcos Veloso Peixoto:
Concurrent Constraint Automata. ILPS 1993: 656 - 1992
- [c21]Laurent Fribourg:
Mixing List Recursion and Arithmetic. LICS 1992: 419-429 - [c20]Laurent Fribourg, Hans Olsén:
A Unifying View of Structural Induction and Computation Induction for Logic Programs. LOPSTR 1992: 46-60 - 1991
- [c19]Laurent Fribourg:
Extracting Logic Programs from Proofs that Use Extended Prolog Execution and Induction. ICLP Workshop on Construction of Logic Programs 1991: 39-66 - [c18]P. H. Cheong, Laurent Fribourg:
A Survey of the Implementations of Narrowing. Declarative Programming 1991: 177-187 - [c17]P. H. Cheong, Laurent Fribourg:
Efficient Integration of Simplifications into Prolog. PLILP 1991: 359-370 - [c16]Laurent Fribourg:
Automatic Generation of Simplification Lemmas for Inductive Proofs. ISLP 1991: 103-116 - 1990
- [c15]Laurent Fribourg:
Extracting Logic Programs from Proofs that Use Extended Prolog Execution and Induction. ICLP 1990: 685-699 - [c14]Laurent Fribourg:
A New Presburger Arithmetic Decision Procedure Based on Extended Prolog Execution. PLILP 1990: 174-188
1980 – 1989
- 1989
- [j4]Laurent Fribourg:
A Strong Restriction of the Inductive Completion Procedure. J. Symb. Comput. 8(3): 253-276 (1989) - 1988
- [c13]Laurent Fribourg:
Functional Extensions to Prolog: Are they Needed? ALP 1988: 21-29 - [c12]Laurent Fribourg:
Equivalence-Preserving Transformations of Inductive Properties of Prolog Programs. ICLP/SLP 1988: 893-908 - 1987
- [c11]Laurent Fribourg:
On the Use of Conditional Rewrite Rules in Inductive Theorem Proving. CTRS 1987: 56-61 - [c10]Laurent Fribourg:
List concatenation via extended unification. SPLT 1987: 45-58 - [c9]Laurent Fribourg:
SLOG: A Logic Interpreter for Equational Clauses. STACS 1987: 479-480 - 1986
- [j3]Luc Bougé, N. Choquet, Laurent Fribourg, Marie-Claude Gaudel:
Test sets generation from algebraic specifications using logic programming. J. Syst. Softw. 6(4): 343-360 (1986) - [c8]Laurent Fribourg:
A Strong Restriction of the Inductive Completion Procedure. ICALP 1986: 105-115 - 1985
- [j2]Laurent Fribourg:
A Superposition Oriented Theorem Prover. Theor. Comput. Sci. 35: 129-164 (1985) - [c7]N. Choquet, Laurent Fribourg, Anne Mauboussin:
Runnable protocol specifications using the logic interpreter SLOG. PSTV 1985: 149-168 - [c6]Laurent Fribourg:
Handling Function Definitions through Innermost Superposition and Rewriting. RTA 1985: 325-344 - [c5]Laurent Fribourg:
SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting. SLP 1985: 172-184 - [c4]Luc Bougé, N. Choquet, Laurent Fribourg, Marie-Claude Gaudel:
Application of Prolog to Test Sets Generation from Algebraic Specifications. TAPSOFT, Vol.2 1985: 261-275 - 1984
- [j1]Laurent Fribourg:
Oriented Equational Clauses as a Programming Language. J. Log. Program. 1(2): 165-177 (1984) - [c3]Laurent Fribourg:
A Narrowing Procedure for Theories with Constructors. CADE 1984: 259-281 - [c2]Laurent Fribourg:
Oriented Equational Clauses as a Programming Language. ICALP 1984: 162-173 - 1983
- [c1]Laurent Fribourg:
A Superposition Oriented Theorem Prover. IJCAI 1983: 923-925
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-08-23 19:23 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: