Urmăriți
ANNA BERNASCONI
ANNA BERNASCONI
Afiliere necunoscută
Adresă de e-mail confirmată pe unipi.it
Titlu
Citat de
Citat de
Anul
Spectral analysis of Boolean functions as a graph eigenvalue problem
A Bernasconi, B Codenotti
IEEE transactions on computers 48 (3), 345-351, 1999
1261999
Quantum networks on cubelike graphs
A Bernasconi, C Godsil, S Severini
Physical Review A 78 (5), 052320, 2008
932008
A characterization of bent functions in terms of strongly regular graphs
A Bernasconi, B Codenottl, JM Vanderkam
IEEE Transactions on Computers 50 (9), 984-985, 2001
672001
Mathematical techniques for the analysis of Boolean functions
A Bernasconi
BULLETIN-EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE 65, 228-230, 1998
471998
On decomposing Boolean functions via extended cofactoring
A Bernasconi, V Ciriani, G Trucco, T Villa
2009 Design, Automation & Test in Europe Conference & Exhibition, 1464-1469, 2009
382009
Three-level logic minimization based on function regularities
A Bernasconi, V Ciriani, F Luccio, L Pagli
IEEE Transactions on computer-aided design of integrated circuits and …, 2003
362003
Logic minimization and testability of 2-SPP networks
A Bernasconi, V Ciriani, R Drechsler, T Villa
IEEE Transactions on Computer-Aided Design of Integrated Circuits and …, 2008
332008
Circuit and decision tree complexity of some number theoretic problems
A Bernasconi, C Damm, I Shparlinski
Information and Computation 168 (2), 113-124, 2001
332001
On the Fourier analysis of Boolean functions
A Bernasconi, B Codenotti, J Simon
preprint, 1-24, 1996
281996
Circuit complexity of testing square-free numbers
A Bernasconi, I Shparlinski
STACS 99: 16th Annual Symposium on Theoretical Aspects of Computer Science …, 1999
251999
Sensitivity vs. block sensitivity (an average-case study)
A Bernasconi
Information processing letters 59 (3), 151-157, 1996
241996
Room allocation: a polynomial subcase of the quadratic assignment problem
V Ciriani, N Pisanti, A Bernasconi
Discrete Applied Mathematics 144 (3), 263-269, 2004
212004
Logic synthesis and testing techniques for switching nano-crossbar arrays
D Alexandrescu, M Altun, L Anghel, A Bernasconi, V Ciriani, L Frontini, ...
Microprocessors and Microsystems 54, 14-25, 2017
202017
Synthesis on switching lattices of dimension-reducible boolean functions
A Bernasconi, V Ciriani, L Frontini, G Trucco
2016 IFIP/IEEE International Conference on Very Large Scale Integration …, 2016
202016
Logic synthesis for switching lattices by decomposition with p-circuits
A Bernasconi, V Ciriani, L Frontini, V Liberali, G Trucco, T Villa
2016 Euromicro Conference on Digital System Design (DSD), 423-430, 2016
202016
Synthesis of autosymmetric functions in a new three-level form
A Bernasconi, V Ciriani, F Luccio, L Pagli
Theory of Computing Systems 42, 450-464, 2008
182008
Exploiting regularities for Boolean function synthesis
A Bernasconi, V Ciriani, F Luccio, L Pagli
Theory of Computing Systems 39, 485-501, 2006
182006
Fast three-level logic minimization based on autosymmetry
A Bernasconi, V Ciriani, F Luccio, L Pagli
Proceedings of the 39th annual Design Automation Conference, 425-430, 2002
182002
The average sensitivity of square-freeness
A Bernasconi, C Damm, I Shparlinski
computational complexity 9, 39-51, 2000
182000
On the average sensitivity of testing square-free numbers
A Bernasconi, C Damm, IE Shparlinski
International Computing and Combinatorics Conference, 291-299, 1999
181999
Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.
Articole 1–20