2026 Randal E. Bryant: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	56	3972	3860	1889	1822	194	19210

Research.com Recognitions

2010 - Fellow of the American Academy of Arts and Sciences
2003 - Member of the National Academy of Engineering For contributions to symbolic simulation and logic verification.
2000 - ACM Fellow Randal Bryant is best known for Ordered Binary Decision Diagrams, a canonical form for boolean functions. Although originally developed for applications in CAD, this data structure has found many applications in areas such as hardware and software verification, automated theorem proving, and AI planning.
1998 - ACM Paris Kanellakis Theory and Practice Award Symbolic Model Checking
1990 - IEEE Fellow For contributions to switch-level modeling of very-large-scale integrated circuits.

Overview

Randal E. Bryant is affiliated with Carnegie Mellon University in the United States. Their research primarily spans across the field of Computer Science, with a focus on several subfields including Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications, Software, and Electrical and Electronic Engineering.

The scientist's work encompasses multiple main topics:

Formal Methods in Verification
Logic, programming, and type systems
Logic, Reasoning, and Knowledge
Constraint Satisfaction and Optimization
Software Testing and Debugging Techniques
Advanced Database Systems and Queries
Semantic Web and Ontologies

Randal E. Bryant has contributed research papers to various publication venues, including:

arXiv (Cornell University)
Journal of Automated Reasoning
Proceedings of the IEEE
ACM Transactions on Computational Logic
Journal of Artificial Intelligence Research

Some recent papers authored or co-authored by Bryant include:

"Nonsilicon, Non-von Neumann Computing-Part II," 2020, Proceedings of the IEEE
"Chain Reduction for Binary and Zero-Suppressed Decision Diagrams," 2020, Journal of Automated Reasoning
"Proof Generation for CDCL Solvers Using Gauss-Jordan Elimination," 2023, arXiv (Cornell University)
"Generating Extended Resolution Proofs with a BDD-Based SAT Solver," 2023, ACM Transactions on Computational Logic
"From Data to Knowledge to Action: Enabling the Smart Grid," 2020, arXiv (Cornell University)

The scientist has collaborated frequently with co-authors such as Marijn J. H. Heule, Joseph E. Reeves, Jeremy Avigad, Armin Biere, and Sankar Basu.

Randal E. Bryant's career includes recognition with multiple awards:

Fellow of the American Academy of Arts and Sciences (2010)
Member of the National Academy of Engineering (2003) for contributions to symbolic simulation and logic verification
ACM Fellow (2000) for work on Ordered Binary Decision Diagrams
ACM Paris Kanellakis Theory and Practice Award (1998) for Symbolic Model Checking
IEEE Fellow (1990) for contributions to switch-level modeling of very-large-scale integrated circuits

Best Publications

Symbolic Boolean manipulation with ordered binary-decision diagrams

Randal E. Bryant

3226
Citations
Efficient implementation of a BDD package

Karl S. Brace;Richard L. Rudell;Randal E. Bryant

1649
Citations
Semantics-aware malware detection

M. Christodorescu;S. Jha;S.A. Seshia;D. Song

1128
Citations
On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication

R.E. Bryant

790
Citations
Computer Systems: A Programmer's Perspective

Randal E. Bryant;David R. O'Hallaron

758
Citations
Verification of Arithmetic Circuits with Binary Moment Diagrams

Randal E. Bryant;Yirng-An Chen

656
Citations
SIMULATION OF PACKET COMMUNICATION ARCHITECTURE COMPUTER SYSTEMS

R. E. Bryant

519
Citations
Formal verification by symbolic evaluation of partially-ordered trajectories

Carl-Johan H. Seger;Randal E. Bryant

387
Citations
Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors

Miroslav N. Velev;Randal E. Bryant

374
Citations
Simulator for MOS Circuits

R.E. Bryant;D. Beatty;K. Brace;Kyeongsoon Cho

369
Citations
Binary decision diagrams and beyond: enabling technologies for formal verification

Randal E. Bryant

360
Citations
COSMOS: a compiled simulator for MOS circuits

R. E. Bryant;D. Beatty;K. Brace;K. Cho

343
Citations
Modeling and verifying systems using a logic of Counter arithmetic with Lambda Expressions and Uninterpreted Functions

Randal E. Bryant;Shuvendu K. Lahiri;Sanjit A. Seshia

335
Citations
Boolean Analysis of MOS Circuits

R.E. Bryant

264
Citations
Data-Intensive Supercomputing: The case for DISC

Randal E. Bryant

243
Citations
Symbolic Manipulation of Boolean Functions Using a Graphical Representation

Randal E. Bryant

188
Citations
Deciding bit-vector arithmetic with abstraction

Randal E. Bryant;Daniel Kroening;Joël Ouaknine;Sanjit A. Seshia

187
Citations
Formally Verifying a Microprocessor Using a Simulation Methodology

Derek L. Beatty;Randal E. Bryant

170
Citations
Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic

Randal E. Bryant;Steven German;Miroslav N. Velev

170
Citations
Formal hardware verification by symbolic ternary trajectory evaluation

R.E. Bryant;C.-J.H. Seger;D.L. Beatty

158
Citations

Frequent Co-Authors

Sanjit A. Seshia University of California, Berkeley

Shuvendu K. Lahiri Microsoft (United States)

David R. O'Hallaron Carnegie Mellon University

Manuela Veloso Carnegie Mellon University

Ofer Strichman Technion – Israel Institute of Technology

Somesh Jha University of Wisconsin–Madison

Orna Grumberg Technion – Israel Institute of Technology

Rob A. Rutenbar University of Pittsburgh

Joël Ouaknine Max Planck Institute for Software Systems

Thomas Reps University of Wisconsin–Madison

External Links

Wikipedia of Randal E. Bryant Personal website of Randal E. Bryant Google Scholar page

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

Related Online Degrees & Career Pathways

Pursuing a Computer Science degree in the USA opens doors to a variety of related fields and flexible learning options. Many students looking for quick entry into the tech workforce consider enrolling in the fastest computer science degree programs available online. These accelerated options enable you to earn your degree faster and start your career sooner.

If your interests extend beyond computer science, online education offers affordable pathways in related STEM fields. For those passionate about sustainability and technology, the online environmental engineering degree delivers specialized skills for careers that address environmental challenges.

Engineering remains a popular choice, but cost is often a concern. Exploring the mechanical engineering degree cost can help you find affordable programs without compromising on quality or career prospects.

For students interested in research, teaching, or advanced technology roles, the best online physics degree programs provide foundational knowledge and versatile career opportunities.

By comparing options across these disciplines, you can choose the pathway that best aligns with your career goals, budget, and learning preferences.