Anna Bernasconi

ORCID

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 43

Top Venues

DSD

IEEE Trans. Computers

DATE

Microprocess. Microsystems

Publications

Alessandro Poggiali, Alessandro Berti, Anna Bernasconi, Gianna M. Del Corso, Riccardo Guidotti
Quantum clustering with k-Means: A hybrid approach. Theor. Comput. Sci. 992 (2024)
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)
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) (2023)
Alessandro Poggiali, Anna Bernasconi, Alessandro Berti, Gianna M. Del Corso, Riccardo Guidotti
Quantum Feature Selection with Variance Estimation. ESANN (2023)
Matteo Loporchio, Damiano Di Francesco Maesa, Anna Bernasconi, Laura Ricci
Analysis and Characterization of ERC-20 Token Network Topologies. COMPLEX NETWORKS (3) (2023)
Matteo Loporchio, Anna Bernasconi, Damiano Di Francesco Maesa, Laura Ricci
A survey of set accumulators for blockchain systems. Comput. Sci. Rev. 49 (2023)
Anna Bernasconi, Valentina Ciriani, Asma Taheri Monfared, Stefano Zanoni
Compact Quantum Circuits for Dimension Reducible Functions. DSD (2023)
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) (2023)
Matteo Loporchio, Anna Bernasconi, Damiano Di Francesco Maesa, Laura Ricci
An Analysis of Bitcoin Dust Through Authenticated Queries. COMPLEX NETWORKS (2) (2022)
Alessandro Poggiali, Alessandro Berti, Anna Bernasconi, Gianna M. Del Corso, Riccardo Guidotti
Quantum Clustering with k-Means: a Hybrid Approach. CoRR (2022)
Anna Bernasconi, Valentina Ciriani, Marco Longhi
On the Optimal OBDD Representation of 2-XOR Boolean Affine Spaces. DATE (2022)
Alessandro Poggiali, Alessandro Berti, Anna Bernasconi, Gianna Maria Del Corso, Riccardo Guidotti
Clustering Classical Data with Quantum k-Means. ICTCS (2022)
Anna Bernasconi, Valentina Ciriani, Tiziano Villa
Exploiting Symmetrization and D-Reducibility for Approximate Logic Synthesis. IEEE Trans. Computers 71 (1) (2022)
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)
Tarlis Tortelli Portela, Vania Bogorny, Anna Bernasconi, Chiara Renso
AUTOMATISE: Multiple Aspect Trajectory Data Mining Tool Library. MDM (2022)
Anna Bernasconi, Stelvio Cimato, Valentina Ciriani, Maria Chiara Molteni
Multiplicative Complexity of XOR Based Regular Functions. IEEE Trans. Computers 71 (11) (2022)
Anna Bernasconi, Valentina Ciriani
Autosymmetry of Incompletely Specified Functions. DATE (2021)
Matteo Loporchio, Anna Bernasconi, Damiano Di Francesco Maesa, Laura Ricci
Authenticating Spatial Queries on Blockchain Systems. IEEE Access 9 (2021)
Roberto Barbuti, Anna Bernasconi, Roberta Gori, Paolo Milazzo
Characterization and computation of ancestors in reaction systems. Soft Comput. 25 (3) (2021)
Padmanabhan Balasubramanian, Anna Bernasconi, Valentina Ciriani, Tiziano Villa
A Boolean Heuristic for Disjoint SOP Synthesis. DSD (2021)
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) (2020)
Anna Bernasconi, Valentina Ciriani, Jordi Cortadella, Tiziano Villa
Computing the full quotient in bi-decomposition by approximation. DATE (2020)
Anna Bernasconi, Stelvio Cimato, Valentina Ciriani, Maria Chiara Molteni
Multiplicative Complexity of Autosymmetric Functions: Theory and Applications to Security. DAC (2020)
Anna Bernasconi, Valentina Ciriani, Luca Frontini
Testability of Switching Lattices in the Cellular Fault Model. DSD (2019)
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)
Anna Bernasconi, Valentina Ciriani, Gabriella Trucco, Tiziano Villa
Boolean Minimization of Projected Sums of Products via Boolean Relations. IEEE Trans. Computers 68 (9) (2019)
Anna Bernasconi, Valentina Ciriani, Tiziano Villa
Approximate Logic Synthesis by Symmetrization. DATE (2019)
Roberto Barbuti, Anna Bernasconi, Roberta Gori, Paolo Milazzo
Computing Preimages and Ancestors in Reaction Systems. TPNC (2018)
Anna Bernasconi, Antonio Boffa, Fabrizio Luccio, Linda Pagli
Two Combinatorial Problems on the Layout of Switching Lattices. VLSI-SoC (2018)
Anna Bernasconi, Valentina Ciriani, Luca Frontini, Gabriella Trucco
Composition of switching lattices for regular and for decomposed functions. Microprocess. Microsystems 60 (2018)
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 (2018)
Anna Bernasconi, Antonio Boffa, Fabrizio Luccio, Linda Pagli
The Connection Layout in a Lattice of Four-Terminal Switches. VLSI-SoC (Selected Papers) (2018)
Anna Bernasconi, Valentina Ciriani, Luca Frontini
Testability of Switching Lattices in the Stuck at Fault Model. VLSI-SoC (2018)
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 (2017)
Anna Bernasconi, Valentina Ciriani, Luca Frontini, Gabriella Trucco
Composition of Switching Lattices and Autosymmetric Boolean Function Synthesis. DSD (2017)
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)
Anna Bernasconi, Valentina Ciriani, Luca Frontini, Valentino Liberali, Gabriella Trucco, Tiziano Villa
Logic Synthesis for Switching Lattices by Decomposition with P-Circuits. DSD (2016)
Anna Bernasconi, Valentina Ciriani
Index-Resilient Zero-Suppressed BDDs: Definition and Operations. ACM Trans. Design Autom. Electr. Syst. 21 (4) (2016)
Anna Bernasconi, Valentina Ciriani, Luca Frontini, Gabriella Trucco
Synthesis on switching lattices of Dimension-reducible Boolean functions. VLSI-SoC (2016)
Anna Bernasconi, Robert K. Brayton, Valentina Ciriani, Gabriella Trucco, Tiziano Villa
Bi-Decomposition Using Boolean Relations. DSD (2015)
Anna Bernasconi, Valentina Ciriani, Gabriella Trucco
Biconditional-BDD Ordering for Autosymmetric Functions. DSD (2015)
Anna Bernasconi, Valentina Ciriani, Gabriella Trucco, Tiziano Villa
Using Flexibility in P-Circuits by Boolean Relations. IEEE Trans. Computers 64 (12) (2015)
Anna Bernasconi, Valentina Ciriani, Lorenzo Lago
On the error resilience of ordered binary decision diagrams. Theor. Comput. Sci. 595 (2015)
Anna Bernasconi, Valentina Ciriani
Zero-Suppressed Binary Decision Diagrams Resilient to Index Faults. IFIP TCS (2014)
Anna Bernasconi, Valentina Ciriani
2-SPP Approximate Synthesis for Error Tolerant Applications. DSD (2014)
Anna Bernasconi, Valentina Ciriani, Lorenzo Lago
On the Error Resilience of Ordered Binary Decision Diagrams. CoRR (2014)
Anna Bernasconi, Valentina Ciriani
Autosymmetric and Dimension Reducible Multiple-Valued Functions. J. Multiple Valued Log. Soft Comput. 23 (3-4) (2014)
Anna Bernasconi, Valentina Ciriani, Gabriella Trucco, Tiziano Villa
Minimization of EP-SOPs via Boolean relations. VLSI-SoC (2013)
Anna Bernasconi, Valentina Ciriani, Gabriella Trucco, Tiziano Villa
Minimization of P-circuits using Boolean relations. DATE (2013)
Anna Bernasconi, Valentina Ciriani, Gabriella Trucco, Tiziano Villa
SOP restructuring by exploiting don't cares. Microprocess. Microsystems 37 (8-A) (2013)
Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli
Compact DSOP and Partial DSOP Forms. Theory Comput. Syst. 53 (4) (2013)
Anna Bernasconi, Valentina Ciriani, Lorenzo Lago
Error resilient OBDDs. DDECS (2013)
Anna Bernasconi, Valentina Ciriani, Gabriella Trucco, Tiziano Villa
Projected Don't Cares. DSD (2012)
Anna Bernasconi, Valentina Ciriani, Valentino Liberali, Gabriella Trucco, Tiziano Villa
Synthesis of P-circuits for logic restructuring. Integr. 45 (3) (2012)
Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli
Compact DSOP and partial DSOP Forms CoRR (2012)
Anna Bernasconi, Valentina Ciriani
Dimension-reducible Boolean functions based on affine spaces. ACM Trans. Design Autom. Electr. Syst. 16 (2) (2011)
Anna Bernasconi, Valentina Ciriani
Compact and Testable Circuits for Regular Functions. ARCS Workshops (2011)
Anna Bernasconi, Valentina Ciriani, Valentino Liberali, Gabriella Trucco, Tiziano Villa
An approximation algorithm for cofactoring-based synthesis. ACM Great Lakes Symposium on VLSI (2011)
Anna Bernasconi, Valentina Ciriani
Autosymmetric Multiple-Valued Functions: Theory and Spectral Characterization. ISMVL (2011)
Anna Bernasconi, Valentina Ciriani
Logic synthesis and testability of D-reducible functions. VLSI-SoC (2010)
Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli
Fun at a Department Store: Data Mining Meets Switching Theory. FUN (2010)
Anna Bernasconi, Valentina Ciriani, Gabriella Trucco, Tiziano Villa
On decomposing Boolean functions via extended cofactoring. DATE (2009)
Anna Bernasconi, Valentina Ciriani, Gabriella Trucco, Tiziano Villa
Logic Minimization and Testability of 2SPP-P-Circuits. DSD (2009)
Anna Bernasconi, Valentina Ciriani, Roberto Cordone
On Projecting Sums of Products. DSD (2008)
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) (2008)
Anna Bernasconi, Valentina Ciriani, Roberto Cordone
The optimization of kEP-SOPs: Computational complexity, approximability and experiments. ACM Trans. Design Autom. Electr. Syst. 13 (2) (2008)
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) (2008)
Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli
Synthesis of Autosymmetric Functions in a New Three-Level Form. Theory Comput. Syst. 42 (4) (2008)
Anna Bernasconi, Chiara Bodei, Linda Pagli
Knitting for Fun: A Recursive Sweater. FUN (2007)
Anna Bernasconi, Valentina Ciriani, Roberto Cordone
An approximation algorithm for fully testable kEP-SOP networks. ACM Great Lakes Symposium on VLSI (2007)
Görschwin Fey, Anna Bernasconi, Valentina Ciriani, Rolf Drechsler
On the Construction of Small Fully Testable Circuits with Low Depth. DSD (2007)
Anna Bernasconi, Valentina Ciriani, Roberto Cordone
Logic Synthesis of EXOR Projected Sum of Products. VLSI-SoC (Selected Papers) (2006)
Anna Bernasconi, Valentina Ciriani, Rolf Drechsler, Tiziano Villa
Efficient minimization of fully testable 2-SPP networks. DATE (2006)
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) (2006)
Anna Bernasconi, Valentina Ciriani, Roberto Cordone
EXOR Projected Sum of Products. VLSI-SoC (2006)
Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli
Exploiting Regularities for Boolean Function Synthesis. Theory Comput. Syst. 39 (4) (2006)
Anna Bernasconi, Valentina Ciriani
DRedSOP: Synthesis of a New Class of Regular Functions. DSD (2006)
Valentina Ciriani, Nadia Pisanti, Anna Bernasconi
Room allocation: a polynomial subcase of the quadratic assignment problem. Discret. Appl. Math. 144 (3) (2004)
Anna Bernasconi, Bruno Codenotti
Spectral Analysis of Symmetric Threshold Functions. J. Multiple Valued Log. Soft Comput. 10 (2) (2004)
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) (2003)
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) (2003)
Valentina Ciriani, Anna Bernasconi, Rolf Drechsler
Testability of SPP Three-Level Logic Networks. VLSI-SOC (2003)
Valentina Ciriani, Anna Bernasconi, Rolf Drechsler
Stuck-At-Fault Testability of SPP Three-Level Logic Forms. VLSI-SoC (Selected Papers) (2003)
Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli
Fast three-level logic minimization based on autosymmetry. DAC (2002)
Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli
Implicit Test of Regularity for Not Completely Specified Boolean Functions. IWLS (2002)
Anna Bernasconi, Carsten Damm, Igor E. Shparlinski
Circuit and Decision Tree Complexity of Some Number Theoretic Problems. Inf. Comput. 168 (2) (2001)
Anna Bernasconi
On a hierarchy of Boolean functions hard to compute in constant depth. Discret. Math. Theor. Comput. Sci. 4 (2) (2001)
Anna Bernasconi, Bruno Codenotti, Jeffrey M. Vanderkam
A Characterization of Bent Functions in Terms of Strongly Regular Graphs. IEEE Trans. Computers 50 (9) (2001)
Anna Bernasconi, Carsten Damm, Igor E. Shparlinski
The average sensitivity of square-freeness. Comput. Complex. 9 (1) (2000)
Anna Bernasconi
On the Complexity of Balanced Boolean Functions. Inf. Process. Lett. 70 (4) (1999)
Anna Bernasconi, Carsten Damm, Igor E. Shparlinski
On the Average Sensitivity of Testing Square-Free Numbers. COCOON (1999)
Anna Bernasconi, Igor E. Shparlinski
Circuit Complexity of Testing Square-Free Numbers. STACS (1999)
Anna Bernasconi, Bruno Codenotti
Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem. IEEE Trans. Computers 48 (3) (1999)
Richard Beigel, Anna Bernasconi
A Note on the Polynomial Representation of Boolean Functions over GF(2). Int. J. Found. Comput. Sci. 10 (4) (1999)
Anna Bernasconi, Lavinia Egidi
Hilbert Function and Complexity Lower Bounds for Symmetric Boolean Functions. Inf. Comput. 153 (1) (1999)
Anna Bernasconi
Combinatorial Properties of Classes of Functions Hard to Compute in Constant Depth. COCOON (1998)
Anna Bernasconi, Carsten Damm, Igor E. Shparlinski
Circuit and Decision Tree Complexity of Some Number Theoretic Problems Universität Trier, Mathematik/Informatik, Forschungsbericht (1998)
Anna Bernasconi, Igor E. Shparlinski
Circuit Complexity of Testing Square-Free Numbers Electron. Colloquium Comput. Complex. 5 (56) (1998)
Anna Bernasconi
On the Complexity of Balanced Boolean Functions. CIAC (1997)
Anna Bernasconi, Bruno Codenotti, Valentino Crespi, Giovanni Resta
Computing Groebner Bases in the Boolean Setting with Applications to Counting. WAE (1997)

Anna Bernasconi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Anna Bernasconi