Homepage Anagrafe della Ricerca

• Consultazione dati

  • per struttura
  • per settore
  • per autore
  • per parola
  • per più criteri

• Link correlati

  • Unimap

• Funzioni

  • Stampa pagina

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

• lista concisa
• lista espansa
• tipo
• anno

• Articolo in rivista

  1. A. Bernasconi,Sensitivity vs. Block Sensitivity (an average-case study), INFORMATION PROCESSING LETTERS,vol. 59,num. 3,pp 151,tot.pag 7,1996
  2. A. Bernasconi,Harmonic Analysis and Boolean Function Complexity, CALCOLO,vol. 35,num. 3,pp 149,tot.pag 38,1998
  3. A. Bernasconi,On the Complexity of Balanced Boolean functions, INFORMATION PROCESSING LETTERS,vol. 70,num. 4,pp 157,tot.pag 7,1999
  4. A. Bernasconi, L. Egidi,Hilbert function and complexity lower bounds for symmetric Boolean functions, INFORMATION AND COMPUTATION,vol. 153,num. 1,pp 1,tot.pag 25,1999
  5. R. Beigel, A. Bernasconi,A Note on the Polynomial Representation of Boolean Functions over GF(2), International Journal of Foundations of Computer Science,vol. 10,num. 4,pp 535,tot.pag 8,1999
  6. A. Bernasconi, B. Codenotti,Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem, IEEE TRANSACTIONS ON COMPUTERS,vol. 48,num. 3,pp 345,tot.pag 7,1999
  7. A. Bernasconi, B. Codenotti, V. Crespi, G. Resta,How fast can one compute the permanent of circulant matrices?, LINEAR ALGEBRA AND ITS APPLICATIONS,vol. 292,num. 1-3,pp 15,tot.pag 23,1999
  8. A. Bernasconi, C. Damm, I. Shparlinski,The Average Sensitivity of Square-Freeness, COMPUTATIONAL COMPLEXITY,vol. 9,num. 1,pp 39,tot.pag 13,2000
  9. A. Bernasconi, B. Codenotti, J.M. VanderKam,A Characterization of Bent Functions in terms of Strongly Regular Graphs, IEEE TRANSACTIONS ON COMPUTERS,vol. 50,num. 9,pp 984-985,tot.pag 2,2001
  10. A. Bernasconi, C. Damm, I. Shparlinski,Circuit and Decision Tree Complexity of Some Number Theoretic Problems, INFORMATION AND COMPUTATION,vol. 168,num. 2,pp 113-124,tot.pag 12,2001
  11. A. Bernasconi.,On a hierarchy of Boolean functions hard to compute in constant depth, Discrete Mathematics and Theoretical Computer Science,vol. 4,num. 2,pp 79-90,tot.pag 12,2001
  12. Bernasconi A., Ciriani V., Luccio F., Pagli L.,Three-Level Logic Minimization Based on Function Regularities, IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS,vol. 22,num. 8,pp 1005-1016,tot.pag 12,2003
  13. E. Allender, A. Bernasconi, C. Damm, J. von zur Gathen, M. Saks, I. Shparlinski,Complexity of some arithmetic problems for binary polynomials, COMPUTATIONAL COMPLEXITY,vol. 12,num. 1-2,pp 23-47,tot.pag 25,2004
  14. A. Bernasconi, B. Codenotti,Spectral Analysis of Symmetric Threshold Functions, Journal of Multiple-Valued Logic and Soft Computing,vol. 10,num. 2,pp 159-171,tot.pag 13,2004
  15. V. Ciriani, N. Pisanti, A. Bernasconi.,Room Allocation: a Polynomial Subcase of the Quadratic Assignment Problem., DISCRETE APPLIED MATHEMATICS,vol. 144,num. 3,pp 263-269,tot.pag 7,2004
  16. V. Ciriani, A. Bernasconi, R. Drechsler.,Testability of SPP Three-Level Logic Networks in Static Fault Models., IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS,vol. 25(10),pp 2241-2248,tot.pag 8,2006
  17. Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, and Linda Pagli,Exploiting Regularities for Boolean Function Synthesis, THEORY OF COMPUTING SYSTEMS,vol. 39 (4),pp 485-501,tot.pag 16,2006
  18. BERNASCONI ANNA, Ciriani Valentina, LUCCIO FABRIZIO, PAGLI LINDA,Synthesis of Autosymmetric Functions in a New Three-Level Form, THEORY OF COMPUTING SYSTEMS,vol. 42/4,pp 450,tot.pag 14,2008
  19. BERNASCONI ANNA, Ciriani Valentina, Cordone Roberto,The optimization of kEP-SOPs: computational complexity, approximability and experiments, ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS,vol. 13 (2),pp 35:1,tot.pag 31,2008
  20. BERNASCONI ANNA, Godsil Chris, Severini Simone,Quantum networks on cubelike graphs, PHYSICAL REVIEW A (ATOMIC, MOLECULAR AND OPTICAL PHYSICS),pp 1,tot.pag 5,2008
  21. Fey Görschwin, BERNASCONI ANNA, Ciriani Valentina, Drechsler Rolf,On the Construction of Small Fully Testable Circuits with Low Depth., MICROPROCESSORS AND MICROSYSTEMS,vol. 32,pp 263,tot.pag 7,2008
  22. BERNASCONI ANNA, Ciriani Valentina, Drechsler Rolf, Villa Tiziano,Logic Minimization and Testability of 2-SPP Networks., IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS,vol. 27(7),pp 1190,tot.pag 13,2008
  23. BERNASCONI ANNA, BODEI CHIARA, PAGLI LINDA,On formal descriptions for knitting recursive patterns, JOURNAL OF MATHEMATICS AND THE ARTS,vol. 2 (1),pp 9,tot.pag 19,tot. autori 3,2008
  24. BERNASCONI ANNA, Ciriani Valentina,Dimension-reducible Boolean Functions based on Affine Spaces, ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS,vol. Volume 16 Issue 2,pp 13:1,tot.pag 23,2010
  25. BERNASCONI ANNA, Ciriani Valentina, Liberali Valentino, Trucco Gabriella, Villa Tiziano,Synthesis of P-circuits for logic restructuring, INTEGRATION: THE V L S I JOURNAL,vol. 45(3),pp 282,tot.pag 12,2012
  26. BERNASCONI ANNA, Ciriani Valentina,Autosymmetric and Dimension Reducible Multiple-Valued Functions, JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING,pp to appear,tot.pag 28,2012
• 
  

  Libro, manuale o trattato

  1. G. Attardi, A. Bernasconi.,Fondamenti di Computer Graphics,tot.pag. 0,1996
  2. A. Bernasconi, B. Codenotti,Introduzione alla Complessita' Computazionale,tot.pag. 258,edizione Springer Verlag - Italia,1998
  3. A. Bernasconi, B. Codenotti, G. Resta,Metodi Matematici in Complessita' Computazionale,tot.pag. 364,edizione Springer Verlag - Italia,1999
• 
  

  Capitolo, parte o articolo in libro

  1. V. Ciriani, A. Bernasconi, R. Drechsler,Testability of SPP Three-Level Logic Networks in Static Fault Models in VLSI-SoC Book,pp 299, 313, Kluwer-Springer,tot.pag. 15,2006
  2. BERNASCONI ANNA, Ciriani Valentina, Cordone Roberto,Logic Synthesis of EXOR Projected Sum of Products in Logic Synthesis of EXOR Projected Sum of Products,pp 241, 257,tot.pag. 17,2008
  3. BERNASCONI ANNA, BODEI CHIARA, PAGLI LINDA,Algoritmi ricorsivi da lavorare ai ferri in Miss Architect, Architetture al femminile,pp 39, 47,2009
  4. BERNASCONI ANNA, Ciriani Valentina, Trucco Gabriella, Villa Tiziano,Logic Synthesis by Signal-Driven Decomposition in Advanced Techniques in Logic Synthesis, Optimizations and Applications,pp 9, 29,tot.pag. 20,2010
• 
  

  Articolo su atti di congresso internazionale

  1. BERNASCONI ANNA, Codenotti Bruno,Measures of Boolean Function Complexity based on Harmonic Analysis., Italian Conference on Algorithms and Complexity, CIAC’94, pp 63-72, Roma, Italia,vol. 778,1994
  2. A. Bernasconi, B. Codenotti, V. Crespi, G. Resta,Computing Groebner Bases in the Boolean setting with Applications to Counting, 1sr Workshop on Algorithm Engineering, WAE, pp 209, Venezia (Italia),vol. 1,1997
  3. A. Bernasconi,On the Complexity of Balanced Boolean Functions, 3rd Italian Conference on Algorithms and Complexity, CIAC, pp 253, Roma (Italia),vol. 1203,1997
  4. A. Bernasconi,Combinatorial Properties of Classes of Functions Hard to Compute in Constant Depth, 4th International Computing and Combinatorics Conference, COCOON, pp 339, Taipei, Taiwan (ROC),vol. 1449,1998
  5. A. Bernasconi,On the Polynomial Representation of Boolean Functions over GF(2), 6th Italian Conference on Theoretical Computer Science,ICTCS, pp 265, Prato (Italia),vol. 6,1998
  6. A. Bernasconi,On Boolean Functions Satisfying Odd Order Propagation Criteria, 3rd International Workshop on Boolean Problems, IWBP, pp 117, Freiberg (Germania),vol. 3,1998
  7. A. Bernasconi, I. Shparlinski,Circuit Complexity of Testing Square-Free Numbers, 16th International Symposium on Theoretical Aspects inComputer Science, STACS, pp 47, Trier (Germania),vol. 1563,1999
  8. A. Bernasconi, C. Damm, I. Shparlinski,On the Average Sensitivity of Testing Square-free numbers, 5th Int. Computing and Combinatorics Conference, COCOON, pp 291, Tokyo (Giappone),vol. 1627,1999
  9. A. Bernasconi, B. Codenotti,On Boolean Functions associated to Bipartite Cayley Graphs, 4th International Workshop on Boolean Problems, IWBP, pp 167, Freiberg (Germania),vol. 4,2000
  10. V. Ciriani, N. Pisanti, A. Bernasconi,Efficient Optimal Greedy Algorithms for Room Allocation, 2nd International Conference on Fun with Algorithms, pp 43-60, Isola D,vol. 10,2001
  11. A. Bernasconi, V. Ciriani, F. Luccio, L. Pagli,Fast Three-Level Logic Minimization Based on Autosymmetry, 39th ACM/IEEE Design Automation Conference, pp 425-430, New Orleans,vol. 1,2002
  12. Ciriani V., Bernasconi A.,2-SPP: a practical trade-off between SP and SPP synthesis, 5th International Workshop on Boolean Problems, IWSBP, pp 133-140, Freiberg, Germany,vol. 5,2002
  13. Bernasconi A., Ciriani V., Luccio F., Pagli L.,Implicit Test of Regularity for Incompletely Specified Boolean Functions, 11th IEEE/ACM International Workshop on Logic & Synthesis, IWLS, pp 345-356, New Orleans, U.S.A., 2002.,vol. 11,2002
  14. V. Ciriani, A. Bernasconi, R. Drechsler,Testability of SPP Three-Level Logic Networks, 12th International Conference on Very Large Scale Integration, pp 331-336, Darmstadt, Germany, 2003.,vol. 12,2003
  15. BERNASCONI ANNA, Ciriani Valentina, Cordone Roberto,EXOR Projected Sum of Products, IFIP VLSI-SoC 2006, IFIP WG 10.5 International Conference, pp 284-289,2006
  16. A. Bernasconi, V. Ciriani, R. Drechsler, T. Villa.,Efficient Minimization of Fully Testable 2-SPP Networks., Design, Automation and Test in Europe (DATE), pp 1300-1305, Monaco di Baviera, Germania,vol. ACM DATE06,2006
  17. Anna Bernasconi, Valentina Ciriani,DSOP: Synthesis of a new class of regular functions, 9th EUROMICRO CONFERENCE ON DIGITAL SYSTEM DESIGN (Architectures, Methods and Tools), pp 377-384, Dubrovnik, Croatia,2006
  18. Fey Goerschwin, BERNASCONI ANNA, Ciriani Valentina, Drechsler Rolf,On the Construction of Small Fully Testable Circuits with Low Depth, 10th Euromicro Conference on Digital System Design (DSD) Architectures, Methods and Tools, pp 563-569,2007
  19. BERNASCONI ANNA, Ciriani Valentina, Cordone Roberto,An Approximation Algorithm for Fully Testable kEP-SOP Networks, ACM Great Lakes Symposium on VLSI, pp 417-422,2007
  20. BERNASCONI ANNA, BODEI CHIARA, PAGLI LINDA,Knitting for Fun: A Recursive Sweater, Fun with Algorithms, 4th International Conference, FUN 2007, pp 53-65,2007
  21. BERNASCONI ANNA, Ciriani Valentina, Cordone Roberto,On Projecting Sums of Products, 10th Euromicro Conference on Digital System Design (DSD) Architectures, Methods and Tools, pp 1-8,2008
  22. BERNASCONI ANNA, Ciriani Valentina, LUCCIO FABRIZIO, PAGLI LINDA,A New Heuristic for DSOP Minimization., Proc. 8th International Workshop on Boolean Problems, IWSBP’08, pp 1-6, Freiberg, Germany,2008
  23. BERNASCONI ANNA, Ciriani Valentina, Cordone Roberto,An Approximation Algorithm for Generalized EXOR Projected Sum of Products, IFIP/IEEE VLSI-SoC 2008 - International Conference on Very Large Scale Integration, pp 1-8, Rodi (Grecia),2008
  24. BERNASCONI ANNA, Ciriani Valentina, Trucco Gabriella, Villa Tiziano,On Decomposing Boolean Functions via Extended Cofactoring, Design, Automation and Test in Europe (DATE), pp 1-6, Nice, France,vol. ACM DATE09,2009
  25. BERNASCONI ANNA, Ciriani Valentina, Trucco Gabriella, Villa Tiziano,Logic Minimization and Testability of 2SPP-P-Circuits., Euromicro Conference on Digital Systems Design (DSD): Architectures, Methods and Toolsl, pp 773-780,2009
  26. Ciriani Valentina, BERNASCONI ANNA,SEPP: a New Compact Three-Level Logic Form, Proc. 9th International Workshop on Boolean Problems, IWSBP’10, pp 1-6, Freiberg, Germany,2010
  27. BERNASCONI ANNA, Ciriani Valentina, LUCCIO FABRIZIO, PAGLI LINDA,Fun at a Department Store: Data Mining Meets Switching Theory, 5th International Conference on Fun with Algorithms, FUN'10, pp 41-52,vol. 6099,2010
  28. BERNASCONI ANNA, Ciriani Valentina,Logic Synthesis and Testability of D-Reducible Functions, FIP/IEEE VLSI-SoC 2010 - International Conference on Very Large Scale Integration, pp to-appear, Madrid, Spain,2010
  29. BERNASCONI ANNA, Ciriani Valentina,Compact and Testable Circuits for Regular Functions, Workshop on Exploiting Regularity in the Design of IPs, Architectures and Platforms (ERDIAP), pp 1-10,2011
  30. BERNASCONI ANNA, Ciriani Valentina,Autosymmetric Multiple-Valued Functions: Theory and Spectral Characterization., 41st IEEE International Symposium on Multiple-Valued Logic, ISMVL 2011, pp 1-6,2011
  31. BERNASCONI ANNA, Ciriani Valentina, Liberali Valentino, Trucco Gabriella, Villa Tiziano,An Approximation Algorithm for Cofactoring-Based Synthesis., 21st ACM Great Lakes Symposium on VLSI, GLSVLSI'11, pp 1-6,2011
  32. BERNASCONI ANNA, Ciriani Valentina, Trucco Gabriella, Villa Tiziano,Projected Don't Cares, Euromicro Conference on Digital Systems Design (DSD): Architectures, Methods and Tools, pp to appear-1-8,2012
• 
  

  Rapporto finale di ricerca pubblicato

  1. A. Bernasconi, B. Codenotti, L. Egidi,On the Hilbert Function of Zero Sets of Boolean Functions, ISTITUTO DI MATEMATICA COMPUTAZIONALE - Consiglio Nazionale delle Ricerche,1996
  2. BERNASCONI ANNA, Ciriani Valentina, LUCCIO FABRIZIO, PAGLI LINDA,Compact DSOP and partial DSOP Forms, arXiv.org,2012