default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilippe Schnoebelen
Person information
- affiliation: ENS Cachan, Specification and Verification Laboratory (LSV)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2001
[b1]Béatrice Bérard, Michel Bidoit, Alain Finkel, François Laroussinie, Antoine Petit, Laure Petrucci, Philippe Schnoebelen, Pierre McKenzie:
Systems and Software Verification, Model-Checking Techniques and Tools. Springer 2001, ISBN 978-3-642-07478-3, pp. I-XII, 1-190
Journal Articles
- 2019
- [j32]Simon Halfon, Philippe Schnoebelen:
On shuffle products, acyclic automata and piecewise-testable languages. Inf. Process. Lett. 145: 68-73 (2019) - [j31]Prateek Karandikar, Philippe Schnoebelen:
The height of piecewise-testable languages and the complexity of the logic of subwords. Log. Methods Comput. Sci. 15(2) (2019) - [j30]Jérôme Leroux, M. Praveen, Philippe Schnoebelen, Grégoire Sutre:
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems. Log. Methods Comput. Sci. 15(4) (2019) - 2016
- [j29]Prateek Karandikar, Matthias Niewerth, Philippe Schnoebelen:
On the state complexity of closures and interiors of regular languages with subwords and superwords. Theor. Comput. Sci. 610: 91-107 (2016) - 2015
- [j28]Petr Jancar
, Prateek Karandikar, Philippe Schnoebelen:
On Reachability for Unidirectional Channel Systems Extended with Regular Tests. Log. Methods Comput. Sci. 11(2) (2015) - [j27]Prateek Karandikar, Manfred Kufleitner, Philippe Schnoebelen:
On the index of Simon's congruence for piecewise testability. Inf. Process. Lett. 115(4): 515-519 (2015) - [j26]Prateek Karandikar, Philippe Schnoebelen:
Generalized Post Embedding Problems. Theory Comput. Syst. 56(4): 697-716 (2015) - 2014
- [j25]Christoph Haase, Sylvain Schmitz, Philippe Schnoebelen:
The Power of Priority Channel Systems. Log. Methods Comput. Sci. 10(4) (2014) - 2013
- [j24]Nathalie Bertrand, Philippe Schnoebelen:
Computable fixpoints in well-structured symbolic model checking. Formal Methods Syst. Des. 43(2): 233-267 (2013) - 2012
- [j23]Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, James Worrell:
On termination and invariance for faulty channel machines. Formal Aspects Comput. 24(4-6): 595-607 (2012) - 2007
- [j22]Christel Baier, Nathalie Bertrand, Philippe Schnoebelen:
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties. ACM Trans. Comput. Log. 9(1): 5 (2007) - 2006
- [j21]Alexander Rabinovich, Philippe Schnoebelen:
BTL2 and the expressive power of ECTL+. Inf. Comput. 204(7): 1023-1044 (2006) - [j20]Christel Baier, Nathalie Bertrand, Philippe Schnoebelen:
A note on the attractor-property of infinite-state Markov chains. Inf. Process. Lett. 97(2): 58-63 (2006) - [j19]Nicolas Markey, Philippe Schnoebelen:
Mu-calculus path checking. Inf. Process. Lett. 97(6): 225-230 (2006) - [j18]Stéphane Demri, François Laroussinie, Philippe Schnoebelen:
A parametric analysis of the state-explosion problem in model checking. J. Comput. Syst. Sci. 72(4): 547-575 (2006) - [j17]François Laroussinie, Nicolas Markey, Philippe Schnoebelen:
Efficient timed model checking for discrete-time systems. Theor. Comput. Sci. 353(1-3): 249-271 (2006) - [j16]Antonín Kucera, Philippe Schnoebelen:
A general approach to comparing infinite-state systems with their finite-state specifications. Theor. Comput. Sci. 358(2-3): 315-333 (2006) - 2005
- [j15]Parosh Aziz Abdulla, Nathalie Bertrand, Alexander Moshe Rabinovich, Philippe Schnoebelen:
Verification of probabilistic systems with faulty communication. Inf. Comput. 202(2): 141-165 (2005) - [j14]Denis Lugiez, Philippe Schnoebelen:
Decidable first-order transition logics for PA-processes. Inf. Comput. 203(1): 75-113 (2005) - 2004
- [j13]Nicolas Markey, Philippe Schnoebelen:
A PTIME-complete matching problem for SLP-compressed words. Inf. Process. Lett. 90(1): 3-6 (2004) - 2003
- [j12]François Laroussinie, Philippe Schnoebelen, Mathieu Turuani:
On the expressivity and complexity of quantitative branching-time temporal logics. Theor. Comput. Sci. 297(1-3): 297-315 (2003) - 2002
- [j11]Stéphane Demri, Philippe Schnoebelen:
The Complexity of Propositional Linear Temporal Logics in Simple Cases. Inf. Comput. 174(1): 84-103 (2002) - [j10]Philippe Schnoebelen:
Verifying lossy channel systems has nonprimitive recursive complexity. Inf. Process. Lett. 83(5): 251-261 (2002) - [j9]Anne Labroue, Philippe Schnoebelen:
An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems. Nord. J. Comput. 9(1): 118-144 (2002) - [j8]Denis Lugiez, Philippe Schnoebelen:
The regular viewpoint on PA-processes. Theor. Comput. Sci. 274(1-2): 89-115 (2002) - 2001
- [j7]Alain Finkel, Philippe Schnoebelen:
Well-structured transition systems everywhere! Theor. Comput. Sci. 256(1-2): 63-92 (2001) - 2000
- [j6]François Laroussinie, Philippe Schnoebelen:
Specification in CTL+Past for Verification in CTL. Inf. Comput. 156(1-2): 236-263 (2000) - 1995
- [j5]François Laroussinie, Sophie Pinchinat, Philippe Schnoebelen:
Translations Between Modal Logics of Reactive Systems. Theor. Comput. Sci. 140(1): 53-71 (1995) - [j4]François Laroussinie, Philippe Schnoebelen:
A Hierarchy of Temporal Logics with Past. Theor. Comput. Sci. 148(2): 303-324 (1995) - 1991
- [j3]Ferroudja Cherief, Philippe Schnoebelen:
τ-Bisimulations and Full Abstraction for Refinement of Actions. Inf. Process. Lett. 40(4): 219-222 (1991) - [j2]Hubert Comon, Denis Lugiez, Philippe Schnoebelen:
A Rewrite-Based Type Discipline for a Subset of Computer Algebra. J. Symb. Comput. 11(4): 349-368 (1991) - 1988
- [j1]Philippe Schnoebelen:
Refined Compilation of Pattern-Matching for Functional Languages. Sci. Comput. Program. 11(2): 133-159 (1988)
Conference and Workshop Papers
- 2024
- [c74]M. Praveen, Philippe Schnoebelen, Julien Veron, Isa Vialard:
On the Piecewise Complexity of Words and Periodic Words. SOFSEM 2024: 456-470 - 2023
- [c73]Philippe Schnoebelen, Julien Veron:
On Arch Factorization and Subword Universality for Words and Compressed Words. WORDS 2023: 274-287 - 2021
- [c72]Philippe Schnoebelen:
On Flat Lossy Channel Machines. CSL 2021: 37:1-37:22 - 2017
- [c71]Simon Halfon, Philippe Schnoebelen, Georg Zetzsche:
Decidability, complexity, and expressiveness of first-order logic over the subword ordering. LICS 2017: 1-12 - [c70]Philippe Schnoebelen:
Ideal-Based Algorithms for the Symbolic Verification of Well-Structured Systems (Invited Talk). MFCS 2017: 85:1-85:4 - 2016
- [c69]Prateek Karandikar, Philippe Schnoebelen:
The Height of Piecewise-Testable Languages with Applications in Logical Complexity. CSL 2016: 37:1-37:22 - 2015
- [c68]Prateek Karandikar, Philippe Schnoebelen:
Decidability in the Logic of Subsequences and Supersequences. FSTTCS 2015: 84-97 - 2014
- [c67]Prateek Karandikar, Philippe Schnoebelen:
On the State Complexity of Closures and Interiors of Regular Languages with Subwords. DCFS 2014: 234-245 - [c66]Jérôme Leroux, Philippe Schnoebelen:
On Functions Weakly Computable by Petri Nets and Vector Addition Systems. RP 2014: 190-202 - 2013
- [c65]Sylvain Schmitz, Philippe Schnoebelen:
The Power of Well-Structured Systems. CONCUR 2013: 5-24 - [c64]Christoph Haase, Sylvain Schmitz, Philippe Schnoebelen:
The Power of Priority Channel Systems. CONCUR 2013: 319-333 - [c63]Nathalie Bertrand, Philippe Schnoebelen:
Solving Stochastic Büchi Games on Infinite Decisive Arenas. QAPL 2013: 116-131 - 2012
- [c62]Prateek Karandikar, Philippe Schnoebelen:
Cutting through Regular Post Embedding Problems. CSR 2012: 229-240 - [c61]Petr Jancar, Prateek Karandikar, Philippe Schnoebelen:
Unidirectional Channel Systems Can Be Tested. IFIP TCS 2012: 149-163 - [c60]Serge Haddad, Sylvain Schmitz, Philippe Schnoebelen:
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets. LICS 2012: 355-364 - 2011
- [c59]Sylvain Schmitz, Philippe Schnoebelen:
Multiply-Recursive Upper Bounds with Higman's Lemma. ICALP (2) 2011: 441-452 - [c58]Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen:
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma. LICS 2011: 269-278 - 2010
- [c57]Pierre Chambart, Philippe Schnoebelen:
Computing Blocker Sets for the Regular Post Embedding Problem. Developments in Language Theory 2010: 136-147 - [c56]Pierre Chambart, Philippe Schnoebelen:
Toward a Compositional Theory of Leftist Grammars and Transformations. FoSSaCS 2010: 237-251 - [c55]Pierre Chambart, Philippe Schnoebelen:
Pumping and Counting on the Regular Post Embedding Problem. ICALP (2) 2010: 64-75 - [c54]Philippe Schnoebelen:
Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets. MFCS 2010: 616-628 - [c53]Philippe Schnoebelen:
Lossy Counter Machines Decidability Cheat Sheet. RP 2010: 51-75 - 2008
- [c52]Pierre Chambart, Philippe Schnoebelen:
Mixing Lossy and Perfect Fifo Channels. CONCUR 2008: 340-355 - [c51]Pierre Chambart, Philippe Schnoebelen:
The omega-Regular Post Embedding Problem. FoSSaCS 2008: 97-111 - [c50]Pierre Chambart, Philippe Schnoebelen:
The Ordinal Recursive Complexity of Lossy Channel Systems. LICS 2008: 205-216 - [c49]Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, James Worrell:
On Termination for Faulty Channel Machines. STACS 2008: 121-132 - 2007
- [c48]Pierre Chambart, Philippe Schnoebelen:
Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems. FSTTCS 2007: 265-276 - [c47]Philippe Schnoebelen:
Model Checking Branching Time Logics. TIME 2007: 5 - 2006
- [c46]Christel Baier, Nathalie Bertrand, Philippe Schnoebelen:
Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness. FORTE 2006: 212-227 - [c45]Christel Baier, Nathalie Bertrand, Philippe Schnoebelen:
On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems. LPAR 2006: 347-361 - 2005
- [c44]Sébastien Bardin, Alain Finkel, Jérôme Leroux, Philippe Schnoebelen:
Flat Acceleration in Symbolic Model Checking. ATVA 2005: 474-488 - [c43]Nathalie Bertrand, Philippe Schnoebelen:
A Short Visit to the STS Hierarchy. EXPRESS 2005: 59-69 - 2004
- [c42]Antonín Kucera, Philippe Schnoebelen:
A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. CONCUR 2004: 371-386 - [c41]François Laroussinie, Nicolas Markey, Philippe Schnoebelen:
Model Checking Timed Automata with One or Two Clocks. CONCUR 2004: 387-401 - [c40]Nicolas Markey, Philippe Schnoebelen:
Symbolic Model Checking for Simply-Timed Systems. FORMATS/FTRTFT 2004: 102-117 - [c39]Nicolas Markey, Philippe Schnoebelen:
TSMV: A Symbolic Model Checker for Quantitative Analysis of Systems. QEST 2004: 330-331 - [c38]Philippe Schnoebelen:
The Verification of Probabilistic Lossy Channel Systems. Validation of Stochastic Systems 2004: 445-466 - 2003
- [c37]Nicolas Markey, Philippe Schnoebelen:
Model Checking a Path. CONCUR 2003: 248-262 - [c36]Nathalie Bertrand, Philippe Schnoebelen:
Model Checking Lossy Channels Systems Is Probably Decidable. FoSSaCS 2003: 120-135 - [c35]Philippe Schnoebelen:
Oracle Circuits for Branching-Time Model Checking. ICALP 2003: 790-801 - [c34]Philippe Schnoebelen:
Preface: Proceedings of INFINITY 2003, the 5th International Workshop on Verification of Infinite-State Systems, a satellite workshop of CONCUR 2003. INFINITY 2003: 1 - 2002
- [c33]Philippe Schnoebelen:
The Complexity of Temporal Logic Model Checking. Advances in Modal Logic 2002: 393-436 - [c32]Samuel Hornus, Philippe Schnoebelen:
On Solving Temporal Logic Queries. AMAST 2002: 163-177 - [c31]François Laroussinie, Nicolas Markey, Philippe Schnoebelen:
On Model Checking Durational Kripke Structures. FoSSaCS 2002: 264-279 - [c30]François Laroussinie, Nicolas Markey, Philippe Schnoebelen:
Temporal Logic with Forgettable Past. LICS 2002: 383-392 - [c29]Benoît Masson, Philippe Schnoebelen:
On Verifying Fair Lossy Channel Systems. MFCS 2002: 543-555 - [c28]Stéphane Demri, François Laroussinie, Philippe Schnoebelen:
A Parametric Analysis of the State Explosion Problem in Model Checking. STACS 2002: 620-631 - 2001
- [c27]François Laroussinie, Nicolas Markey, Philippe Schnoebelen:
Model Checking CTL+ and FCTL is Hard. FoSSaCS 2001: 318-331 - [c26]Philippe Schnoebelen:
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems. TACS 2001: 385-399 - [c25]Anne Labroue, Philippe Schnoebelen:
An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems. EXPRESS 2001: 1-20 - 2000
- [c24]Philippe Schnoebelen, Natalia Sidorova:
Bisimulation and the Reduction of Petri Nets. ICATPN 2000: 409-423 - [c23]Béatrice Bérard, Anne Labroue, Philippe Schnoebelen:
Verifying Performance Equivalence for Timed Basic Parallel Processes. FoSSaCS 2000: 35-47 - [c22]François Laroussinie, Philippe Schnoebelen:
The State Explosion Problem from Trace to Bisimulation Equivalence. FoSSaCS 2000: 192-207 - [c21]Denis Lugiez, Philippe Schnoebelen:
Decidable First-Order Transition Logics for PA-Processes. ICALP 2000: 342-353 - [c20]François Laroussinie, Philippe Schnoebelen, Mathieu Turuani:
On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics. LATIN 2000: 437-446 - [c19]Géraud Canet, Sandrine Couffin, Jean-Jacques Lesage, Antoine Petit, Philippe Schnoebelen:
Towards the automatic verification of PLC programs written in Instruction List. SMC 2000: 2449-2454 - 1999
- [c18]Irina A. Lomazova, Philippe Schnoebelen:
Some Decidability Results for Nested Petri Nets. Ershov Memorial Conference 1999: 208-220 - [c17]Catherine Dufourd, Petr Jancar, Philippe Schnoebelen:
Boundedness of Reset P/T Nets. ICALP 1999: 301-310 - 1998
- [c16]Denis Lugiez, Philippe Schnoebelen:
The Regular Viewpoint on PA-Processes. CONCUR 1998: 50-66 - [c15]Catherine Dufourd, Alain Finkel, Philippe Schnoebelen:
Reset Nets Between Decidability and Undecidability. ICALP 1998: 103-115 - [c14]Alain Finkel, Philippe Schnoebelen:
Fundamental Structures in Well-Structured Infinite Transition Systems. LATIN 1998: 102-118 - [c13]Stéphane Demri, Philippe Schnoebelen:
The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract). STACS 1998: 61-72 - 1997
- [c12]Olga Kouchnarenko, Philippe Schnoebelen:
A Formal Framework for the Analysis of Recursive-Parallel Programs. PaCT 1997: 45-59 - [c11]François Laroussinie, Philippe Schnoebelen:
Specification in CTL+Past, verification in CTL. EXPRESS 1997: 161-184 - 1996
- [c10]Olga Kouchnarenko, Philippe Schnoebelen:
A model for recursive-parallel programs. INFINITY 1996: 30 - 1994
- [c9]François Laroussinie, Philippe Schnoebelen:
A Hierarchy of Temporal Logics with Past (Extended Abstract). STACS 1994: 47-58 - 1993
- [c8]François Laroussinie, Sophie Pinchinat, Philippe Schnoebelen:
Translation Results for Modal Logics of Reactive Systems. AMAST 1993: 297-306 - 1992
- [c7]Cyril Autant, Philippe Schnoebelen:
Place Bisimulations in Petri Nets. Application and Theory of Petri Nets 1992: 45-61 - 1991
- [c6]Philippe Schnoebelen:
Experiments on Processes with Backtracking. CONCUR 1991: 480-494 - [c5]Cyril Autant, Z. Belmesk, Philippe Schnoebelen:
Strong Bisimilarity on Nets Revisited. PARLE (2) 1991: 295-312 - 1990
- [c4]Philippe Schnoebelen, Sophie Pinchinat:
On the Weak Adequacy of Branching-Time Remporal Logic. ESOP 1990: 377-388 - 1988
- [c3]Philippe Schnoebelen:
Refined Compilation of Pattern-Matching for Functional Languages. ALP 1988: 233-243 - 1987
- [c2]Peter Schäfer, Philippe Schnoebelen:
Specification of a Pipelined Event Driven Simulator using FP2. PARLE (1) 1987: 311-328 - [c1]Philippe Schnoebelen:
Rewriting Techniques for the Temporal Analysis of Communicating Processes. PARLE (2) 1987: 402-419
Editorship
- 2004
- [e1]Philippe Schnoebelen:
Proceedings of INFINITY 2003, the 5th International Workshop on Verification of Infinite-State Systems, a satellite workshop of CONCUR 2003, Marseille, France, September 2, 2003. Electronic Notes in Theoretical Computer Science 98, Elsevier 2004 [contents]
Informal and Other Publications
- 2023
- [i20]Philippe Schnoebelen, Julien Veron:
On arch factorization and subword universality for words and compressed words. CoRR abs/2304.11932 (2023) - [i19]M. Praveen, Philippe Schnoebelen, Isa Vialard, Julien Veron:
On the piecewise complexity of words and periodic words. CoRR abs/2311.15431 (2023) - [i18]Sergio Abriola, Simon Halfon, Aliaume Lopez, Sylvain Schmitz, Philippe Schnoebelen, Isa Vialard:
Measuring well quasi-ordered finitary powersets. CoRR abs/2312.14587 (2023) - 2020
- [i17]Philippe Schnoebelen:
On flat lossy channel machines. CoRR abs/2007.05269 (2020) - 2019
- [i16]Jérôme Leroux, M. Praveen, Philippe Schnoebelen, Grégoire Sutre:
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems. CoRR abs/1904.04090 (2019) - [i15]Jean Goubault-Larrecq, Simon Halfon, Prateek Karandikar, K. Narayan Kumar, Philippe Schnoebelen:
The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering. CoRR abs/1904.10703 (2019) - 2018
- [i14]Simon Halfon, Philippe Schnoebelen:
On shuffle products, acyclic automata and piecewise-testable languages. CoRR abs/1810.02953 (2018) - 2017
- [i13]Simon Halfon, Philippe Schnoebelen, Georg Zetzsche:
Decidability, Complexity, and Expressiveness of First-Order Logic Over the Subword Ordering. CoRR abs/1701.07470 (2017) - 2015
- [i12]Prateek Karandikar, Philippe Schnoebelen:
Decidability in the logic of subsequences and supersequences. CoRR abs/1510.03994 (2015) - [i11]Prateek Karandikar, Philippe Schnoebelen:
Hierarchy of piecewise-testable languages and complexity of the two-variable logic of subsequences. CoRR abs/1511.01807 (2015) - 2014
- [i10]Sylvain Schmitz, Philippe Schnoebelen:
The Power of Well-Structured Systems. CoRR abs/1402.2908 (2014) - [i9]Prateek Karandikar, Philippe Schnoebelen:
On the state complexity of closures and interiors of regular languages with subwords. CoRR abs/1406.0690 (2014) - 2013
- [i8]Prateek Karandikar, Philippe Schnoebelen:
On the index of Simon's congruence for piecewise testability. CoRR abs/1310.1278 (2013) - 2011
- [i7]Sylvain Schmitz, Philippe Schnoebelen:
Multiply-Recursive Upper Bounds with Higman's Lemma. CoRR abs/1103.4399 (2011) - [i6]Prateek Karandikar, Philippe Schnoebelen:
Cutting Through Regular Post Embedding Problems. CoRR abs/1109.1691 (2011) - 2010
- [i5]Pierre Chambart, Philippe Schnoebelen:
Toward a Compositional Theory of Leftist Grammars and Transformations. CoRR abs/1001.5047 (2010) - [i4]Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen:
Ackermann and Primitive-Recursive Bounds with Dickson's Lemma. CoRR abs/1007.2989 (2010) - 2008
- [i3]Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, James Worrell:
On Termination for Faulty Channel Machines. CoRR abs/0802.2839 (2008) - 2006
- [i2]Christel Baier, Nathalie Bertrand, Philippe Schnoebelen:
On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems. CoRR abs/cs/0606091 (2006) - 2005
- [i1]Christel Baier, Nathalie Bertrand, Philippe Schnoebelen:
Verifying nondeterministic probabilistic channel systems against $\omega$-regular linear-time properties. CoRR abs/cs/0511023 (2005)
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-04-24 23:14 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:
