default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Yves Marion
Person information
- affiliation: INRIA, France
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c63]Emmanuel Hainry
, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
Declassification Policy for Program Complexity Analysis. LICS 2024: 41:1-41:14- [i18]Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
Declassification Policy for Program Complexity Analysis. CoRR abs/2401.14957 (2024) - 2023
- [c62]Tristan Benoit, Jean-Yves Marion, Sébastien Bardin:
Scalable Program Clone Search through Spectral Analysis. ESEC/SIGSOFT FSE 2023: 808-820 - 2022
- [j26]Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
A tier-based typed programming language characterizing Feasible Functionals. Log. Methods Comput. Sci. 18(1) (2022) - [c61]Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
Complete and tractable machine-independent characterizations of second-order polytime. FoSSaCS 2022: 368-388 - [i17]Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
Complete and tractable machine-independent characterizations of second-order polytime. CoRR abs/2208.14739 (2022) - [i16]Tristan Benoit, Jean-Yves Marion, Sébastien Bardin:
Scalable Program Clone Search Through Spectral Analysis. CoRR abs/2210.13063 (2022) - 2021
- [c60]Binlin Cheng, Jiang Ming, Erika A. Leal, Haotian Zhang, Jianming Fu, Guojun Peng, Jean-Yves Marion:
Obfuscation-Resilient Executable Payload Extraction From Packed Malware. USENIX Security Symposium 2021: 3451-3468 - [c59]Tristan Benoit, Jean-Yves Marion, Sébastien Bardin:
Binary level toolchain provenance identification with graph neural networks. SANER 2021: 131-141 - [e6]Gabriela Nicolescu, Assia Tria, José M. Fernandez, Jean-Yves Marion, Joaquín García-Alfaro:
Foundations and Practice of Security - 13th International Symposium, FPS 2020, Montreal, QC, Canada, December 1-3, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12637, Springer 2021, ISBN 978-3-030-70880-1 [contents] - [i15]Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
A tier-based typed programming language characterizing Feasible Functionals. CoRR abs/2102.11605 (2021) - 2020
- [j25]Daniel Leivant, Jean-Yves Marion:
Primitive recursion in the abstract. Math. Struct. Comput. Sci. 30(1): 33-43 (2020) - [c58]Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
A tier-based typed programming language characterizing Feasible Functionals. LICS 2020: 535-549 - [p2]Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, Simon Perdrix, Sophie Tison:
Theoretical Computer Science: Computability, Decidability and Logic. A Guided Tour of Artificial Intelligence Research (3) (III) 2020: 1-50 - [p1]Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, Simon Perdrix, Sophie Tison:
Theoretical Computer Science: Computational Complexity. A Guided Tour of Artificial Intelligence Research (3) (III) 2020: 51-89
2010 – 2019
- 2019
- [c57]Mathilde Ollivier, Sébastien Bardin, Richard Bonichon, Jean-Yves Marion:
How to kill symbolic deobfuscation for free (or: unleashing the potential of path-oriented protections). ACSAC 2019: 177-189 - [i14]Mathilde Ollivier, Sébastien Bardin, Richard Bonichon, Jean-Yves Marion:
How to Kill Symbolic Deobfuscation for Free; or Unleashing the Potential of Path-Oriented Protections. CoRR abs/1908.01549 (2019) - 2018
- [c56]Binlin Cheng, Jiang Ming, Jianming Fu, Guojun Peng, Ting Chen, Xiaosong Zhang, Jean-Yves Marion:
Towards Paving the Way for Large-Scale Windows Malware Analysis: Generic Binary Unpacking with Orders-of-Magnitude Performance Boost. CCS 2018: 395-411 - [e5]Abdessamad Imine, José M. Fernandez, Jean-Yves Marion, Luigi Logrippo, Joaquín García-Alfaro:
Foundations and Practice of Security - 10th International Symposium, FPS 2017, Nancy, France, October 23-25, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10723, Springer 2018, ISBN 978-3-319-75649-3 [contents] - [i13]Daniel Leivant, Jean-Yves Marion:
Implicit complexity via structure transformation. CoRR abs/1802.03115 (2018) - 2017
- [c55]Guillaume Bonfante, Hubert Godfroy, Jean-Yves Marion:
A construction of a self-modifiying language with a formal correction proof. MALWARE 2017: 99-106 - [c54]Sébastien Bardin, Robin David, Jean-Yves Marion:
Backward-Bounded DSE: Targeting Infeasibility Questions on Obfuscated Codes. IEEE Symposium on Security and Privacy 2017: 633-651 - 2016
- [j24]Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem:
Two function algebras defining functions in NCk boolean circuits. Inf. Comput. 248: 82-103 (2016) - [c53]Robin David, Sébastien Bardin, Josselin Feist, Laurent Mounier, Marie-Laure Potet, Thanh Dinh Ta, Jean-Yves Marion:
Specification of concretization and symbolization policies in symbolic execution. ISSTA 2016: 36-46 - [c52]Robin David, Sébastien Bardin, Thanh Dinh Ta, Laurent Mounier, Josselin Feist, Marie-Laure Potet, Jean-Yves Marion:
BINSEC/SE: A Dynamic Symbolic Execution Toolkit for Binary-Level Analysis. SANER 2016: 653-656 - [i12]Robin David, Sébastien Bardin, Jean-Yves Marion:
Targeting Infeasibility Questions on Obfuscated Codes. CoRR abs/1612.05675 (2016) - [i11]Philippe Antoine, Guillaume Bonfante, Jean-Yves Marion:
Gorille: Efficient and Relevant Software Comparisons. ERCIM News 2016(106) (2016) - 2015
- [j23]Jean-Yves Marion:
Developments in implicit computational complexity. Inf. Comput. 241: 1-2 (2015) - [c51]Guillaume Bonfante, José M. Fernandez, Jean-Yves Marion, Benjamin Rouxel, Fabrice Sabatier, Aurélien Thierry:
CoDisasm: Medium Scale Concatic Disassembly of Self-Modifying Binaries with Overlapping Instructions. CCS 2015: 745-756 - [c50]Sébastien Bardin, Mickaël Delahaye, Robin David, Nikolai Kosmatov, Mike Papadakis, Yves Le Traon, Jean-Yves Marion:
Sound and Quasi-Complete Detection of Infeasible Test Requirements. ICST 2015: 1-10 - [c49]Guillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier:
Gorille sniffs code similarities, the case study of qwerty versus regin. MALWARE 2015: 82-89 - [i10]Jean-Yves Marion, Akira Mori, Mizuhito Ogawa:
Low level code analysis and applications to computer security (NII Shonan Meeting 2015-4). NII Shonan Meet. Rep. 2015 (2015) - 2014
- [c48]Guillaume Bonfante, Jean-Yves Marion, Thanh Dinh Ta:
Malware Message Classification by Dynamic Analysis. FPS 2014: 112-128 - [c47]Jean-Yves Marion, Romain Péchoux:
Complexity Information Flow in a Multi-threaded Imperative Language. TAMC 2014: 124-140 - [e4]Jean-Luc Danger, Mourad Debbabi, Jean-Yves Marion, Joaquín García-Alfaro, Nur Zincir-Heywood:
Foundations and Practice of Security - 6th International Symposium, FPS 2013, La Rochelle, France, October 21-22, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8352, Springer 2014, ISBN 978-3-319-05301-1 [contents] - [i9]Guillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier, Aurélien Thierry:
Analysis and Diversion of Duqu's Driver. CoRR abs/1401.6120 (2014) - 2013
- [c46]Emmanuel Hainry, Jean-Yves Marion, Romain Péchoux:
Type-Based Complexity Analysis for Fork Processes. FoSSaCS 2013: 305-320 - [c45]Daniel Leivant, Jean-Yves Marion:
Evolving Graph-Structures and Their Implicit Computational Complexity. ICALP (2) 2013: 349-360 - [c44]Guillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier, Aurélien Thierry:
Analysis and diversion of Duqu's driver. MALWARE 2013: 109-115 - [i8]Akitoshi Kawamura, Jean-Yves Marion, David Nowak:
Implicit Computational Complexity and Applications: Resource Control, Security, Real-Number Computation (NII Shonan Meeting 2013-13). NII Shonan Meet. Rep. 2013 (2013) - 2012
- [j22]Jean-Yves Marion, Thomas Schwentick:
Theoretical Aspects of Computer Science. Theory Comput. Syst. 51(2): 123-124 (2012) - [j21]Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca:
An Implicit Characterization of PSPACE. ACM Trans. Comput. Log. 13(2): 18:1-18:36 (2012) - [c43]Joan Calvet, José M. Fernandez, Jean-Yves Marion:
Aligot: cryptographic function identification in obfuscated binary programs. CCS 2012: 169-182 - [c42]Philippe Beaucamps, Isabelle Gnaedig, Jean-Yves Marion:
Abstraction-Based Malware Analysis Using Rewriting and Model Checking. ESORICS 2012: 806-823 - [c41]Guillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier, Aurélien Thierry:
Code synchronization by morphological analysis. MALWARE 2012: 112-119 - [i7]Jean-Yves Marion, Romain Péchoux:
Complexity Information Flow in a Multi-threaded Imperative Language. CoRR abs/1203.6878 (2012) - [i6]Jean-Yves Marion:
Viruses in Turing's Garden. ERCIM News 2012(91) (2012) - 2011
- [j20]Susanne Albers, Jean-Yves Marion:
Preface: Special Issue on Theoretical Aspects of Computer Science (STACS). Theory Comput. Syst. 48(3): 443 (2011) - [j19]Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen:
Quasi-interpretations a way to control resources. Theor. Comput. Sci. 412(25): 2776-2796 (2011) - [c40]Jean-Yves Marion:
A Type System for Complexity Flow Analysis. LICS 2011: 123-132 - [e3]Jean-Yves Marion:
Proceedings Second Workshop on Developments in Implicit Computational Complexity, Saarbrücken, DICE 2011, Germany, April 2nd and 3rd, 2011. EPTCS 75, 2011 [contents] - 2010
- [c39]Joan Calvet, Carlton R. Davis, José M. Fernandez, Jean-Yves Marion, Pier-Luc St-Onge, Wadie Guizani, Pierre-Marc Bureau, Anil Somayaji:
The case for in-the-lab botnet experimentation: creating and taking down a 3000-node botnet. ACSAC 2010: 141-150 - [c38]Philippe Beaucamps, Isabelle Gnaedig, Jean-Yves Marion:
Behavior Abstraction in Malware Analysis. RV 2010: 168-182 - [c37]Jean-Yves Marion, Thomas Schwentick:
Foreword -- 27th International Symposium on Theoretical Aspects of Computer Science. STACS 2010: 1-6 - [c36]Jean-Yves Marion, Thomas Schwentick:
Table of Contents - 27th International Symposium on Theoretical Aspects of Computer Science. STACS 2010: 7-10 - [c35]Joan Calvet, Carlton R. Davis, José M. Fernandez, Wadie Guizani, Matthieu Kaczmarek, Jean-Yves Marion, Pier-Luc St-Onge:
Isolated Virtualised Clusters: Testbeds for High-Risk Security Experimentation and Training. CSET 2010 - [e2]Jean-Yves Marion, Thomas Schwentick:
27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France. LIPIcs 5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2010, ISBN 978-3-939897-16-3 [contents] - [i5]Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca:
An Implicit Characterization of PSPACE. CoRR abs/1006.0030 (2010)
2000 – 2009
- 2009
- [j18]Jean-Yves Marion:
On tiered small jump operators. Log. Methods Comput. Sci. 5(1) (2009) - [j17]Patrick Baillot, Jean-Yves Marion, Simona Ronchi Della Rocca:
Guest editorial: Special issue on implicit computational complexity. ACM Trans. Comput. Log. 10(4): 23:1-23:2 (2009) - [j16]Jean-Yves Marion, Romain Péchoux:
Sup-interpretations, a semantic method for static analysis of program resources. ACM Trans. Comput. Log. 10(4): 27:1-27:31 (2009) - [j15]Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion:
Architecture of a morphological malware detector. J. Comput. Virol. 5(3): 263-270 (2009) - [c34]Wadie Guizani, Jean-Yves Marion, Daniel Reynaud-Plantey:
Server-side dynamic code analysis. MALWARE 2009: 55-62 - [c33]Guillaume Bonfante, Jean-Yves Marion, Daniel Reynaud-Plantey:
A Computability Perspective on Self-Modifying Programs. SEFM 2009: 231-239 - [c32]Susanne Albers, Jean-Yves Marion:
Preface - 26th International Symposium on Theoretical Aspects of Computer Science. STACS 2009 - [e1]Susanne Albers, Jean-Yves Marion:
26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings. LIPIcs 3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009, ISBN 978-3-939897-09-5 [contents] - 2008
- [j14]Jérôme Besombes, Jean-Yves Marion:
Learning discrete categorial grammars from structures. RAIRO Theor. Informatics Appl. 42(1): 165-182 (2008) - [c31]Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem:
Recursion Schemata for NCk. CSL 2008: 49-63 - [c30]Jean-Yves Marion, Romain Péchoux:
Analyzing the Implicit Computational Complexity of object-oriented programs. FSTTCS 2008: 316-327 - [c29]Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion:
Morphological detection of malware. MALWARE 2008: 1-8 - [c28]Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca:
A logical account of pspace. POPL 2008: 121-131 - [c27]Jean-Yves Marion, Romain Péchoux:
Characterizations of polynomial complexity classes with a better intensionality. PPDP 2008: 79-88 - [c26]Jean-Yves Marion, Romain Péchoux:
A Characterization of NCk. TAMC 2008: 136-147 - 2007
- [j13]Jérôme Besombes, Jean-Yves Marion:
Learning tree languages from positive examples and membership queries. Theor. Comput. Sci. 382(3): 183-197 (2007) - [j12]Guillaume Bonfante, Jean-Yves Marion:
Foreword. J. Comput. Virol. 3(1): 1-2 (2007) - [j11]Anne Bonfante, Jean-Yves Marion:
On the defence notion. J. Comput. Virol. 3(4): 247-251 (2007) - [c25]Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion:
A Classification of Viruses Through Recursion Theorems. CiE 2007: 73-82 - [c24]Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux:
Quasi-interpretation Synthesis by Decomposition. ICTAC 2007: 410-424 - [c23]Jean-Yves Marion:
Predicative Analysis of Feasibility and Diagonalization. TLCA 2007: 290-304 - [c22]Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca:
Soft Linear Logic and Polynomial Complexity Classes. LSFA 2007: 67-87 - [i4]Jean-Yves Marion, Romain Péchoux:
Resource control of object-oriented programs. CoRR abs/0706.2293 (2007) - [i3]Anne Bonfante, Jean-Yves Marion:
On the defence notion. CoRR abs/0711.0692 (2007) - 2006
- [j10]Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion:
Implicit complexity over an arbitrary structure: Quantifier alternations. Inf. Comput. 204(2): 210-230 (2006) - [j9]Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion:
On Abstract Computer Virology from a Recursion Theoretic Perspective. J. Comput. Virol. 1(3-4): 45-54 (2006) - [c21]Anne Bonfante, Jean-Yves Marion:
Computers under Attacks! PhiSE 2006 - [c20]Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem:
Towards an Implicit Characterization of NCk. CSL 2006: 212-224 - [c19]Jean-Yves Marion, Romain Péchoux:
Resource Analysis by Sup-interpretation. FLOPS 2006: 163-176 - [c18]Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux:
A Characterization of Alternating Log Time by First Order Functional Programs. LPAR 2006: 90-104 - [c17]Pascal Fontaine, Jean-Yves Marion, Stephan Merz, Leonor Prensa Nieto, Alwen Fernanto Tiu:
Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants. TACAS 2006: 167-181 - [i2]Jean-Yves Marion, Romain Péchoux:
Quasi-friendly sup-interpretations. CoRR abs/cs/0608020 (2006) - 2005
- [j8]Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion:
Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time. J. Log. Comput. 15(1): 41-58 (2005) - [c16]Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion:
Toward an Abstract Computer Virology. ICTAC 2005: 579-593 - [c15]Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen:
Quasi-interpretations and Small Space Bounds. RTA 2005: 150-164 - 2004
- [j7]Jean-Yves Marion:
Editorial: Implicit Computational Complexity. Theor. Comput. Sci. 318(1-2): 1 (2004) - [c14]Jérôme Besombes, Jean-Yves Marion:
Learning Tree Languages from Positive Examples and Membership Queries. ALT 2004: 440-453 - [c13]Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion:
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures. IFIP TCS 2004: 409-422 - [c12]Jérôme Besombes, Jean-Yves Marion:
Learning reversible categorial grammars from structures. Intelligent Information Systems 2004: 181-190 - 2003
- [j6]Jean-Yves Marion:
Analysing the implicit complexity of programs. Inf. Comput. 183(1): 2-18 (2003) - [c11]Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion:
Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time. FoSSaCS 2003: 185-199 - [c10]Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion:
Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH. ICC@LICS 2003: 3-14 - 2002
- [j5]Serge Grigorieff, Jean-Yves Marion:
Kolmogorov complexity and non-determinism. Theor. Comput. Sci. 271(1-2): 151-180 (2002) - [c9]Jérôme Besombes, Jean-Yves Marion:
Learning languages from positive examples with dependencies. TAG+ 2002: 25-29 - 2001
- [j4]Guillaume Bonfante, Adam Cichon, Jean-Yves Marion, Hélène Touzet:
Algorithms with polynomial interpretation termination proof. J. Funct. Program. 11(1): 33-53 (2001) - [c8]Jean-Yves Marion:
Actual Arithmetic and Feasibility. CSL 2001: 115-129 - [c7]Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen:
On Lexicographic Termination Ordering with Space Bound Certifications. Ershov Memorial Conference 2001: 482-493 - 2000
- [j3]Daniel Leivant, Jean-Yves Marion:
A characterization of alternating log time by ramified recurrence. Theor. Comput. Sci. 236(1-2): 193-208 (2000) - [c6]Jean-Yves Marion, Jean-Yves Moyen:
Efficient First Order Functional Program Interpreter with Time Bound Certifications. LPAR 2000: 25-42 - [i1]E. A. Cichon, Jean-Yves Marion:
The Light Lexicographic path Ordering. CoRR cs.PL/0010008 (2000)
1990 – 1999
- 1999
- [j2]Jean-Yves Marion:
From Multiple Sequent for Additive Linear Logic to Decision Procedures for Free Lattices. Theor. Comput. Sci. 224(1-2): 157-172 (1999) - 1998
- [c5]Guillaume Bonfante, Adam Cichon, Jean-Yves Marion, Hélène Touzet:
Complexity Classes and Rewrite Systems with Polynomial Interpretation. CSL 1998: 372-384 - 1997
- [c4]Jean-Yves Marion:
Case Study: Additive Linear Logic and Lattices. LFCS 1997: 237-247 - [c3]Daniel Leivant, Jean-Yves Marion:
Predicative Functional Recurrence and Poly-space. TAPSOFT 1997: 369-380 - 1994
- [c2]Daniel Leivant, Jean-Yves Marion:
Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space. CSL 1994: 486-500 - 1993
- [j1]Daniel Leivant, Jean-Yves Marion:
Lambda Calculus Characterizations of Poly-Time. Fundam. Informaticae 19(1/2): 167-184 (1993) - [c1]Daniel Leivant, Jean-Yves Marion:
Lambda calculus characterizations of poly-time. TLCA 1993: 274-288
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 2025-01-13 01:00 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:
