Search the dblp DataBase

Publications of Author

1. Anna Bernasconi
   On the Complexity of Balanced Boolean Functions. [Citation Graph (0, 0)][DBLP]
   CIAC, 1997, pp:253-263 [Conf]
   
2. Anna Bernasconi, Bruno Codenotti
   Measures of Boolean Function Complexity Based on Harmonic Analysis. [Citation Graph (0, 0)][DBLP]
   CIAC, 1994, pp:63-72 [Conf]
   
3. Anna Bernasconi
   Combinatorial Properties of Classes of Functions Hard to Compute in Constant Depth. [Citation Graph (0, 0)][DBLP]
   COCOON, 1998, pp:339-348 [Conf]
   
4. Anna Bernasconi, Carsten Damm, Igor Shparlinski
   On the Average Sensitivity of Testing Square-Free Numbers. [Citation Graph (0, 0)][DBLP]
   COCOON, 1999, pp:291-299 [Conf]
   
5. Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli
   Fast three-level logic minimization based on autosymmetry. [Citation Graph (0, 0)][DBLP]
   DAC, 2002, pp:425-430 [Conf]
   
6. Anna Bernasconi, Valentina Ciriani, Rolf Drechsler, Tiziano Villa
   Efficient minimization of fully testable 2-SPP networks. [Citation Graph (0, 0)][DBLP]
   DATE, 2006, pp:1300-1305 [Conf]
   
7. Anna Bernasconi, Valentina Ciriani
   DRedSOP: Synthesis of a New Class of Regular Functions. [Citation Graph (0, 0)][DBLP]
   DSD, 2006, pp:377-384 [Conf]
   
8. Anna Bernasconi, Valentina Ciriani, Roberto Cordone
   An approximation algorithm for fully testable kEP-SOP networks. [Citation Graph (0, 0)][DBLP]
   ACM Great Lakes Symposium on VLSI, 2007, pp:417-422 [Conf]
   
9. Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli
   Implicit Test of Regularity for Not Completely Specified Boolean Functions. [Citation Graph (0, 0)][DBLP]
   IWLS, 2002, pp:345-350 [Conf]
   
10. Anna Bernasconi, Igor Shparlinski
    Circuit Complexity of Testing Square-Free Numbers. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:47-56 [Conf]
    
11. Valentina Ciriani, Anna Bernasconi, Rolf Drechsler
    Testability of SPP Three-Level Logic Networks. [Citation Graph (0, 0)][DBLP]
    VLSI-SOC, 2003, pp:331-336 [Conf]
    
12. Eric Allender, Anna Bernasconi, Carsten Damm, Joachim von zur Gathen, Michael E. Saks, Igor Shparlinski
    Complexity of some arithmetic problems for binary polynomials. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2003, v:12, n:1-2, pp:23-47 [Journal]
    
13. Anna Bernasconi, Carsten Damm, Igor Shparlinski
    The average sensitivity of square-freeness. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2000, v:9, n:1, pp:39-51 [Journal]
    
14. Valentina Ciriani, Nadia Pisanti, Anna Bernasconi
    Room allocation: a polynomial subcase of the quadratic assignment problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:144, n:3, pp:263-269 [Journal]
    
15. Anna Bernasconi
    On a hierarchy of Boolean functions hard to compute in constant depth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:79-90 [Journal]
    
16. Anna Bernasconi, Carsten Damm, Igor Shparlinski
    Circuit and Decision Tree Complexity of Some Number Theoretic Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:168, n:2, pp:113-124 [Journal]
    
17. Anna Bernasconi, Lavinia Egidi
    Hilbert Function and Complexity Lower Bounds for Symmetric Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:153, n:1, pp:1-25 [Journal]
    
18. Richard Beigel, Anna Bernasconi
    A Note on the Polynomial Representation of Boolean Functions over GF(2). [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:4, pp:535-0 [Journal]
    
19. Anna Bernasconi
    Sensitivity vs. Block Sensitivity (an Average-Case Study). [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:3, pp:151-157 [Journal]
    
20. Anna Bernasconi
    On the Complexity of Balanced Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:70, n:4, pp:157-163 [Journal]
    
21. Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli
    Exploiting Regularities for Boolean Function Synthesis. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:4, pp:485-501 [Journal]
    
22. Anna Bernasconi, Bruno Codenotti
    Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1999, v:48, n:3, pp:345-351 [Journal]
    
23. Anna Bernasconi, Bruno Codenotti, Jeffrey M. Vanderkam
    A Characterization of Bent Functions in Terms of Strongly Regular Graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2001, v:50, n:9, pp:984-985 [Journal]
    
24. Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli
    Three-level logic minimization based on function regularities. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 2003, v:22, n:8, pp:1005-1016 [Journal]
    
25. Valentina Ciriani, Anna Bernasconi, Rolf Drechsler
    Testability of SPP Three-Level Logic Networks in Static Fault Models. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 2006, v:25, n:10, pp:2241-2248 [Journal]
    
26. Anna Bernasconi, Valentina Ciriani, Roberto Cordone
    EXOR Projected Sum of Products. [Citation Graph (0, 0)][DBLP]
    VLSI-SoC, 2006, pp:284-289 [Conf]
    
27. Anna Bernasconi, Chiara Bodei, Linda Pagli
    Knitting for Fun: A Recursive Sweater. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:53-65 [Conf]
    
28. 
    On decomposing Boolean functions via extended cofactoring. [Citation Graph (, )][DBLP]
    
    
29. 
    On the Construction of Small Fully Testable Circuits with Low Depth. [Citation Graph (, )][DBLP]
    
    
30. 
    On Projecting Sums of Products. [Citation Graph (, )][DBLP]
    
    
31. 
    Logic Minimization and Testability of 2SPP-P-Circuits. [Citation Graph (, )][DBLP]
    
    
32. 
    Fun at a Department Store: Data Mining Meets Switching Theory. [Citation Graph (, )][DBLP]