Luca Amarù

2.5k total citations
90 papers, 1.7k citations indexed

About

Luca Amarù is a scholar working on Electrical and Electronic Engineering, Computational Theory and Mathematics and Hardware and Architecture. According to data from OpenAlex, Luca Amarù has authored 90 papers receiving a total of 1.7k indexed citations (citations by other indexed papers that have themselves been cited), including 68 papers in Electrical and Electronic Engineering, 36 papers in Computational Theory and Mathematics and 29 papers in Hardware and Architecture. Recurrent topics in Luca Amarù's work include Low-power high-performance VLSI design (28 papers), VLSI and Analog Circuit Testing (24 papers) and Advancements in Semiconductor Devices and Circuit Design (22 papers). Luca Amarù is often cited by papers focused on Low-power high-performance VLSI design (28 papers), VLSI and Analog Circuit Testing (24 papers) and Advancements in Semiconductor Devices and Circuit Design (22 papers). Luca Amarù collaborates with scholars based in Switzerland, United States and Germany. Luca Amarù's co-authors include Pierre‐Emmanuel Gaillardon, Giovanni De Micheli, Mathias Soeken, Anupam Chattopadhyay, Winston Haaswijk, Rainer Waser, Anne Siemon, Eike Linn, Alan Mishchenko and Subhasish Mitra and has published in prestigious journals such as Proceedings of the IEEE, IEEE Access and IEEE Transactions on Computers.

In The Last Decade

Luca Amarù

86 papers receiving 1.7k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Luca Amarù Switzerland 22 1.3k 526 417 291 158 90 1.7k
Marco Ottavi Italy 21 1.6k 1.2× 810 1.5× 392 0.9× 144 0.5× 353 2.2× 150 1.8k
Swaroop Ghosh United States 27 1.9k 1.4× 289 0.5× 981 2.4× 730 2.5× 249 1.6× 204 2.6k
Sanjukta Bhanja United States 20 1.3k 0.9× 867 1.6× 336 0.8× 126 0.4× 520 3.3× 99 1.5k
Mathias Soeken Switzerland 25 1.0k 0.8× 988 1.9× 401 1.0× 1.0k 3.4× 124 0.8× 151 2.1k
Valeriu Beiu United Arab Emirates 17 1.0k 0.8× 283 0.5× 97 0.2× 243 0.8× 84 0.5× 156 1.2k
J. Chandy United States 19 814 0.6× 103 0.2× 745 1.8× 249 0.9× 97 0.6× 134 1.4k
Indranil Sengupta India 20 631 0.5× 234 0.4× 230 0.6× 483 1.7× 26 0.2× 140 1.2k
Salvatore Pontarelli Italy 22 1.0k 0.8× 228 0.4× 686 1.6× 320 1.1× 81 0.5× 149 1.8k
Kartik Mohanram United States 31 2.2k 1.7× 126 0.2× 1.3k 3.0× 111 0.4× 151 1.0× 107 2.6k
Bibhash Sen India 19 1.1k 0.8× 1.0k 2.0× 161 0.4× 170 0.6× 408 2.6× 92 1.3k

Countries citing papers authored by Luca Amarù

Since Specialization
Citations

This map shows the geographic impact of Luca Amarù's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Luca Amarù with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Luca Amarù more than expected).

Fields of papers citing papers by Luca Amarù

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Luca Amarù. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Luca Amarù. The network helps show where Luca Amarù may publish in the future.

Co-authorship network of co-authors of Luca Amarù

This figure shows the co-authorship network connecting the top 25 collaborators of Luca Amarù. A scholar is included among the top collaborators of Luca Amarù based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Luca Amarù. Luca Amarù is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Mishchenko, Alan, et al.. (2025). Scalable Sequential Logic Synthesis Using Observability Don’t Care Conditions. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 45(2). 732–745.
2.
Mishchenko, Alan, et al.. (2024). Scalable Sequential Optimization Under Observability Don't Cares. 1–6.
3.
Amarù, Luca, et al.. (2020). Extending Boolean Methods for Scalable Logic Synthesis. IEEE Access. 8. 226828–226844. 5 indexed citations
4.
Soeken, Mathias, et al.. (2018). Mapping Monotone Boolean Functions into Majority. IEEE Transactions on Computers. 68(5). 791–797. 7 indexed citations
5.
Haaswijk, Winston, Mathias Soeken, Luca Amarù, Pierre‐Emmanuel Gaillardon, & Giovanni De Micheli. (2017). A novel basis for logic rewriting. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 151–156. 52 indexed citations
6.
Soeken, Mathias, Luca Amarù, Pierre‐Emmanuel Gaillardon, & Giovanni De Micheli. (2017). Exact Synthesis of Majority-Inverter Graphs and Its Applications. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 36(11). 1842–1855. 63 indexed citations
7.
Soeken, Mathias, Odysseas Zografos, Luca Amarù, et al.. (2016). Inversion optimization in majority-inverter graphs. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 17 indexed citations
8.
Gaillardon, Pierre‐Emmanuel, Luca Amarù, Anne Siemon, et al.. (2016). The Programmable Logic-in-Memory (PLiM) computer. RWTH Publications (RWTH Aachen). 427–432. 67 indexed citations
9.
Gaillardon, Pierre‐Emmanuel, Luca Amarù, Anne Siemon, et al.. (2016). The Programmable Logic-in-Memory (PLiM) Computer (Invited). Infoscience (Ecole Polytechnique Fédérale de Lausanne). 427–432. 10 indexed citations
10.
Soeken, Mathias, Luca Amarù, Pierre‐Emmanuel Gaillardon, & Giovanni De Micheli. (2016). Optimizing Majority-Inverter Graphs With Functional Hashing. 1030–1035. 26 indexed citations
11.
Gaillardon, Pierre‐Emmanuel, et al.. (2016). Digital, analog and RF design opportunities of three-independent-gate transistors. 405–408. 8 indexed citations
12.
Amarù, Luca, Pierre‐Emmanuel Gaillardon, Anupam Chattopadhyay, & Giovanni De Micheli. (2015). A Sound and Complete Axiomatization of Majority-$n$ Logic. IEEE Transactions on Computers. 65(9). 2889–2895. 23 indexed citations
13.
Gaillardon, Pierre‐Emmanuel, et al.. (2015). A fast pruning technique for low-power inexact Circuit design. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 1–4. 9 indexed citations
14.
Amarù, Luca, Gage Hills, Pierre‐Emmanuel Gaillardon, Subhasish Mitra, & Giovanni De Micheli. (2015). Multiple Independent Gate FETs: How many gates do we need?. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 243–248. 8 indexed citations
15.
Gaillardon, Pierre‐Emmanuel, Luca Amarù, Jian Zhang, & Giovanni De Micheli. (2014). Advanced system on a chip design based on controllable-polarity FETs. Design, Automation, and Test in Europe. 1–6. 22 indexed citations
16.
Amarù, Luca, Pierre‐Emmanuel Gaillardon, & Giovanni De Micheli. (2014). An efficient manipulation package for biconditional binary decision diagrams. Design, Automation, and Test in Europe. 296. 7 indexed citations
17.
Amarù, Luca, Pierre‐Emmanuel Gaillardon, & Giovanni De Micheli. (2014). Majority-Inverter Graph. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 1–6. 119 indexed citations
18.
Amarù, Luca, Pierre‐Emmanuel Gaillardon, & Giovanni De Micheli. (2014). Majority Logic Representation and Satisfiability. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 3 indexed citations
19.
Amarù, Luca, Pierre‐Emmanuel Gaillardon, & Giovanni De Micheli. (2013). Biconditional BDD: a novel canonical BDD for logic synthesis targeting XOR-rich circuits. Design, Automation, and Test in Europe. 1014–1017. 22 indexed citations
20.
Amarù, Luca, Pierre‐Emmanuel Gaillardon, & Giovanni De Micheli. (2013). Efficient Arithmetic Logic Gates Using Double-Gate Silicon Nanowire FETs, invited paper. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026