Anna Bernasconi

981 total citations
90 papers, 535 citations indexed

About

Anna Bernasconi is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Artificial Intelligence. According to data from OpenAlex, Anna Bernasconi has authored 90 papers receiving a total of 535 indexed citations (citations by other indexed papers that have themselves been cited), including 58 papers in Computational Theory and Mathematics, 36 papers in Electrical and Electronic Engineering and 30 papers in Artificial Intelligence. Recurrent topics in Anna Bernasconi's work include Formal Methods in Verification (42 papers), VLSI and Analog Circuit Testing (20 papers) and Low-power high-performance VLSI design (19 papers). Anna Bernasconi is often cited by papers focused on Formal Methods in Verification (42 papers), VLSI and Analog Circuit Testing (20 papers) and Low-power high-performance VLSI design (19 papers). Anna Bernasconi collaborates with scholars based in Italy, Germany and Australia. Anna Bernasconi's co-authors include Valentina Ciriani, Tiziano Villa, Gabriella Trucco, Bruno Codenotti, Linda Pagli, Chris Godsil, Fabrizio Luccio, Simone Severini, Rolf Drechsler and L. Frontini and has published in prestigious journals such as Physical Review A, IEEE Access and IEEE Transactions on Computers.

In The Last Decade

Anna Bernasconi

82 papers receiving 499 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Anna Bernasconi Italy 12 257 237 214 127 73 90 535
Manabu Hagiwara Japan 9 60 0.2× 86 0.4× 150 0.7× 34 0.3× 50 0.7× 55 259
Christian Deppe Germany 9 65 0.3× 143 0.6× 153 0.7× 46 0.4× 62 0.8× 94 349
Lynn Chua United States 9 47 0.2× 115 0.5× 76 0.4× 60 0.5× 21 0.3× 21 408
Jean‐Jacques Pansiot France 14 216 0.8× 108 0.5× 251 1.2× 89 0.7× 49 0.7× 35 669
Wen‐Ai Jackson Australia 11 144 0.6× 136 0.6× 333 1.6× 6 0.0× 16 0.2× 43 422
Vladimir Sidorenko Germany 15 142 0.6× 403 1.7× 448 2.1× 40 0.3× 42 0.6× 75 589
Ahsan Raja Chowdhury Bangladesh 13 265 1.0× 197 0.8× 292 1.4× 56 0.4× 104 1.4× 35 523
Ming-Deh A. Huang United States 12 268 1.0× 33 0.1× 297 1.4× 14 0.1× 177 2.4× 41 603
M.U. Siddiqi Malaysia 11 92 0.4× 265 1.1× 334 1.6× 18 0.1× 44 0.6× 44 469
J. Hartmanis United States 12 367 1.4× 64 0.3× 240 1.1× 61 0.5× 50 0.7× 24 453

Countries citing papers authored by Anna Bernasconi

Since Specialization
Citations

This map shows the geographic impact of Anna Bernasconi's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Anna Bernasconi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Anna Bernasconi more than expected).

Fields of papers citing papers by Anna Bernasconi

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Anna Bernasconi. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Anna Bernasconi. The network helps show where Anna Bernasconi may publish in the future.

Co-authorship network of co-authors of Anna Bernasconi

This figure shows the co-authorship network connecting the top 25 collaborators of Anna Bernasconi. A scholar is included among the top collaborators of Anna Bernasconi based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Anna Bernasconi. Anna Bernasconi is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Potika, Katerina, et al.. (2025). Special issue on big data computing service and machine learning applications. Future Generation Computer Systems. 171. 107836–107836.
2.
Bernasconi, Anna, et al.. (2025). Outlier Detection and other applications of Quantum Matrix Multiplication. CINECA IRIS Institutial research information system (University of Pisa). 509–518.
3.
Maesa, Damiano Di Francesco, et al.. (2024). Comparing Ethereum fungible and non-fungible tokens: an analysis of transfer networks. Applied Network Science. 9(1). 2 indexed citations
4.
Bernasconi, Anna, et al.. (2024). Quantum subroutine for variance estimation: algorithmic design and applications. Quantum Machine Intelligence. 6(2). 2 indexed citations
5.
Bernasconi, Anna, et al.. (2024). The role of encodings and distance metrics for the quantum nearest neighbor. Quantum Machine Intelligence. 6(2). 1 indexed citations
6.
Bernasconi, Anna, et al.. (2024). Skip index: Supporting efficient inter-block queries and query authentication on the blockchain. Future Generation Computer Systems. 164. 107556–107556. 1 indexed citations
7.
Bernasconi, Anna, et al.. (2023). Quantum Feature Selection with Variance Estimation. CINECA IRIS Institutial research information system (University of Pisa). 245–250. 2 indexed citations
8.
Barbuti, Roberto, Anna Bernasconi, Roberta Gori, & Paolo Milazzo. (2020). Characterization and computation of ancestors in reaction systems. Soft Computing. 25(3). 1683–1698. 3 indexed citations
9.
Bernasconi, Anna, et al.. (2015). On the error resilience of ordered binary decision diagrams. Theoretical Computer Science. 595. 11–33. 4 indexed citations
10.
Bernasconi, Anna, Valentina Ciriani, Gabriella Trucco, & Tiziano Villa. (2013). Minimization of P-circuits using Boolean relations. Design, Automation, and Test in Europe. 996–1001. 2 indexed citations
11.
Bernasconi, Anna, Valentina Ciriani, Fabrizio Luccio, & Linda Pagli. (2010). Compact DSOP Forms Derived from SOP Expressions. UnipiEprints Open Archive (Università di Pisa). 1 indexed citations
12.
Bernasconi, Anna, Valentina Ciriani, Gabriella Trucco, & Tiziano Villa. (2009). On decomposing Boolean functions via extended cofactoring. Design, Automation, and Test in Europe. 1464–1469. 21 indexed citations
13.
Bernasconi, Anna, Chiara Bodei, & Linda Pagli. (2007). Knitting for Fun: A Recursive Sweater. Lecture notes in computer science. 53–65. 2 indexed citations
14.
Ciriani, Valentina, Nadia Pisanti, & Anna Bernasconi. (2004). Room allocation: a polynomial subcase of the quadratic assignment problem. Discrete Applied Mathematics. 144(3). 263–269. 10 indexed citations
15.
Pisanti, Nadia, et al.. (2001). Efficient optimal greedy algorithms for room allocation. CINECA IRIS Institutial research information system (University of Pisa). 43–60. 1 indexed citations
16.
Bernasconi, Anna, Carsten Damm, & Igor E. Shparlinski. (2001). Circuit and Decision Tree Complexity of Some Number Theoretic Problems. Information and Computation. 168(2). 113–124. 5 indexed citations
17.
Bernasconi, Anna. (2001). On a hierarchy of Boolean functions hard to compute in constant depth. Discrete Mathematics & Theoretical Computer Science. Vol. 4 no. 2. 2 indexed citations
18.
Bernasconi, Anna & Bruno Codenotti. (2000). On Boolean Functions associated to Bipartite Cayley Graphs. CINECA IRIS Institutial research information system (University of Pisa). 64(5-6). 167–174. 1 indexed citations
19.
Bernasconi, Anna, et al.. (1999). Hilbert Function and Complexity Lower Bounds for Symmetric Boolean Functions. Information and Computation. 153(1). 1–25. 4 indexed citations
20.
Bernasconi, Anna, et al.. (1996). On the Fourier Analysis of Boolean Functions.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026