- Home
- Top Scientists - Computer Science
- Randal E. Bryant

Discipline name
H-index
Citations
Publications
World Ranking
National Ranking

Computer Science
H-index
50
Citations
15,552
142
World Ranking
2880
National Ranking
1524

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.

- Programming language
- Operating system
- Algorithm

Randal E. Bryant spends much of his time researching Theoretical computer science, Formal verification, Binary decision diagram, Data structure and Boolean function. The Theoretical computer science study combines topics in areas such as Boolean expression and And-inverter graph. His Formal verification research incorporates themes from Parallel computing, Correctness, Bounded function and Symbolic trajectory evaluation.

The various areas that Randal E. Bryant examines in his Binary decision diagram study include Combinational logic and Boolean data type. His Data structure research is multidisciplinary, incorporating perspectives in Graph and Simulation. His Boolean function research is multidisciplinary, incorporating elements of Canonical form and Symbolic computation.

- Symbolic Boolean manipulation with ordered binary-decision diagrams (1773 citations)
- Efficient implementation of a BDD package (1037 citations)
- Semantics-aware malware detection (643 citations)

His primary areas of investigation include Theoretical computer science, Formal verification, Binary decision diagram, Boolean function and Boolean satisfiability problem. His Theoretical computer science study integrates concerns from other disciplines, such as Boolean expression and And-inverter graph. His Boolean expression research includes themes of Boolean circuit and Symbolic data analysis.

Randal E. Bryant has researched Formal verification in several fields, including Parallel computing, Correctness, Formal methods and Symbolic trajectory evaluation. His Binary decision diagram study is concerned with the larger field of Algorithm. In his study, Graph is inextricably linked to Data structure, which falls within the broad field of Boolean function.

- Theoretical computer science (30.29%)
- Formal verification (28.85%)
- Binary decision diagram (22.12%)

- Boolean satisfiability problem (19.23%)
- Theoretical computer science (30.29%)
- Binary decision diagram (22.12%)

His scientific interests lie mostly in Boolean satisfiability problem, Theoretical computer science, Binary decision diagram, Model checking and Formal verification. Randal E. Bryant focuses mostly in the field of Boolean satisfiability problem, narrowing it down to matters related to Boolean data type and, in some cases, Unsatisfiable core, Propositional calculus, Uclid and True quantified Boolean formula. His Theoretical computer science research incorporates elements of Directed acyclic graph, Data structure and Scaling.

His Binary decision diagram study combines topics in areas such as Standard Boolean model, Boolean expression, Boolean function, And-inverter graph and Function. The concepts of his Function study are interwoven with issues in Algorithm and Set. His Formal verification study is focused on Programming language in general.

- Data-Intensive Supercomputing: The case for DISC (164 citations)
- Deciding bit-vector arithmetic with abstraction (115 citations)
- Parrot: a practical runtime for deterministic, stable, and reliable threads (73 citations)

- Programming language
- Operating system
- Algorithm

Randal E. Bryant mainly focuses on Boolean satisfiability problem, Theoretical computer science, Model checking, Bit array and Propositional calculus. Randal E. Bryant combines subjects such as Polyhedron, Combinatorics and Rounding with his study of Boolean satisfiability problem. Randal E. Bryant works mostly in the field of Theoretical computer science, limiting it down to topics relating to Programming language and, in certain cases, State variable.

His studies deal with areas such as Low overhead, Thread and Parallel computing as well as Model checking. His research in Propositional calculus intersects with topics in Satisfiability and Data type. His Binary decision diagram research includes elements of Directed acyclic graph, Data structure, Scaling and Boolean function.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Symbolic Boolean manipulation with ordered binary-decision diagrams

Randal E. Bryant.

ACM Computing Surveys **(1992)**

3024 Citations

Efficient implementation of a BDD package

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

design automation conference **(1990)**

1655 Citations

Semantics-aware malware detection

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

ieee symposium on security and privacy **(2005)**

975 Citations

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

R.E. Bryant.

IEEE Transactions on Computers **(1991)**

732 Citations

Computer Systems: A Programmer's Perspective

Randal E. Bryant;David R. O'Hallaron.

**(1991)**

682 Citations

Verification of Arithmetic Circuits with Binary Moment Diagrams

Randal E. Bryant;Yirng-An Chen.

design automation conference **(1995)**

622 Citations

SIMULATION OF PACKET COMMUNICATION ARCHITECTURE COMPUTER SYSTEMS

R. E. Bryant.

**(1977)**

485 Citations

Formal verification by symbolic evaluation of partially-ordered trajectories

Carl-Johan H. Seger;Randal E. Bryant.

formal methods **(1995)**

368 Citations

Simulator for MOS Circuits

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

design automation conference **(1987)**

355 Citations

Binary decision diagrams and beyond: enabling technologies for formal verification

Randal E. Bryant.

international conference on computer aided design **(1995)**

348 Citations

Profile was last updated on December 6th, 2021.

Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).

The ranking h-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us

University of California, Berkeley

Microsoft (United States)

Carnegie Mellon University

Carnegie Mellon University

Technion – Israel Institute of Technology

University of Pittsburgh

Technion – Israel Institute of Technology

University of Wisconsin–Madison

University of California, Berkeley

Amazon (United States)

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:

Something went wrong. Please try again later.