Results 61 to 70 of about 239 (84)
Secure Function Evaluation with Ordered Binary Decision Diagrams [PDF]
, 2006 Privacy-preserving protocols allow multiple parties with private inputs to perform joint computation while preserving the privacy of their respective inputs.
Somesh Jha, et al., Louis Kruger
core
Binary Decision Diagrams and the Multiple Variable Order Problem [PDF]
Ordered Binary Decision Diagrams (OBDDs) are the first choice in manipulating and representing Boolean functions in CAD. Since the size of an OBDD heavily depends on the chosen variable order, much effort is spent in finding good and improving existing ...
Gianpiero Cabodi +5 more
core
Some of the next articles are maybe not open access.
OBDDs — Ordered Binary Decision Diagrams
1998In this chapter, we introduce the representation type of ordered binary decision diagrams, called OBDDs for short. Although the underlying model of decision diagrams (or synonymously branching programs) was already studied by Lee and Akers in the 1950s and 1970s, these representations have not been used in serious applications for a long time. In 1986,
Christoph Meinel, Thorsten Theobald
openaire +3 more sources
Formal Methods in System Design, 1996
We present a data structure for Boolean manipulation-the Mod-2-OBDDs-that considerably extends ESOPs (EXOR-sum-of-products) as well as OBDDs (ordered binary decision diagrams). There are Boolean functions of practical interest which have exponential size optimal ESOPs (even multilevel EXOR-expressions) and/or OBDDs that can be represented by (low ...
Gergov, J., Meinel, C.
openaire +4 more sources
We present a data structure for Boolean manipulation-the Mod-2-OBDDs-that considerably extends ESOPs (EXOR-sum-of-products) as well as OBDDs (ordered binary decision diagrams). There are Boolean functions of practical interest which have exponential size optimal ESOPs (even multilevel EXOR-expressions) and/or OBDDs that can be represented by (low ...
Gergov, J., Meinel, C.
openaire +4 more sources
Ordered binary decision diagrams as knowledge-bases [PDF]
Artificial Intelligence, 2002 We consider the use of ordered binary decision diagrams (OBDDs) as a means of realizing knowledge-bases, and show that, from the view point of space requirement, the OBDD-based representation is more efficient and suitable in some cases, compared with ...
Takashi Horiyama
exaly +2 more sources
An efficient query learning algorithm for ordered binary decision diagrams [PDF]
Information and Computation, 2005 In this paper, we propose a new algorithm that exactly learns ordered binary decision diagrams (OBDDs) with a given variable ordering via equivalence and membership queries.
Atsuyoshi Nakamura
exaly +2 more sources
Ordered binary decision diagrams and the Shannon effect [PDF]
Discrete Applied Mathematics, 2004 We investigate the size and structure of ordered binary decision diagrams (OBDDs) for random Boolean functions. It was known that for most values of n, the expected OBDD size of a random Boolean function with n variables is equal to the worst-case size ...
Hans Jürgen Promel, Anand Srivastav
exaly +2 more sources
On the descriptive and algorithmic power of parity ordered binary decision diagrams [PDF]
Lecture Notes in Computer Science, 1997 We present a data structure for Boolean functions, which we call Parity--OBDDs or \Phi-- OBDDs, which combines the nice algorithmic properties of the well--known ordered binary decision diagrams (OBDDs) with a considerably larger descriptive power ...
Stephan Waack
exaly +1 more source
Proceedings of EURO-DAC. European Design Automation Conference, 2002
Theodore Karoubalis +2 more
openaire +1 more source
Theodore Karoubalis +2 more
openaire +1 more source