World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
86
Citations
31266
World Ranking
769
National Ranking
411

Electronics and Electrical Engineering

D-Index
80
Citations
26895
World Ranking
523
National Ranking
240

Research.com Recognitions

  • 2006 - ACM Paris Kanellakis Theory and Practice Award For leading the development and practical realization of algorithms for logic synthesis and for electronic system simulation, thereby helping to create key enabling technologies for the Electronic Design Automation industry.
  • 1993 - Member of the National Academy of Engineering For contributions to the theory and practice of computer-aided analysis and design of electrical and logical circuits and systems.
  • 1981 - IEEE Fellow For pioneering work in the theory of nonlinear networks, stability theory, and sparse matrix techniques.

Overview

Robert K. Brayton was affiliated with the University of California, Berkeley in the United States. Throughout their career, their research focused primarily on computer science with a concentration in hardware and architecture, computational theory and mathematics, electrical and electronic engineering, and mechanical engineering.

Their work encompassed several key topics, including formal methods in verification, VLSI and analog circuit testing, embedded systems design techniques, VLSI and FPGA design techniques, and modular robots and swarm intelligence.

The scientist contributed to notable publications in venues such as:

  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • arXiv (Cornell University)

Recent papers associated with their research include:

  • "A Simulation-Guided Paradigm for Logic Synthesis and Verification" (2021), published in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • "Enhancing Delay-Driven LUT Mapping With Boolean Decomposition" (2024), published in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • "Simulation-Guided Boolean Resubstitution" (2020), published on arXiv (Cornell University)
  • "Practical Boolean Decomposition for Delay-driven LUT Mapping" (2024), published on arXiv (Cornell University)

Frequent collaborators included:

  • Alan Mishchenko
  • Giovanni De Micheli
  • Siang-Yun Lee
  • Heinz Riener
  • Alessandro Tempia Calvino

Brayton's work was recognized with several awards during their career. They received the ACM Paris Kanellakis Theory and Practice Award in 2006 for contributions to the development and application of algorithms related to logic synthesis and electronic system simulation. They were also elected as a member of the National Academy of Engineering in 1993 for their work in computer-aided analysis and design of electrical and logical circuits and systems. Earlier, in 1981, they were named an IEEE Fellow for pioneering research in nonlinear network theory, stability theory, and sparse matrix techniques.

Best Publications

  • Logic Minimization Algorithms for VLSI Synthesis

    Robert King Brayton;Alberto L. Sangiovanni-Vincentelli;Curtis T. McMullen;Gary D. Hachtel

  • MIS: A Multiple-Level Logic Optimization System

    R.K. Brayton;R. Rudell;A. Sangiovanni-Vincentelli;A.R. Wang

  • ABC: an academic industrial-strength verification tool

    Robert Brayton;Alan Mishchenko

  • VIS: A System for Verification and Synthesis

    Robert K. Brayton;Gary D. Hachtel;Alberto L. Sangiovanni-Vincentelli;Fabio Somenzi

  • Logic verification using binary decision diagrams in a logic synthesis environment

    S. Malik;A.R. Wang;R.K. Brayton;A. Sangiovanni-Vincentelli

  • Sequential circuit design using synthesis and optimization

    E.M. Sentovich;K.J. Singh;C. Moon;H. Savoj

  • Multilevel logic synthesis

    R.K. Brayton;G.D. Hachtel;A.L. Sangiovanni-Vincentelli

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

    Alan Mishchenko;Satrajit Chatterjee;Robert Brayton

  • Model-checking continuous-time Markov chains

    Adnan Aziz;Kumud Sanwal;Vigyan Singhal;Robert Brayton

  • Implicit state enumeration of finite state machines using BDD's

    H.J. Touati;H. Savoj;B. Lin;R.K. Brayton

  • Verifying Continuous Time Markov Chains

    Adnan Aziz;Kumud Sanwal;Vigyan Singhal;Robert K. Brayton

  • Optimal State Assignment for Finite State Machines

    G. De Micheli;R.K. Brayton;A. Sangiovanni-Vincentelli

  • Combinational test generation using satisfiability

    P. Stephan;R.K. Brayton;A.L. Sangiovanni-Vincentelli

  • The Sparse Tableau Approach to Network Analysis and Design

    G. Hachtel;R. Brayton;F. Gustavson

  • Planning for performance

    Ralph H. J. M. Otten;Robert K. Brayton

  • Algorithms for discrete function manipulation

    A. Srinivasan;T. Ham;S. Malik;R.K. Brayton

  • A survey of optimization techniques for integrated-circuit design

    R.K. Brayton;G.D. Hachtel;A.L. Sangiovanni-Vincentelli

  • Efficient implementation of property directed reachability

    Niklas Een;Alan Mishchenko;Robert Brayton

  • Multi-level logic minimization using implicit don't cares

    K.A. Bartlett;R.K. Brayton;G.D. Hachtel;R.M. Jacoby

  • A new efficient algorithm for solving differential-algebraic systems using implicit backward differentiation formulas

    R.K. Brayton;F.G. Gustavson;G.D. Hachtel

  • Retiming and resynthesis: optimizing sequential networks with combinational techniques

    S. Malik;E.M. Sentovich;R.K. Brayton;A. Sangiovanni-Vincentelli

Frequent Co-Authors

Alberto Sangiovanni-Vincentelli
Alberto Sangiovanni-Vincentelli University of California, Berkeley
Alan Mishchenko
Alan Mishchenko University of California, Berkeley
Alexandre Petrenko
Alexandre Petrenko Computer Research Institute of Montréal
Sharad Malik
Sharad Malik Princeton University
Gary D. Hachtel
Gary D. Hachtel University of Colorado Boulder
Shaz Qadeer
Shaz Qadeer Microsoft (United States)
Luca P. Carloni
Luca P. Carloni Columbia University
A.R. Newton
A.R. Newton University of California, Berkeley
Fabio Somenzi
Fabio Somenzi University of Colorado Boulder
Luciano Lavagno
Luciano Lavagno Polytechnic University of Turin

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 can open doors to a wide range of tech-focused careers, especially for those considering studying Computer Science in the USA. Cost is a key consideration, and many students begin their journey by searching for the cheapest online bachelors degree programs, providing an accessible entry point into the field.

For those interested in a broader STEM background, online engineering programs offer flexible routes to specialized careers in areas like software, electrical, or mechanical engineering. Mid-career professionals eyeing leadership roles within tech companies may consider advanced paths, such as executive mba programs online, to develop essential management skills while still working.

Finally, for those with a passion for information science, the most affordable online mlis programs provide training in data organization, curation, and archival, which are valuable in many tech and research roles. Choosing the right online degree can shape your career opportunities and help you achieve your long-term goals in the dynamic field of computer science.

Best Scientists Citing Robert K. Brayton

Recently Published Articles