Alan Mishchenko

5.6k total citations · 1 hit paper
173 papers, 3.1k citations indexed

About

Alan Mishchenko is a scholar working on Hardware and Architecture, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, Alan Mishchenko has authored 173 papers receiving a total of 3.1k indexed citations (citations by other indexed papers that have themselves been cited), including 109 papers in Hardware and Architecture, 109 papers in Computational Theory and Mathematics and 88 papers in Electrical and Electronic Engineering. Recurrent topics in Alan Mishchenko's work include Formal Methods in Verification (100 papers), VLSI and Analog Circuit Testing (91 papers) and Low-power high-performance VLSI design (51 papers). Alan Mishchenko is often cited by papers focused on Formal Methods in Verification (100 papers), VLSI and Analog Circuit Testing (91 papers) and Low-power high-performance VLSI design (51 papers). Alan Mishchenko collaborates with scholars based in United States, Switzerland and Taiwan. Alan Mishchenko's co-authors include Robert K. Brayton, Satrajit Chatterjee, Marek Perkowski, Niklas Eén, Giovanni De Micheli, Mathias Soeken, Sungmin Cho, Jie-Hong R. Jiang, Bernd Steinbach and Lingli Wang and has published in prestigious journals such as Proceedings of the IEEE, IEEE Access and IEEE Transactions on Computers.

In The Last Decade

Alan Mishchenko

160 papers receiving 2.9k citations

Hit Papers

DAG-aware AIG rewriting a fresh look at combinational log... 2006 2026 2012 2019 2006 100 200 300

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Alan Mishchenko United States 27 1.8k 1.6k 1.6k 872 379 173 3.1k
Fabio Somenzi United States 32 1.5k 0.8× 1.7k 1.1× 1.9k 1.1× 740 0.8× 923 2.4× 160 3.3k
Andreas Kuehlmann United States 22 870 0.5× 1.0k 0.6× 976 0.6× 316 0.4× 416 1.1× 71 1.7k
F. Brglez United States 22 2.6k 1.5× 2.7k 1.6× 391 0.2× 211 0.2× 276 0.7× 92 3.2k
Mathias Soeken Switzerland 25 1.0k 0.6× 401 0.2× 988 0.6× 1.0k 1.1× 304 0.8× 151 2.1k
Satrajit Chatterjee United States 20 894 0.5× 1.0k 0.6× 560 0.3× 251 0.3× 132 0.3× 46 1.6k
Ellen Sentovich United States 15 1.6k 0.9× 2.3k 1.4× 825 0.5× 215 0.2× 181 0.5× 35 3.0k
Pei-Hsin Ho United States 14 363 0.2× 541 0.3× 1.0k 0.6× 278 0.3× 490 1.3× 32 1.5k
Jordi Cortadella Spain 26 1.8k 1.0× 2.2k 1.3× 1.1k 0.6× 190 0.2× 150 0.4× 206 3.2k
T. Sasao Japan 19 492 0.3× 520 0.3× 737 0.5× 328 0.4× 155 0.4× 89 1.2k
Akers United States 6 470 0.3× 436 0.3× 586 0.4× 289 0.3× 301 0.8× 8 1.3k

Countries citing papers authored by Alan Mishchenko

Since Specialization
Citations

This map shows the geographic impact of Alan Mishchenko'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 Alan Mishchenko with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Alan Mishchenko more than expected).

Fields of papers citing papers by Alan Mishchenko

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Alan Mishchenko. 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 Alan Mishchenko. The network helps show where Alan Mishchenko may publish in the future.

Co-authorship network of co-authors of Alan Mishchenko

This figure shows the co-authorship network connecting the top 25 collaborators of Alan Mishchenko. A scholar is included among the top collaborators of Alan Mishchenko 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 Alan Mishchenko. Alan Mishchenko 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). An Enhanced Resubstitution Algorithm for Area-Oriented Logic Optimization. 1–5. 2 indexed citations
3.
Riener, Heinz, et al.. (2020). Three-Input Gates for Logic Synthesis. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 40(10). 2184–2188. 10 indexed citations
4.
Soeken, Mathias, et al.. (2019). Scaling-up ESOP Synthesis for Quantum Compilation. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 13–18. 6 indexed citations
5.
Yu, Cunxi, Maciej Ciesielski, & Alan Mishchenko. (2017). Fast Algebraic Rewriting Based on And-Inverter Graphs. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 37(9). 1907–1911. 38 indexed citations
6.
Balabanov, Valeriy, Jie-Hong R. Jiang, Alan Mishchenko, & Christoph Scholl. (2016). Clauses Versus Gates in CEGAR-Based 2QBF Solving.. National Conference on Artificial Intelligence. 2 indexed citations
7.
Reis, André I., et al.. (2015). Threshold Logic Synthesis Based on Cut Pruning. International Conference on Computer Aided Design. 494–499. 12 indexed citations
8.
Mishchenko, Alan, et al.. (2013). A semi-canonical form for sequential AIGs. Design, Automation, and Test in Europe. 797–802. 3 indexed citations
9.
Ray, Sayak, et al.. (2012). Mapping into LUT structures. Design, Automation, and Test in Europe. 1579–1584. 16 indexed citations
10.
Strukov, Dmitri B. & Alan Mishchenko. (2010). Monolithically stackable hybrid FPGA. Design, Automation, and Test in Europe. 661–666. 14 indexed citations
11.
Eén, Niklas, Alan Mishchenko, & Nina Amla. (2010). A single-instance incremental SAT formulation of proof- and counterexample-based abstraction. 181–188. 21 indexed citations
12.
Baumgartner, Jason, et al.. (2009). Speculative reduction-based scalable redundancy identification. Design, Automation, and Test in Europe. 1674–1679. 11 indexed citations
13.
Mishchenko, Alan, Robert K. Brayton, & Satrajit Chatterjee. (2008). Boolean factoring and decomposition of logic networks. International Conference on Computer Aided Design. 38–44. 25 indexed citations
14.
Mishchenko, Alan, et al.. (2008). Scalable and scalably-verifiable sequential synthesis. International Conference on Computer Aided Design. 234–241. 28 indexed citations
15.
Mishchenko, Alan, Sungmin Cho, Satrajit Chatterjee, & Robert K. Brayton. (2007). Combinational and sequential mapping with priority cuts. Digest of technical papers/Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design. 354–361. 81 indexed citations
16.
Jiang, Jie-Hong R., et al.. (2007). Scalable exploration of functional dependency by interpolation and incremental SAT solving. International Conference on Computer Aided Design. 227–233. 34 indexed citations
17.
Mishchenko, Alan, et al.. (2007). Automated Extraction of Inductive Invariants to Aid Model Checking. 165–172. 6 indexed citations
18.
Mishchenko, Alan, Sungmin Cho, Satrajit Chatterjee, & Robert K. Brayton. (2007). Combinational and sequential mapping with priority cuts. International Conference on Computer Aided Design. 354–361. 92 indexed citations
19.
Mishchenko, Alan & Robert K. Brayton. (2003). A Theory of Non-Deterministic Networks. International Conference on Computer Aided Design. 709–716. 3 indexed citations
20.
Mishchenko, Alan & Tsutomu Sasao. (2002). Logic Synthesis of LUT Cascades with Limited Rails : A Direct Implementation of Multi-Output Functions. 102(479). 103–108. 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