Autore
ANNA BERNASCONI
Unimap Dati autore
- Professore Associato presso Dipartimento di Informatica
- Membro della Facolta' di Scienze Matematiche Fisiche e Naturali
- Settore scientifico disciplinare INF/01 INFORMATICA
- In servizio
Prodotti
- Articoli
- Sensitivity vs. Block Sensitivity (an average-case study) 1996
- Harmonic Analysis and Boolean Function Complexity 1998
- A Note on the Polynomial Representation of Boolean Functions over GF(2) 1999
- Hilbert function and complexity lower bounds for symmetric Boolean functions 1999
- How fast can one compute the permanent of circulant matrices? 1999
- On the Complexity of Balanced Boolean functions 1999
- Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem 1999
- The Average Sensitivity of Square-Freeness 2000
- A Characterization of Bent Functions in terms of Strongly Regular Graphs 2001
- Circuit and Decision Tree Complexity of Some Number Theoretic Problems 2001
- On a hierarchy of Boolean functions hard to compute in constant depth 2001
- Three-Level Logic Minimization Based on Function Regularities 2003
- Complexity of some arithmetic problems for binary polynomials 2004
- Room Allocation: a Polynomial Subcase of the Quadratic Assignment Problem. 2004
- Spectral Analysis of Symmetric Threshold Functions 2004
- Exploiting Regularities for Boolean Function Synthesis 2006
- Testability of SPP Three-Level Logic Networks in Static Fault Models. 2006
- Logic Minimization and Testability of 2-SPP Networks. 2008
- On formal descriptions for knitting recursive patterns 2008
- On the Construction of Small Fully Testable Circuits with Low Depth. 2008
- Quantum networks on cubelike graphs 2008
- Synthesis of Autosymmetric Functions in a New Three-Level Form 2008
- The optimization of kEP-SOPs: computational complexity, approximability and experiments 2008
- Dimension-reducible Boolean Functions based on Affine Spaces 2010
- Autosymmetric and Dimension Reducible Multiple-Valued Functions 2012
- Synthesis of P-circuits for logic restructuring 2012
- Atti, Riassunti o Comunicazioni
- Measures of Boolean Function Complexity based on Harmonic Analysis. 1994
- Computing Groebner Bases in the Boolean setting with Applications to Counting 1997
- On the Complexity of Balanced Boolean Functions 1997
- Combinatorial Properties of Classes of Functions Hard to Compute in Constant Depth 1998
- On Boolean Functions Satisfying Odd Order Propagation Criteria 1998
- On the Polynomial Representation of Boolean Functions over GF(2) 1998
- Circuit Complexity of Testing Square-Free Numbers 1999
- On the Average Sensitivity of Testing Square-free numbers 1999
- On Boolean Functions associated to Bipartite Cayley Graphs 2000
- Efficient Optimal Greedy Algorithms for Room Allocation 2001
- 2-SPP: a practical trade-off between SP and SPP synthesis 2002
- Fast Three-Level Logic Minimization Based on Autosymmetry 2002
- Implicit Test of Regularity for Incompletely Specified Boolean Functions 2002
- Testability of SPP Three-Level Logic Networks 2003
- DSOP: Synthesis of a new class of regular functions 2006
- EXOR Projected Sum of Products 2006
- Efficient Minimization of Fully Testable 2-SPP Networks. 2006
- An Approximation Algorithm for Fully Testable kEP-SOP Networks 2007
- Knitting for Fun: A Recursive Sweater 2007
- On the Construction of Small Fully Testable Circuits with Low Depth 2007
- A New Heuristic for DSOP Minimization. 2008
- An Approximation Algorithm for Generalized EXOR Projected Sum of Products 2008
- On Projecting Sums of Products 2008
- Logic Minimization and Testability of 2SPP-P-Circuits. 2009
- On Decomposing Boolean Functions via Extended Cofactoring 2009
- Fun at a Department Store: Data Mining Meets Switching Theory 2010
- Logic Synthesis and Testability of D-Reducible Functions 2010
- SEPP: a New Compact Three-Level Logic Form 2010
- An Approximation Algorithm for Cofactoring-Based Synthesis. 2011
- Autosymmetric Multiple-Valued Functions: Theory and Spectral Characterization. 2011
- Compact and Testable Circuits for Regular Functions 2011
- Projected Don't Cares 2012
- Capitoli, Parte,Saggi, Studi, Articoli in libro
- Testability of SPP Three-Level Logic Networks in Static Fault Models - VLSI-SoC Book 2006
- Logic Synthesis of EXOR Projected Sum of Products - Logic Synthesis of EXOR Projected Sum of Products 2008
- Algoritmi ricorsivi da lavorare ai ferri - Miss Architect, Architetture al femminile 2009
- Logic Synthesis by Signal-Driven Decomposition - Advanced Techniques in Logic Synthesis, Optimizations and Applications 2010
- Libri, Manuali o Trattati
- Rapporti