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