Binary decision diagram

Known as: Binary Decision Diagrams, Branching program, Branching programs 
In computer science, a binary decision diagram (BDD) or branching program is a data structure that is used to represent a Boolean function. On a more… (More)
Wikipedia

Related topics

Related topics

47 relations
And-inverter graphAutomated theorem provingBinary moment diagramBoolean satisfiability problem
(More)

Broader (2)

Boolean algebraModel checking

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2009
Review
2009
Binary Decision Diagram (BDD)
the primary aim of computer science is invention of new data structures and algorithms. Those data structures and algorithms… (More)
  • figure 2
  • figure 1
  • figure 5
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
K-Terminal Network Reliability Measures With Binary Decision Diagrams
We present a network decomposition method using binary decision diagrams (BDD), a state-of-the-art data structure to encode, and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
This paper presents the first scalable context-sensitive, inclusion-based pointer alias analysis for Java programs. Our approach… (More)
Is this relevant?
2001
2001
Binary decision diagram with minimum expected path length
We present methods to generate a Binary Decision Diagram (BDD) with minimum expected path length. A BDD is a generic data… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Dynamic variable ordering for ordered binary decision diagrams
The Ordered Binary Decision Diagram OBDI)) has A proven useful in many applications as an e cient data structure for reprtxenting… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Interleaving based variable ordering methods for ordered binary decision diagrams
Ordered binary decision diagrams ( OBDDS ) are efficient representations of Boolean functions and have been widely used in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Minimazation of Binary Decision Diagrams Based on Exchanges of Variables
We ropose in this paper a new exact algorithm and gr aduay improvement methods of minimizing binary decision diagrams (BDD’s). In… (More)
  • table 1
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Shared Binary Decision Diagram with Attributed Edges for Efficient Boolean function Manipulation
The efficiency of Boolean function manipulation depends on the form of representation of Boolean functions. Binary Decision… (More)
  • figure 3
  • figure 7
  • figure 9
  • table 2
  • table 4
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Finding the Optimal Variable Ordering for Binary Decision Diagrams
The ordered binary decision diagram is a canonical representation for Boolean functions, presented by Bryant as a compact… (More)
  • figure 2
Is this relevant?
Highly Cited
1978
Highly Cited
1978
Binary Decision Diagrams
This paper describes a method for defining, analyzing, testing, and implementing large digital functions by means of a binary… (More)
  • figure 1
  • figure 7
  • figure 8
  • figure 6
  • figure 9
Is this relevant?