Folgen
Eleonora Testa
Eleonora Testa
Bestätigte E-Mail-Adresse bei synopsys.com
Titel
Zitiert von
Zitiert von
Jahr
The EPFL logic synthesis libraries
M Soeken, H Riener, W Haaswijk, E Testa, B Schmitt, G Meuli, F Mozafari, ...
arXiv preprint arXiv:1805.05121, 2018
782018
Logic synthesis for established and emerging computing
E Testa, M Soeken, LG Amar, G De Micheli
Proceedings of the IEEE 107 (1), 165-184, 2018
332018
Reducing the multiplicative complexity in logic networks for cryptography and security applications
E Testa, M Soeken, L Amarù, G De Micheli
Proceedings of the 56th Annual Design Automation Conference 2019, 1-6, 2019
322019
Scalable generic logic synthesis: One approach to rule them all
H Riener, E Testa, W Haaswijk, A Mishchenko, L Amarù, G De Micheli, ...
Proceedings of the 56th Annual Design Automation Conference 2019, 1-6, 2019
262019
Practical exact synthesis
M Soeken, W Haaswijk, E Testa, A Mishchenko, LG Amarù, RK Brayton, ...
2018 Design, Automation & Test in Europe Conference & Exhibition (DATE), 309-314, 2018
232018
Inversion optimization in majority-inverter graphs
E Testa, M Soeken, O Zografos, L Amaru, P Raghavan, R Lauwereins, ...
2016 IEEE/ACM International Symposium on Nanoscale Architectures (NANOARCH …, 2016
212016
Inverter propagation and fan-out constraints for beyond-CMOS majority-based technologies
E Testa, O Zografos, M Soeken, A Vaysset, M Manfrini, R Lauwereins, ...
2017 IEEE Computer Society Annual Symposium on VLSI (ISVLSI), 164-169, 2017
192017
Wave pipelining for majority-based beyond-CMOS technologies
O Zografos, A De Meester, E Testa, M Soeken, PE Gaillardon, ...
Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017 …, 2017
182017
A logic synthesis toolbox for reducing the multiplicative complexity in logic networks
E Testa, M Soeken, H Riener, L Amaru, G De Micheli
2020 Design, Automation & Test in Europe Conference & Exhibition (DATE), 568-573, 2020
172020
Three-input gates for logic synthesis
DS Marakkalage, E Testa, H Riener, A Mishchenko, M Soeken, ...
IEEE Transactions on Computer-Aided Design of Integrated Circuits and …, 2020
152020
Mapping monotone boolean functions into majority
E Testa, M Soeken, LG Amaru, W Haaswijk, G De Micheli
IEEE Transactions on Computers 68 (5), 791-797, 2018
152018
Size optimization of MIGs with an application to QCA and STMG technologies
H Riener, E Testa, L Amaru, M Soeken, G De Micheli
Proceedings of the 14th IEEE/ACM International Symposium on Nanoscale …, 2018
152018
Algebraic and Boolean optimization methods for AQFP superconducting circuits
E Testa, SY Lee, H Riener, G De Micheli
Proceedings of the 26th Asia and South Pacific Design Automation Conference …, 2021
142021
Classifying functions with exact synthesis
W Haaswijk, E Testa, M Soeken, G De Micheli
2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL), 272-277, 2017
142017
Majority logic synthesis
L Amarù, E Testa, M Couceiro, O Zografos, G De Micheli, M Soeken
2018 IEEE/ACM International Conference on Computer-Aided Design (ICCAD), 1-6, 2018
132018
Scalable Boolean methods in a modern synthesis flow
E Testa, L Amarú, M Soeken, A Mishchenko, P Vuillod, J Luo, C Casares, ...
2019 Design, Automation & Test in Europe Conference & Exhibition (DATE …, 2019
92019
Exact synthesis for logic synthesis applications with complex constraints
E Testa, M Soeken, O Zografos, F Catthoor, G De Micheli
Proceedings of the 26th International Workshop on Logic & Synthesis (IWLS), 2017
72017
Multi-level logic benchmarks: An exactness study
L Amarú, M Soeken, W Haaswijk, E Testa, P Vuillod, J Luo, PE Gaillardon, ...
2017 22nd Asia and South Pacific Design Automation Conference (ASP-DAC), 157-162, 2017
52017
The EPFL Logic Synthesis Libraries (2019)
M Soeken, H Riener, W Haaswijk, E Testa, B Schmitt, G Meuli, F Mozafari, ...
arXiv preprint arXiv:1805.05121, 0
5
Extending Boolean Methods for Scalable Logic Synthesis
E Testa, L Amarú, M Soeken, A Mishchenko, P Vuillod, PE Gaillardon, ...
IEEE Access 8, 226828-226844, 2020
42020
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20