World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
33
Citations
6861
World Ranking
12453
National Ranking
5049

Overview

Alan Mishchenko is affiliated with the University of California, Berkeley in the United States. Their research contributions span several fields within computer science and engineering, concentrating primarily on areas related to logic synthesis, verification, and integrated circuit design.

The main fields of study for Mishchenko include:

  • Computer Science
  • Engineering

The subfields of their research cover a variety of specialized topics, such as:

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Computational Theory and Mathematics
  • Artificial Intelligence
  • Computer Networks and Communications

Mishchenko's work addresses several core topics, including:

  • Formal Methods in Verification
  • VLSI and Analog Circuit Testing
  • VLSI and FPGA Design Techniques
  • Embedded Systems Design Techniques
  • Radiation Effects in Electronics
  • Low-power High-performance VLSI Design
  • Logic, Programming, and Type Systems

The scientist has published extensively, with frequent contributions to notable venues such as:

  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • arXiv (Cornell University)
  • 2022 27th Asia and South Pacific Design Automation Conference (ASP-DAC)
  • 2021 IEEE/ACM International Conference On Computer Aided Design (ICCAD)
  • IEEE Transactions on Computers

Selected recent papers by Alan Mishchenko reflect their focus on logic synthesis and circuit design methodologies. These include:

  • "DAG-Aware Synthesis Orchestration," 2024, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • "Boolean Rewriting Strikes Back: Reconvergence-Driven Windowing Meets Resynthesis," 2022, 2022 27th Asia and South Pacific Design Automation Conference (ASP-DAC)
  • "A Simulation-Guided Paradigm for Logic Synthesis and Verification," 2021, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • "A Circuit-Based SAT Solver for Logic Synthesis," 2021, 2021 IEEE/ACM International Conference On Computer Aided Design (ICCAD)
  • "Three-Input Gates for Logic Synthesis," 2020, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

The scientist frequently collaborates with peers including:

  • Giovanni De Micheli
  • Heinz Riener
  • Robert K. Brayton
  • Eleonora Testa
  • Luca Amarù

Best Publications

  • ABC: an academic industrial-strength verification tool

    Robert Brayton;Alan Mishchenko

  • DAG-aware AIG rewriting a fresh look at combinational logic synthesis

    Alan Mishchenko;Satrajit Chatterjee;Robert Brayton

  • Efficient implementation of property directed reachability

    Niklas Een;Alan Mishchenko;Robert Brayton

  • Reducing Structural Bias in Technology Mapping

    S. Chatterjee;A. Mishchenko;R.K. Brayton;Xinning Wang

  • Improvements to Technology Mapping for LUT-Based FPGAs

    A. Mishchenko;S. Chatterjee;R.K. Brayton

  • A General Decomposition for Reversible Logic

    Marek Perkowski;Lech Jozwiak;Pawel Kerntopf;Alan Mishchenko

  • Fast Heuristic Minimization of Exclusive-Sums-of-Products

    Alan Mishchenko;Marek Perkowski

  • Logic synthesis of reversible wave cascades

    Alan Mishchenko;Marek A. Perkowski

  • Scalable don't-care-based logic optimization and resynthesis

    Alan Mishchenko;Robert Brayton;Jie-Hong R. Jiang;Stephen Jang

  • Improvements to combinational equivalence checking

    Alan Mishchenko;Satrajit Chatterjee;Robert Brayton;Niklas Een

  • Combinational and sequential mapping with priority cuts

    Alan Mishchenko;Sungmin Cho;Satrajit Chatterjee;Robert Brayton

  • FRAIGs: A Unifying Representation for Logic Synthesis and Verification

    Alan Mishchenko;Satrajit Chatterjee;Roland Jiang;Robert Brayton

  • An algorithm for bi-decomposition of logic functions

    Alan Mishchenko;Bernd Steinbach;Marek Perkowski

  • SAT-Based Complete Don't-Care Computation for Network Optimization

    Alan Mishchenko;Robert K. Brayton

  • Applying logic synthesis for speeding up SAT

    Niklas Een;Alan Mishchenko;Niklas Sörensson

  • Scalable Logic Synthesis using a Simple Circuit Structure

    Alan Mishchenko;Robert Brayton

  • Improvements to Combinational Equivalence Checking

    Unknown

  • Regularity and Symmetry as a Base for Efficient Realization of Reversible Logic Circuits

    Marek Perkowski;Pawel Kerntopf;Andrzej Buller;Malgorzata Chrzanowska-Jeske

  • Using simulation and satisfiability to compute flexibilities in Boolean networks

    A. Mishchenko;J.S. Zhang;S. Sinha;J.R. Burch

  • A new-enhanced constructive decomposition and mapping algorithm

    Alan Mishchenko;Xinning Wang;Timothy Kam

  • Scalable exploration of functional dependency by interpolation and incremental SAT solving

    Chih-Chun Lee;Jie-Hong R. Jiang;Chung-Yang (Ric) Huang;Alan Mishchenko

  • Automated Synthesis of Generalized Reversible Cascades using Genetic Algorithms

    Martin Lukac;Mikhail Pivtoraiko;Alan Mishchenko;Marek Perkowski

Frequent Co-Authors

Robert K. Brayton
Robert K. Brayton University of California, Berkeley
Alexandre Petrenko
Alexandre Petrenko Computer Research Institute of Montréal
Marek Perkowski
Marek Perkowski Portland State University
Alberto Sangiovanni-Vincentelli
Alberto Sangiovanni-Vincentelli University of California, Berkeley
Xiaoyu Song
Xiaoyu Song Portland State University
Tsutomu Sasao
Tsutomu Sasao Meiji University
Paolo Ienne
Paolo Ienne École Polytechnique Fédérale de Lausanne
Pierre-Emmanuel Gaillardon
Pierre-Emmanuel Gaillardon University of Utah
Jaijeet Roychowdhury
Jaijeet Roychowdhury University of California, Berkeley
David Z. Pan
David Z. Pan The University of Texas at Austin

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online degrees related to Computer Science can open up diverse and rewarding career pathways. Many students choose interdisciplinary options, such as an environmental engineering bachelor's degree online, which combines technical skills with real-world impact on sustainability.

Cost is a significant factor when choosing a degree. Prospective engineers, for example, often consider the mechanical engineering cost of education before enrolling in an online program. Flexible and affordable options make it easier to enter high-demand STEM fields.

For those with an interest in the laws of nature and advanced analytics, pursuing an online physics bachelor's degree can provide a solid foundation in scientific problem-solving and data analysis. This can be a strong complement to computer science skills.

With the growing importance of data-driven decision making in industries, data science degrees are increasingly popular among computer science students. These programs often emphasize practical skills in statistics, programming, and machine learning for robust career prospects.

Best Scientists Citing Alan Mishchenko

Trending Scientists

Recently Published Articles