|
2
|
Approximation of Boolean Functions by Combinatorial Rectangles
– Martin Sauerhoff
- 2000
|
|
16
|
The Nonapproximability of OBDD Minimization
– Detlef Sieling
- 1998
|
|
1
|
Ordered Binary Decision Diagrams and Their Significance in Computer-Aided Design of VLSI Circuits -- a Survey
– Christoph Meinel , Thorsten Theobald
- 1998
|
|
19
|
On the Power of Randomized Branching Programs
– Farid Ablayev , Marek Karpinski
- 1996
|
|
5
|
A Lower Bound for Integer Multiplication on Randomized Read-Once Branching Programs
– Farid Ablayev , Marek Karpinski
- 1998
|
|
11
|
An algebraic approach to communication complexity
– Pascal Tesson
- 1998
|
|
11
|
On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable Functions
– Martin Sauerhoff
- 1999
|
|
2
|
Ordered Binary Decision Diagrams In Electronic Design Automation: Foundations, Applications and Innovations
– Randal E. Bryant, Christoph Meinel
- 2002
|
|
1
|
Optimal Ordered Binary Decision Diagrams for Read-Once Formulas
– Martin Sauerhoff, Ingo Wegener, Ralph Werchner
- 1999
|
|
1
|
Shared ordered binary decision diagrams for DempsterShafer theory
– Norbert Lehmann
- 2007
|
|
6
|
Differential BDDs
– Anuchit Anuchitanukul, Zohar Manna, Tomás E. Uribe
- 1995
|
|
118
|
An Information Statistics Approach to Data Stream and Communication Complexity
– Ziv Bar-yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar
- 2003
|
|
4
|
On Nondeterminism versus Randomness for Read-Once Branching Programs
– Martin Sauerhoff
- 1997
|
|
2
|
Ordered Binary Decision Diagrams and Minimal Trellises
– John Lafferty, Alexander Vardy
- 1999
|
|
15
|
A Lower Bound for Randomized Read-k-Times Branching Programs
– Martin Sauerhoff
- 1997
|
|
42
|
Bottom-Up Induction of Oblivious Read-Once Decision Graphs
– Ron Kohavi
- 1994
|
|
35
|
Efficient Boolean Manipulation with OBDD's Can be Extended to FBDD's
– Jordan Gergov, Christoph Meinel
- 1993
|
|
|
Ordered Binary Decision Diagrams and the Shannon Effect
– Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav
|
|
|
Spatial Entropy - A Unified Attribute to Model Dynamic Communication in VLSI Circuits
– Suresh Rajgopal, Akhilesh Tyagi
- 1992
|