A lower bound for read-once-only branching programs
Journal of Computer and System Sciences
The complexity of Boolean functions
The complexity of Boolean functions
On the complexity of branching programs and decision trees for clique functions
Journal of the ACM (JACM)
Exponential lower bounds on the complexity of local and real-time branching programs
Journal of Information Processing and Cybernetics
Meanders and their applications in lower bounds arguments
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Entropy of contact circuits and lower bounds on their complexity
Theoretical Computer Science - International Symposium on Mathematical Foundations of Computer Science, Bratisl
Modified branching programs and their computational power
Modified branching programs and their computational power
Lower bounds for depth-restricted branching programs
Information and Computation
Separating the eraser Turing machine classes Le, NLe, co-NLe and Pe
Theoretical Computer Science
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
The graph of multiplication is equivalent to counting
Information Processing Letters
Reduced order LQG controllers for linear time varying plants
Systems & Control Letters
Information Processing Letters
Efficient data structures for Boolean functions
Discrete Mathematics - Special issue: trends in discrete mathematics
Graph driven BDDs—a new data structure for Boolean functions
Theoretical Computer Science
On the size of binary decision diagrams representing Boolean functions
Theoretical Computer Science
On lower bounds for read-k-times branching programs
Computational Complexity
Efficient Boolean Manipulation with OBDD's Can be Extended to FBDD's
IEEE Transactions on Computers
Boolean Satisfiability and Equivalence Checking Using General Binary Decision Diagrams
ICCD '91 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
An Exponential Lower Bound for One-Time-Only Branching Programs
Proceedings of the Mathematical Foundations of Computer Science 1984
The Complexity of Equivalence and Containment for Free Single Variable Program Schemes
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Lower bounds on the complexity of 1-time only branching programs
FCT '85 Fundamentals of Computation Theory
Verification of Arithmetic Functions with Binary Moment Diagrams
Verification of Arithmetic Functions with Binary Moment Diagrams
Binary decision diagrams and beyond: enabling technologies for formal verification
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Model checking large software specifications
SIGSOFT '96 Proceedings of the 4th ACM SIGSOFT symposium on Foundations of software engineering
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On BPP versus NP (semi-circle up) coNP for ordered read-once branching programs
Theoretical Computer Science
A lower bound for integer multiplication on randomized ordered read-once branching programs
Information and Computation
Bounds on the OBDD-size of integer multiplication via universal hashing
Journal of Computer and System Sciences
Approximating Boolean functions by OBDDs
Discrete Applied Mathematics
The complexity of classical and quantum branching programs: a communication complexity approach
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
| Hi-index | 0.00 |