Binary Decision Diagrams is a type of directed acyclic graph used in computer science that represents a Boolean function, distinguished by its compact, canonical form achieved through the elimination of redundant nodes and the enforcement of variable ordering.
948
Publications
49.6K
Citations
1.6K
Authors
536
Institutions
Publications per year
2017–2026
106
Variants
Bdds
Parents
Publications
948
Akers · IEEE Transactions on Computers · 1978 · 1.8K citations
Efficient implementation of a BDD package
Karl S. Brace, Richard Rudell, Randal E. Bryant · 1990 · 1.1K citations · Full text
1–5 of 948
Authors
1.6K
- RD
25
h-index
- LX
19
h-index
- JA
17
h-index
- JD
17
h-index
- RK
15
h-index
1–5 of 1.6K
Institutions
536
Carnegie Mellon University
Pittsburgh, United States
28 h-index
96 publications
13.6K citations
University of California, Berkeley
Berkeley, United States
22 h-index
85 publications
7.6K citations
University of Massachusetts Dartmouth
North Dartmouth, United States
19 h-index
44 publications
2.3K citations
Hokkaido University
Sapporo, Japan
17 h-index
49 publications
1.5K citations
Loughborough University
Loughborough, United Kingdom
17 h-index
36 publications
2K citations
University of Bremen
Bremen, Germany
17 h-index
65 publications
2.5K citations
The University of Texas at Austin
Austin, United States
16 h-index
67 publications
1.6K citations
University of Virginia
Charlottesville, United States
16 h-index
31 publications
2.5K citations
1–8 of 536
Venues
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
61 publications · 3.5K citations
33
h-index
- IEEE Transactions on Computers
32 publications · 4.2K citations
21
h-index
- IEEE Transactions on Reliability
25 publications · 2.1K citations
21
h-index
- Reliability Engineering & System Safety
16 publications · 717 citations
16
h-index
- Quality and Reliability Engineering International
14 publications · 445 citations
13
h-index
1–5