default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnna Bernasconi 0001
Person information
- affiliation: Università di Pisa, Italy
Other persons with the same name
- Anna Bernasconi 0002
![[0000-0001-8016-5750]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-8016-5750")
— Politecnico di Milano, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j42]Anna Bernasconi, Alessandro Berti, Gianna Maria Del Corso, Alessandro Poggiali:
Quantum Subroutine for Efficient Matrix Multiplication. IEEE Access 12: 116274-116284 (2024)- [j41]Alessandro Berti, Anna Bernasconi, Gianna M. Del Corso, Riccardo Guidotti:
The role of encodings and distance metrics for the quantum nearest neighbor. Quantum Mach. Intell. 6(2): 62 (2024) - [j40]Alessandro Poggiali, Alessandro Berti, Anna Bernasconi, Gianna M. Del Corso, Riccardo Guidotti:
Quantum clustering with k-Means: A hybrid approach. Theor. Comput. Sci. 992: 114466 (2024) - [c57]Tarlis Tortelli Portela, Vanessa Lago Machado, Jônata Tyska Carvalho, Vania Bogorny, Anna Bernasconi, Chiara Renso:
UltraMovelets: Efficient Movelet Extraction for Multiple Aspect Trajectory Classification. DEXA (2) 2024: 79-94 - 2023
- [j39]Matteo Loporchio, Anna Bernasconi, Damiano Di Francesco Maesa, Laura Ricci:
Is Bitcoin gathering dust? An analysis of low-amount Bitcoin transactions. Appl. Netw. Sci. 8(1): 34 (2023) - [j38]Matteo Loporchio, Anna Bernasconi, Damiano Di Francesco Maesa, Laura Ricci:
A survey of set accumulators for blockchain systems. Comput. Sci. Rev. 49: 100570 (2023) - [j37]Anna Bernasconi, Alessandro Berti, Valentina Ciriani, Gianna M. Del Corso, Innocenzo Fulginiti:
XOR-AND-XOR Logic Forms for Autosymmetric Functions and Applications to Quantum Computing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 42(6): 1861-1872 (2023) - [c56]Matteo Loporchio, Damiano Di Francesco Maesa, Anna Bernasconi, Laura Ricci:
Analysis and Characterization of ERC-20 Token Network Topologies. COMPLEX NETWORKS (3) 2023: 344-355 - [c55]Anna Bernasconi, Valentina Ciriani, Asma Taheri Monfared, Stefano Zanoni:
Compact Quantum Circuits for Dimension Reducible Functions. DSD 2023: 776-781 - [c54]Alessandro Poggiali, Anna Bernasconi, Alessandro Berti, Gianna M. Del Corso, Riccardo Guidotti:
Quantum Feature Selection with Variance Estimation. ESANN 2023 - 2022
- [j36]Anna Bernasconi, Valentina Ciriani, Tiziano Villa:
Exploiting Symmetrization and D-Reducibility for Approximate Logic Synthesis. IEEE Trans. Computers 71(1): 121-133 (2022) - [j35]Anna Bernasconi, Stelvio Cimato, Valentina Ciriani, Maria Chiara Molteni:
Multiplicative Complexity of XOR Based Regular Functions. IEEE Trans. Computers 71(11): 2927-2939 (2022) - [c53]Matteo Loporchio, Anna Bernasconi, Damiano Di Francesco Maesa, Laura Ricci:
An Analysis of Bitcoin Dust Through Authenticated Queries. COMPLEX NETWORKS (2) 2022: 495-508 - [c52]Anna Bernasconi, Valentina Ciriani, Marco Longhi:
On the Optimal OBDD Representation of 2-XOR Boolean Affine Spaces. DATE 2022: 1437-1442 - [c51]Alessandro Poggiali, Alessandro Berti, Anna Bernasconi, Gianna Maria Del Corso, Riccardo Guidotti:
Clustering Classical Data with Quantum k-Means. ICTCS 2022: 188-200 - [c50]Tarlis Tortelli Portela, Vania Bogorny, Anna Bernasconi, Chiara Renso:
AUTOMATISE: Multiple Aspect Trajectory Data Mining Tool Library. MDM 2022: 282-285 - [c49]Alessandro Berti, Anna Bernasconi, Gianna M. Del Corso, Riccardo Guidotti:
Effect of Different Encodings and Distance Functions on Quantum Instance-Based Classifiers. PAKDD (2) 2022: 96-108 - [i5]Alessandro Poggiali, Alessandro Berti, Anna Bernasconi, Gianna M. Del Corso, Riccardo Guidotti:
Quantum Clustering with k-Means: a Hybrid Approach. CoRR abs/2212.06691 (2022) - 2021
- [j34]Matteo Loporchio, Anna Bernasconi, Damiano Di Francesco Maesa, Laura Ricci:
Authenticating Spatial Queries on Blockchain Systems. IEEE Access 9: 163363-163378 (2021) - [j33]Roberto Barbuti, Anna Bernasconi, Roberta Gori, Paolo Milazzo:
Characterization and computation of ancestors in reaction systems. Soft Comput. 25(3): 1683-1698 (2021) - [c48]Anna Bernasconi, Valentina Ciriani:
Autosymmetry of Incompletely Specified Functions. DATE 2021: 360-365 - [c47]Padmanabhan Balasubramanian, Anna Bernasconi, Valentina Ciriani, Tiziano Villa:
A Boolean Heuristic for Disjoint SOP Synthesis. DSD 2021: 62-68 - 2020
- [j32]Lorena Anghel, Anna Bernasconi, Valentina Ciriani, Luca Frontini, Gabriella Trucco, Elena I. Vatajelu:
Stuck-At Fault Mitigation of Emerging Technologies Based Switching Lattices. J. Electron. Test. 36(3): 313-326 (2020) - [c46]Anna Bernasconi, Stelvio Cimato, Valentina Ciriani, Maria Chiara Molteni:
Multiplicative Complexity of Autosymmetric Functions: Theory and Applications to Security. DAC 2020: 1-6 - [c45]Anna Bernasconi, Valentina Ciriani, Jordi Cortadella, Tiziano Villa:
Computing the full quotient in bi-decomposition by approximation. DATE 2020: 580-585
2010 – 2019
- 2019
- [j31]Anna Bernasconi, Valentina Ciriani, Gabriella Trucco, Tiziano Villa:
Boolean Minimization of Projected Sums of Products via Boolean Relations. IEEE Trans. Computers 68(9): 1269-1282 (2019) - [c44]Anna Bernasconi, Valentina Ciriani, Tiziano Villa:
Approximate Logic Synthesis by Symmetrization. DATE 2019: 1655-1660 - [c43]Anna Bernasconi, Valentina Ciriani, Luca Frontini:
Testability of Switching Lattices in the Cellular Fault Model. DSD 2019: 320-327 - [c42]Lorena Anghel, Anna Bernasconi, Valentina Ciriani, Luca Frontini, Gabriella Trucco, Elena I. Vatajelu:
Fault Mitigation of Switching Lattices under the Stuck-At-Fault Model. LATS 2019: 1-6 - 2018
- [j30]Anna Bernasconi, Valentina Ciriani, Luca Frontini, Valentino Liberali, Gabriella Trucco, Tiziano Villa:
Enhancing logic synthesis of switching lattices by generalized Shannon decomposition methods. Microprocess. Microsystems 56: 193-203 (2018) - [j29]Anna Bernasconi, Valentina Ciriani, Luca Frontini, Gabriella Trucco:
Composition of switching lattices for regular and for decomposed functions. Microprocess. Microsystems 60: 207-218 (2018) - [c41]Roberto Barbuti, Anna Bernasconi, Roberta Gori, Paolo Milazzo:
Computing Preimages and Ancestors in Reaction Systems. TPNC 2018: 23-35 - [c40]Anna Bernasconi, Antonio Boffa, Fabrizio Luccio, Linda Pagli:
The Connection Layout in a Lattice of Four-Terminal Switches. VLSI-SoC (Selected Papers) 2018: 32-52 - [c39]Anna Bernasconi, Antonio Boffa, Fabrizio Luccio, Linda Pagli:
Two Combinatorial Problems on the Layout of Switching Lattices. VLSI-SoC 2018: 137-142 - [c38]Anna Bernasconi, Valentina Ciriani, Luca Frontini:
Testability of Switching Lattices in the Stuck at Fault Model. VLSI-SoC 2018: 213-218 - 2017
- [j28]Dan Alexandrescu, Mustafa Altun, Lorena Anghel, Anna Bernasconi, Valentina Ciriani, Luca Frontini, Mehdi Baradaran Tahoori:
Logic synthesis and testing techniques for switching nano-crossbar arrays. Microprocess. Microsystems 54: 14-25 (2017) - [c37]Anna Bernasconi, Valentina Ciriani, Luca Frontini, Gabriella Trucco:
Composition of Switching Lattices and Autosymmetric Boolean Function Synthesis. DSD 2017: 137-144 - 2016
- [j27]Anna Bernasconi, Valentina Ciriani:
Index-Resilient Zero-Suppressed BDDs: Definition and Operations. ACM Trans. Design Autom. Electr. Syst. 21(4): 72:1-72:27 (2016) - [c36]Dan Alexandrescu, Mustafa Altun, Lorena Anghel, Anna Bernasconi, Valentina Ciriani, Luca Frontini, Mehdi Baradaran Tahoori:
Synthesis and Performance Optimization of a Switching Nano-Crossbar Computer. DSD 2016: 334-341 - [c35]Anna Bernasconi, Valentina Ciriani, Luca Frontini, Valentino Liberali, Gabriella Trucco, Tiziano Villa:
Logic Synthesis for Switching Lattices by Decomposition with P-Circuits. DSD 2016: 423-430 - [c34]Anna Bernasconi, Valentina Ciriani, Luca Frontini, Gabriella Trucco:
Synthesis on switching lattices of Dimension-reducible Boolean functions. VLSI-SoC 2016: 1-6 - 2015
- [j26]Anna Bernasconi, Valentina Ciriani, Gabriella Trucco, Tiziano Villa:
Using Flexibility in P-Circuits by Boolean Relations. IEEE Trans. Computers 64(12): 3605-3618 (2015) - [j25]Anna Bernasconi, Valentina Ciriani, Lorenzo Lago:
On the error resilience of ordered binary decision diagrams. Theor. Comput. Sci. 595: 11-33 (2015) - [c33]Anna Bernasconi, Robert K. Brayton, Valentina Ciriani, Gabriella Trucco, Tiziano Villa:
Bi-Decomposition Using Boolean Relations. DSD 2015: 72-78 - [c32]Anna Bernasconi, Valentina Ciriani, Gabriella Trucco:
Biconditional-BDD Ordering for Autosymmetric Functions. DSD 2015: 211-217 - 2014
- [j24]Anna Bernasconi, Valentina Ciriani:
Autosymmetric and Dimension Reducible Multiple-Valued Functions. J. Multiple Valued Log. Soft Comput. 23(3-4): 265-292 (2014) - [c31]Anna Bernasconi, Valentina Ciriani:
2-SPP Approximate Synthesis for Error Tolerant Applications. DSD 2014: 411-418 - [c30]Anna Bernasconi, Valentina Ciriani:
Zero-Suppressed Binary Decision Diagrams Resilient to Index Faults. IFIP TCS 2014: 1-12 - [i4]Anna Bernasconi, Valentina Ciriani, Lorenzo Lago:
On the Error Resilience of Ordered Binary Decision Diagrams. CoRR abs/1404.3919 (2014) - 2013
- [j23]Anna Bernasconi, Valentina Ciriani, Gabriella Trucco, Tiziano Villa:
SOP restructuring by exploiting don't cares. Microprocess. Microsystems 37(8-A): 836-847 (2013) - [j22]Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli:
Compact DSOP and Partial DSOP Forms. Theory Comput. Syst. 53(4): 583-608 (2013) - [c29]Anna Bernasconi, Valentina Ciriani, Gabriella Trucco, Tiziano Villa:
Minimization of P-circuits using Boolean relations. DATE 2013: 996-1001 - [c28]Anna Bernasconi, Valentina Ciriani, Lorenzo Lago:
Error resilient OBDDs. DDECS 2013: 246-249 - [c27]Anna Bernasconi, Valentina Ciriani, Gabriella Trucco, Tiziano Villa:
Minimization of EP-SOPs via Boolean relations. VLSI-SoC 2013: 112-117 - 2012
- [j21]Anna Bernasconi, Valentina Ciriani, Valentino Liberali, Gabriella Trucco, Tiziano Villa:
Synthesis of P-circuits for logic restructuring. Integr. 45(3): 282-293 (2012) - [c26]Anna Bernasconi, Valentina Ciriani, Gabriella Trucco, Tiziano Villa:
Projected Don't Cares. DSD 2012: 57-64 - [i3]Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli:
Compact DSOP and partial DSOP Forms. CoRR abs/1204.5306 (2012) - 2011
- [j20]Anna Bernasconi, Valentina Ciriani:
Dimension-reducible Boolean functions based on affine spaces. ACM Trans. Design Autom. Electr. Syst. 16(2): 13:1-13:21 (2011) - [c25]Anna Bernasconi, Valentina Ciriani:
Compact and Testable Circuits for Regular Functions. ARCS Workshops 2011 - [c24]Anna Bernasconi, Valentina Ciriani, Valentino Liberali, Gabriella Trucco, Tiziano Villa:
An approximation algorithm for cofactoring-based synthesis. ACM Great Lakes Symposium on VLSI 2011: 193-198 - [c23]Anna Bernasconi, Valentina Ciriani:
Autosymmetric Multiple-Valued Functions: Theory and Spectral Characterization. ISMVL 2011: 10-15 - 2010
- [c22]Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli:
Fun at a Department Store: Data Mining Meets Switching Theory. FUN 2010: 41-52 - [c21]Anna Bernasconi, Valentina Ciriani:
Logic synthesis and testability of D-reducible functions. VLSI-SoC 2010: 280-285
2000 – 2009
- 2009
- [c20]Anna Bernasconi, Valentina Ciriani, Gabriella Trucco, Tiziano Villa:
On decomposing Boolean functions via extended cofactoring. DATE 2009: 1464-1469 - [c19]Anna Bernasconi, Valentina Ciriani, Gabriella Trucco, Tiziano Villa:
Logic Minimization and Testability of 2SPP-P-Circuits. DSD 2009: 773-780 - 2008
- [j19]Görschwin Fey, Anna Bernasconi, Valentina Ciriani, Rolf Drechsler:
On the construction of small fully testable circuits with low depth. Microprocess. Microsystems 32(5-6): 263-269 (2008) - [j18]Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli:
Synthesis of Autosymmetric Functions in a New Three-Level Form. Theory Comput. Syst. 42(4): 450-464 (2008) - [j17]Anna Bernasconi, Valentina Ciriani, Rolf Drechsler, Tiziano Villa:
Logic Minimization and Testability of 2-SPP Networks. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(7): 1190-1202 (2008) - [j16]Anna Bernasconi, Valentina Ciriani, Roberto Cordone:
The optimization of kEP-SOPs: Computational complexity, approximability and experiments. ACM Trans. Design Autom. Electr. Syst. 13(2): 35:1-35:31 (2008) - [c18]Anna Bernasconi, Valentina Ciriani, Roberto Cordone:
On Projecting Sums of Products. DSD 2008: 787-794 - 2007
- [c17]Görschwin Fey, Anna Bernasconi, Valentina Ciriani, Rolf Drechsler:
On the Construction of Small Fully Testable Circuits with Low Depth. DSD 2007: 563-569 - [c16]Anna Bernasconi, Chiara Bodei, Linda Pagli:
Knitting for Fun: A Recursive Sweater. FUN 2007: 53-65 - [c15]Anna Bernasconi, Valentina Ciriani, Roberto Cordone:
An approximation algorithm for fully testable kEP-SOP networks. ACM Great Lakes Symposium on VLSI 2007: 417-422 - 2006
- [j15]Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli:
Exploiting Regularities for Boolean Function Synthesis. Theory Comput. Syst. 39(4): 485-501 (2006) - [j14]Valentina Ciriani, Anna Bernasconi, Rolf Drechsler:
Testability of SPP Three-Level Logic Networks in Static Fault Models. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25(10): 2241-2248 (2006) - [c14]Anna Bernasconi, Valentina Ciriani, Rolf Drechsler, Tiziano Villa:
Efficient minimization of fully testable 2-SPP networks. DATE 2006: 1300-1305 - [c13]Anna Bernasconi, Valentina Ciriani:
DRedSOP: Synthesis of a New Class of Regular Functions. DSD 2006: 377-384 - [c12]Anna Bernasconi, Valentina Ciriani, Roberto Cordone:
Logic Synthesis of EXOR Projected Sum of Products. VLSI-SoC (Selected Papers) 2006: 241-257 - [c11]Anna Bernasconi, Valentina Ciriani, Roberto Cordone:
EXOR Projected Sum of Products. VLSI-SoC 2006: 284-289 - 2004
- [j13]Valentina Ciriani, Nadia Pisanti, Anna Bernasconi:
Room allocation: a polynomial subcase of the quadratic assignment problem. Discret. Appl. Math. 144(3): 263-269 (2004) - [j12]Anna Bernasconi, Bruno Codenotti:
Spectral Analysis of Symmetric Threshold Functions. J. Multiple Valued Log. Soft Comput. 10(2): 159-171 (2004) - 2003
- [j11]Eric Allender, Anna Bernasconi, Carsten Damm, Joachim von zur Gathen, Michael E. Saks, Igor E. Shparlinski:
Complexity of some arithmetic problems for binary polynomials. Comput. Complex. 12(1-2): 23-47 (2003) - [j10]Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli:
Three-level logic minimization based on function regularities. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 22(8): 1005-1016 (2003) - [c10]Valentina Ciriani, Anna Bernasconi, Rolf Drechsler:
Stuck-At-Fault Testability of SPP Three-Level Logic Forms. VLSI-SoC (Selected Papers) 2003: 299-313 - [c9]Valentina Ciriani, Anna Bernasconi, Rolf Drechsler:
Testability of SPP Three-Level Logic Networks. VLSI-SOC 2003: 331-336 - 2002
- [c8]Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli:
Fast three-level logic minimization based on autosymmetry. DAC 2002: 425-430 - [c7]Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli:
Implicit Test of Regularity for Not Completely Specified Boolean Functions. IWLS 2002: 345-350 - 2001
- [j9]Anna Bernasconi:
On a hierarchy of Boolean functions hard to compute in constant depth. Discret. Math. Theor. Comput. Sci. 4(2): 79-90 (2001) - [j8]Anna Bernasconi, Carsten Damm, Igor E. Shparlinski:
Circuit and Decision Tree Complexity of Some Number Theoretic Problems. Inf. Comput. 168(2): 113-124 (2001) - [j7]Anna Bernasconi, Bruno Codenotti, Jeffrey M. Vanderkam:
A Characterization of Bent Functions in Terms of Strongly Regular Graphs. IEEE Trans. Computers 50(9): 984-985 (2001) - 2000
- [j6]Anna Bernasconi, Carsten Damm, Igor E. Shparlinski:
The average sensitivity of square-freeness. Comput. Complex. 9(1): 39-51 (2000)
1990 – 1999
- 1999
- [j5]Anna Bernasconi, Lavinia Egidi:
Hilbert Function and Complexity Lower Bounds for Symmetric Boolean Functions. Inf. Comput. 153(1): 1-25 (1999) - [j4]Richard Beigel, Anna Bernasconi:
A Note on the Polynomial Representation of Boolean Functions over GF(2). Int. J. Found. Comput. Sci. 10(4): 535- (1999) - [j3]Anna Bernasconi:
On the Complexity of Balanced Boolean Functions. Inf. Process. Lett. 70(4): 157-163 (1999) - [j2]Anna Bernasconi, Bruno Codenotti:
Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem. IEEE Trans. Computers 48(3): 345-351 (1999) - [c6]Anna Bernasconi, Carsten Damm, Igor E. Shparlinski:
On the Average Sensitivity of Testing Square-Free Numbers. COCOON 1999: 291-299 - [c5]Anna Bernasconi, Igor E. Shparlinski:
Circuit Complexity of Testing Square-Free Numbers. STACS 1999: 47-56 - 1998
- [c4]Anna Bernasconi:
Combinatorial Properties of Classes of Functions Hard to Compute in Constant Depth. COCOON 1998: 339-348 - [i2]Anna Bernasconi, Igor E. Shparlinski:
Circuit Complexity of Testing Square-Free Numbers. Electron. Colloquium Comput. Complex. TR98 (1998) - [i1]Anna Bernasconi, Carsten Damm, Igor E. Shparlinski:
Circuit and Decision Tree Complexity of Some Number Theoretic Problems. Universität Trier, Mathematik/Informatik, Forschungsbericht 98-21 (1998) - 1997
- [c3]Anna Bernasconi:
On the Complexity of Balanced Boolean Functions. CIAC 1997: 253-263 - [c2]Anna Bernasconi, Bruno Codenotti, Valentino Crespi, Giovanni Resta:
Computing Groebner Bases in the Boolean Setting with Applications to Counting. WAE 1997: 209-218 - 1996
- [j1]Anna Bernasconi:
Sensitivity vs. Block Sensitivity (an Average-Case Study). Inf. Process. Lett. 59(3): 151-157 (1996) - 1994
- [c1]Anna Bernasconi, Bruno Codenotti:
Measures of Boolean Function Complexity Based on Harmonic Analysis. CIAC 1994: 63-72
Coauthor Index
[j37] [c55] [j36] [j35] [c52] [c48] [c47] [j32] [c46] [c45] [j31] [c44] [c43] [c42] [j30] [j29] [c38] [j28] [c37] [j27] [c36] [c35] [c34] [j26] [j25] [c33] [c32] [j24] [c31] [c30] [i4] [j23] [j22] [c29] [c28] [c27] [j21] [c26] [i3] [j20] [c25] [c24] [c23] [c22] [c21] [c20] [c19] [j19] [j18] [j17] [j16] [c18] [c17] [c15] [j15] [j14] [c14] [c13] [c12] [c11] [j13] [j10] [c10] [c9] [c8] [c7]
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-10-07 22:06 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:
