Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCamil Demetrescu
Person information
- affiliation (PhD 2001): Sapienza University of Rome, Department of Computer and Systems Science, Italy
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]Camil Demetrescu:
Fully Dynamic Algorithms for Path Problems on Directed Graphs. Sapienza University of Rome, Italy, 2001
Journal Articles
- 2022
- [j34]Camil Demetrescu, Irene Finocchi, Andrea Ribichini
, Marco Schaerf:
Which Conference Is That? A Case Study in Computer Science. ACM J. Data Inf. Qual. 14(3): 18:1-18:13 (2022) - [j33]Camil Demetrescu, Irene Finocchi, Andrea Ribichini, Marco Schaerf:
On computer science research and its temporal evolution. Scientometrics 127(8): 4913-4938 (2022) - [j32]Luca Borzacchiello, Emilio Coppa, Camil Demetrescu:
SENinja: A symbolic execution plugin for Binary Ninja. SoftwareX 20: 101219 (2022) - 2021
- [j31]Luca Borzacchiello, Emilio Coppa, Camil Demetrescu:
FUZZOLIC: Mixing fuzzing and concolic execution. Comput. Secur. 108: 102368 (2021) - 2020
- [j30]Camil Demetrescu, Irene Finocchi, Andrea Ribichini, Marco Schaerf:
On bibliometrics in academic promotions: a case study in computer science and engineering in Italy. Scientometrics 124(3): 2207-2228 (2020) - [j29]Camil Demetrescu, Andrea Ribichini, Marco Schaerf:
Are Italian research assessment exercises size-biased? Scientometrics 125(1): 533-549 (2020) - 2019
- [j28]Camil Demetrescu, Francesco Lupia, Angelo Mendicelli, Andrea Ribichini, Francesco Scarcello, Marco Schaerf:
On the Shapley value and its application to the Italian VQR research assessment exercise. J. Informetrics 13(1): 87-104 (2019) - [j27]Luca Borzacchiello, Emilio Coppa, Daniele Cono D'Elia, Camil Demetrescu:
Memory models in symbolic execution: key ideas and new thoughts. Softw. Test. Verification Reliab. 29(8) (2019) - 2018
- [j26]Roberto Baldoni, Emilio Coppa, Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi:
A Survey of Symbolic Execution Techniques. ACM Comput. Surv. 51(3): 50:1-50:39 (2018) - [j25]Camil Demetrescu, Andrea Ribichini, Marco Schaerf:
Accuracy of author names in bibliographic data sources: an Italian case study. Scientometrics 117(3): 1777-1791 (2018) - 2016
- [j24]Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi:
Mining hot calling contexts in small space. Softw. Pract. Exp. 46(8): 1131-1152 (2016) - 2015
- [j23]Camil Demetrescu, Matthew Flatt:
Front Matter, Table of Contents. Dagstuhl Artifacts Ser. 1(1): 00:-1-00:-6 (2015) - 2014
- [j22]Camil Demetrescu, Irene Finocchi, Andrea Ribichini:
Reactive Imperative Programming with Dataflow Constraints. ACM Trans. Program. Lang. Syst. 37(1): 3:1-3:53 (2014) - [j21]Emilio Coppa, Camil Demetrescu, Irene Finocchi:
Input-Sensitive Profiling. IEEE Trans. Software Eng. 40(12): 1185-1205 (2014) - 2013
- [j20]Camil Demetrescu, Magnús M. Halldórsson:
Editorial. Algorithmica 67(4): 449-450 (2013) - [j19]Camil Demetrescu, Stefano Leonardi, Alberto Marchetti-Spaccamela:
Preface. Theor. Comput. Sci. 514: 1 (2013) - 2010
- [j18]Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini:
Adapting parallel algorithms to the W-Stream model, with applications to graph problems. Theor. Comput. Sci. 411(44-46): 3994-4004 (2010) - 2009
- [j17]Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini:
Graph Spanners in the Streaming Model: An Experimental Study. Algorithmica 55(2): 346-374 (2009) - [j16]Camil Demetrescu:
Preface. ACM J. Exp. Algorithmics 14 (2009) - [j15]Camil Demetrescu, Irene Finocchi, Andrea Ribichini:
Trading off space for passes in graph streaming problems. ACM Trans. Algorithms 6(1): 6:1-6:17 (2009) - 2008
- [j14]Camil Demetrescu, Giuseppe F. Italiano:
Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure. Algorithmica 51(4): 387-427 (2008) - [j13]Camil Demetrescu, Roberto Tamassia:
Papers from ALENEX 2005. ACM J. Exp. Algorithmics 12: 3.1:1 (2008) - [j12]Camil Demetrescu, Mikkel Thorup, Rezaul Alam Chowdhury, Vijaya Ramachandran:
Oracles for Distances Avoiding a Failed Node or Link. SIAM J. Comput. 37(5): 1299-1318 (2008) - 2006
- [j11]Camil Demetrescu, Giuseppe F. Italiano:
Fully dynamic all pairs shortest paths with real edge weights. J. Comput. Syst. Sci. 72(5): 813-837 (2006) - [j10]Camil Demetrescu, Giuseppe F. Italiano:
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures. J. Discrete Algorithms 4(3): 353-383 (2006) - [j9]Camil Demetrescu, Giuseppe F. Italiano:
Experimental analysis of dynamic all pairs shortest path algorithms. ACM Trans. Algorithms 2(4): 578-601 (2006) - 2005
- [j8]Camil Demetrescu, Giuseppe F. Italiano:
Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O(n2 barrier. J. ACM 52(2): 147-156 (2005) - 2004
- [j7]Camil Demetrescu, Giuseppe F. Italiano:
A new approach to dynamic all pairs shortest paths. J. ACM 51(6): 968-992 (2004) - [j6]Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Luigi Laura:
A Java-based system for building animated presentations over the Web. Sci. Comput. Program. 53(1): 37-49 (2004) - 2003
- [j5]Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano:
Algorithm engineering, Algorithmics Column. Bull. EATCS 79: 48-63 (2003) - [j4]Camil Demetrescu, Irene Finocchi:
Combinatorial algorithms for feedback problems in directed graphs. Inf. Process. Lett. 86(3): 129-136 (2003) - 2001
- [j3]Camil Demetrescu, Irene Finocchi:
Removing Cycles for Minimizing Crossings. ACM J. Exp. Algorithmics 6: 2 (2001) - [j2]Camil Demetrescu, Irene Finocchi:
Smooth Animation of Algorithms in a Declarative Framework. J. Vis. Lang. Comput. 12(3): 253-281 (2001) - 2000
- [j1]Pierluigi Crescenzi, Camil Demetrescu, Irene Finocchi, Rossella Petreschi:
Reversible Execution and Visualization of Programs with LEONARDO. J. Vis. Lang. Comput. 11(2): 125-150 (2000)
Conference and Workshop Papers
- 2022
- [c45]Luca Borzacchiello, Emilio Coppa, Davide Maiorca, Andrea Columbu, Camil Demetrescu, Giorgio Giacinto:
Reach Me if You Can: On Native Vulnerability Reachability in Android Apps. ESORICS (3) 2022: 701-722 - [c44]Luca Borzacchiello, Emilio Coppa, Camil Demetrescu:
Handling Memory-Intensive Operations in Symbolic Execution. ISEC 2022: 25:1-25:5 - [c43]Emilio Coppa, Heng Yin, Camil Demetrescu:
SymFusion: Hybrid Instrumentation for Concolic Execution. ASE 2022: 100:1-100:12 - 2021
- [c42]Luca Borzacchiello, Emilio Coppa, Camil Demetrescu:
Fuzzing Symbolic Expressions. ICSE 2021: 711-722 - 2019
- [c41]Luca Borzacchiello, Emilio Coppa, Daniele Cono D'Elia, Camil Demetrescu:
Reconstructing C2 Servers for Remote Access Trojans with Symbolic Execution. CSCML 2019: 121-140 - [c40]Daniele Cono D'Elia, Emilio Coppa, Andrea Salvati, Camil Demetrescu:
Static Analysis of ROP Code. EuroSec@EuroSys 2019: 2:1-2:6 - [c39]Pietro Borrello, Emilio Coppa, Daniele Cono D'Elia, Camil Demetrescu:
The ROP needle: hiding trigger-based injection vectors via code reuse. SAC 2019: 1962-1970 - [c38]Marco Angelini, Graziano Blasilli, Luca Borzacchiello, Emilio Coppa, Daniele Cono D'Elia, Camil Demetrescu, Simone Lenti, Simone Nicchi, Giuseppe Santucci:
SymNav: Visually Assisting Symbolic Execution. VizSEC 2019: 1-11 - 2018
- [c37]Daniele Cono D'Elia, Camil Demetrescu:
On-stack replacement, distilled. PLDI 2018: 166-180 - 2017
- [c36]Tiziana Catarci, Monica Scannapieco, Marco Console, Camil Demetrescu:
My (fair) big data. IEEE BigData 2017: 2974-2979 - [c35]Roberto Baldoni, Emilio Coppa, Daniele Cono D'Elia, Camil Demetrescu:
Assisting Malware Analysis with Symbolic Execution: A Case Study. CSCML 2017: 171-188 - [c34]Emilio Coppa, Daniele Cono D'Elia, Camil Demetrescu:
Rethinking pointer reasoning in symbolic execution. ASE 2017: 613-618 - 2016
- [c33]Daniele Cono D'Elia, Camil Demetrescu:
Flexible on-stack replacement in LLVM. CGO 2016: 250-260 - 2014
- [c32]Emilio Coppa, Camil Demetrescu, Irene Finocchi, Romolo Marotta:
Estimating the Empirical Cost Function of Routines with Dynamic Workloads. CGO 2014: 230 - 2013
- [c31]Daniele Cono D'Elia, Camil Demetrescu:
Ball-Larus path profiling across multiple loop iterations. OOPSLA 2013: 373-390 - 2012
- [c30]Giorgio Ausiello, Camil Demetrescu, Irene Finocchi, Donatella Firmani:
k-Calling context profiling. OOPSLA 2012: 867-878 - [c29]Emilio Coppa, Camil Demetrescu, Irene Finocchi:
Input-sensitive profiling. PLDI 2012: 89-98 - 2011
- [c28]Camil Demetrescu, Irene Finocchi, Andrea Ribichini:
Reactive imperative programming with dataflow constraints. OOPSLA 2011: 407-426 - [c27]Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi:
Mining hot calling contexts in small space. PLDI 2011: 516-527 - 2007
- [c26]Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini:
Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments. ESA 2007: 605-617 - [c25]Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini:
Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems. MFCS 2007: 194-205 - 2006
- [c24]Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Luigi Laura:
Visual editing of animated algorithms: the Leonardo Web builder. AVI 2006: 476-479 - [c23]Camil Demetrescu, Pompeo Faruolo, Giuseppe F. Italiano, Mikkel Thorup:
Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? ESA 2006: 732-743 - [c22]Camil Demetrescu, Irene Finocchi, Andrea Ribichini:
Trading off space for passes in graph streaming problems. SODA 2006: 714-723 - [c21]Camil Demetrescu, Irene Finocchi:
A data-driven graphical toolkit for software visualization. SOFTVIS 2006: 57-66 - [c20]Camil Demetrescu, Giuseppe F. Italiano:
Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks. WCAN@ICALP 2006: 3-15 - 2005
- [c19]Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Luigi Laura:
Portraying Algorithms with Leonardo Web. WISE Workshops 2005: 73-83 - 2004
- [c18]Camil Demetrescu, Irene Finocchi:
A portable virtual machine for program debugging and directing. SAC 2004: 1524-1530 - [c17]Camil Demetrescu, Stefano Emiliozzi, Giuseppe F. Italiano:
Experimental analysis of dynamic all pairs shortest path algorithms. SODA 2004: 369-378 - [c16]Camil Demetrescu, Giuseppe F. Italiano:
Engineering Shortest Path Algorithms. WEA 2004: 191-198 - 2003
- [c15]Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano:
Engineering and Visualizing Algorithms. GD 2003: 509-513 - [c14]Camil Demetrescu, Giuseppe F. Italiano:
A new approach to dynamic all pairs shortest paths. STOC 2003: 159-166 - 2002
- [c13]Camil Demetrescu, Giuseppe F. Italiano:
Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths. ICALP 2002: 633-643 - [c12]Camil Demetrescu, Mikkel Thorup:
Oracles for distances avoiding a link-failure. SODA 2002: 838-843 - 2001
- [c11]Camil Demetrescu, Irene Finocchi, John T. Stasko:
Specifying Algorithm Visualizations: Interesting Events or State Mapping? Software Visualization 2001: 16-30 - [c10]Camil Demetrescu, Giuseppe F. Italiano:
Fully Dynamic All Pairs Shortest Paths with Real Edge Weights. FOCS 2001: 260-267 - 2000
- [c9]Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Stefan Näher:
Visualization in Algorithm Engineering: Tools and Techniques. Experimental Algorithmics 2000: 24-50 - [c8]Camil Demetrescu, Giuseppe F. Italiano:
Fully Dynamic Transitive Closure: Breaking Through the O(n2) Barrier. FOCS 2000: 381-389 - [c7]Camil Demetrescu, Giuseppe F. Italiano:
What Do We Learn from Experimental Algorithmics? MFCS 2000: 36-51 - [c6]Camil Demetrescu, Irene Finocchi, Giuseppe Liotta:
Visualizing Algorithms over the Web with the Publication-Driven Approach. WAE 2000: 147-158 - [c5]Camil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni:
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study. WAE 2000: 218-229 - 1999
- [c4]Camil Demetrescu, Giuseppe Di Battista, Irene Finocchi, Giuseppe Liotta, Maurizio Patrignani, Maurizio Pizzonia:
Infinite Trees and the Future. GD 1999: 379-391 - [c3]Camil Demetrescu, Irene Finocchi:
A Technique for Generating Graphical Abstractions of Program Data Structures. VISUAL 1999: 785-792 - [c2]Camil Demetrescu, Irene Finocchi:
Smooth Animation of Algorithms in a Declarative Framework. VL 1999: 280-287 - 1997
- [c1]Pierluigi Crescenzi, Camil Demetrescu, Irene Finocchi, Rossella Petreschi:
LEONARDO: a software visualization system. WAE 1997: 146-155
Parts in Books or Collections
- 2013
- [p2]Camil Demetrescu, Giuseppe F. Italiano:
The Quest for the Shortest Route. The Power of Algorithms 2013: 85-105 - 2003
- [p1]Harold N. Gabow, Camil Demetrescu, Irene Finocchi, Giuseppe Francesco Italiano, Giuseppe Liotta, Roberto Tamassia, Richard B. Borie, R. Gary Parker, Craig A. Tovey:
Graphs in Computer Science. Handbook of Graph Theory 2003: 952-1073
Editorship
- 2022
- [e6]Camil Demetrescu, Alessandro Mei:
Proceedings of the Italian Conference on Cybersecurity (ITASEC 2022), Rome, Italy, June 20-23, 2022. CEUR Workshop Proceedings 3260, CEUR-WS.org 2022 [contents] - 2013
- [e5]Vincenzo Bonifaci, Camil Demetrescu, Alberto Marchetti-Spaccamela:
Experimental Algorithms, 12th International Symposium, SEA 2013, Rome, Italy, June 5-7, 2013. Proceedings. Lecture Notes in Computer Science 7933, Springer 2013, ISBN 978-3-642-38526-1 [contents] - 2011
- [e4]Camil Demetrescu, Magnús M. Halldórsson:
Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings. Lecture Notes in Computer Science 6942, Springer 2011, ISBN 978-3-642-23718-8 [contents] - 2009
- [e3]Camil Demetrescu, Andrew V. Goldberg, David S. Johnson:
The Shortest Path Problem, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, November 13-14, 2006. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74, DIMACS/AMS 2009, ISBN 978-0-8218-4383-3 [contents] - 2007
- [e2]Camil Demetrescu:
Experimental Algorithms, 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings. Lecture Notes in Computer Science 4525, Springer 2007, ISBN 978-3-540-72844-3 [contents] - 2005
- [e1]Camil Demetrescu, Robert Sedgewick, Roberto Tamassia:
Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, ALENEX /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005. SIAM 2005, ISBN 0-89871-596-2 [contents]
Reference Works
- 2016
- [r12]Camil Demetrescu, Giuseppe F. Italiano:
Decremental All-Pairs Shortest Paths. Encyclopedia of Algorithms 2016: 506-509 - [r11]Camil Demetrescu, Andrew V. Goldberg, David S. Johnson:
Implementation Challenge for Shortest Paths. Encyclopedia of Algorithms 2016: 947-951 - [r10]Camil Demetrescu, Giuseppe F. Italiano:
Single-Source Fully Dynamic Reachability. Encyclopedia of Algorithms 2016: 1994-1996 - [r9]Camil Demetrescu, Giuseppe F. Italiano:
Trade-Offs for Dynamic Graph Problems. Encyclopedia of Algorithms 2016: 2242-2246 - [r8]Camil Demetrescu, Giuseppe F. Italiano:
Visualization Techniques for Algorithm Engineering. Encyclopedia of Algorithms 2016: 2333-2337 - 2008
- [r7]Camil Demetrescu, Andrew V. Goldberg, David S. Johnson:
Implementation Challenge for Shortest Paths. Encyclopedia of Algorithms 2008 - [r6]Camil Demetrescu, Giuseppe F. Italiano:
Decremental All-Pairs Shortest Paths. Encyclopedia of Algorithms 2008 - [r5]Camil Demetrescu, Giuseppe F. Italiano:
Single-Source Fully Dynamic Reachability. Encyclopedia of Algorithms 2008 - [r4]Camil Demetrescu, Giuseppe F. Italiano:
Trade-Offs for Dynamic Graph Problems. Encyclopedia of Algorithms 2008 - [r3]Camil Demetrescu, Giuseppe F. Italiano:
Visualization Techniques for Algorithm Engineering. Encyclopedia of Algorithms 2008 - 2004
- [r2]Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano:
Dynamic Trees. Handbook of Data Structures and Applications 2004 - [r1]Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano:
Dynamic Graphs. Handbook of Data Structures and Applications 2004
Informal and Other Publications
- 2021
- [i11]Luca Borzacchiello, Emilio Coppa, Camil Demetrescu:
Fuzzing Symbolic Expressions. CoRR abs/2102.06580 (2021) - 2017
- [i10]Daniele Cono D'Elia, Camil Demetrescu:
On-Stack Replacement à la Carte. CoRR abs/1708.02512 (2017) - 2016
- [i9]Roberto Baldoni, Emilio Coppa, Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi:
A Survey of Symbolic Execution Techniques. CoRR abs/1610.00502 (2016) - [i8]Daniel Delling, Camil Demetrescu, David S. Johnson, Jan Vitek:
Rethinking Experimental Methods in Computing (Dagstuhl Seminar 16111). Dagstuhl Reports 6(3): 24-43 (2016) - [i7]Camil Demetrescu, Sebastian Erdweg, Matthew A. Hammer, Shriram Krishnamurthi:
Programming Language Techniques for Incremental and Reactive Computing (Dagstuhl Seminar 16402). Dagstuhl Reports 6(10): 1-12 (2016) - 2014
- [i6]Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Luigi Laura:
Experimental Evaluation of Algorithms for the Food-Selection Problem. CoRR abs/1401.7591 (2014) - 2013
- [i5]Emilio Coppa, Camil Demetrescu, Irene Finocchi, Romolo Marotta:
Multithreaded Input-Sensitive Profiling. CoRR abs/1304.3804 (2013) - [i4]Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi:
Ball-Larus Path Profiling Across Multiple Loop iterations. CoRR abs/1304.5197 (2013) - 2011
- [i3]Camil Demetrescu, Irene Finocchi, Andrea Ribichini:
Reactive Imperative Programming with Dataflow Constraints. CoRR abs/1104.2293 (2011) - [i2]Camil Demetrescu, Michael Kaufmann, Stephen G. Kobourov, Petra Mutzel:
Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar 11191). Dagstuhl Reports 1(5): 47-60 (2011) - 2001
- [i1]Camil Demetrescu, Giuseppe F. Italiano:
Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure. CoRR cs.DS/0104001 (2001)
Coauthor Index
a service of 
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-25 01:38 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:
