Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
The complexity of Boolean functions
The complexity of Boolean functions
The complexity of finite functions
Handbook of theoretical computer science (vol. A)
The computational complexity of universal hashing
Theoretical Computer Science - Special issue on structure in complexity theory
Graph driven BDDs—a new data structure for Boolean functions
Theoretical Computer Science
On lower bounds for read-k-times branching programs
Computational Complexity
Restricted branching programs and hardware verification
Restricted branching programs and hardware verification
Communication complexity
Efficient Boolean Manipulation with OBDD's Can be Extended to FBDD's
IEEE Transactions on Computers
On the Power of Randomized Branching Programs
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Time Space Tradeoffs (Getting Closer to the Barrier?)
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Lower Bounds for Randomized Read-k-Times Branching Programs (Extended Abstract)
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
On the Hierarchy of Nondeterministic Branching k-Programs
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
Randomness versus Nondeterminism for Read-Once and Read- k Branching Programs
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Randomized Complexity of Linear Arrangements and Polyhedra
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Separating Oblivious and Non-oblivious BPs
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
A Non-Linear Time Lower Bound for Boolean Branching Programs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Approximation of boolean functions by combinatorial rectangles
Theoretical Computer Science
Comparing the sizes of nondeterministic branching read-k-times programs
Discrete Applied Mathematics
Information Processing Letters
Theoretical Computer Science
Information Processing Letters
On some bounds on the size of branching programs (a survey)
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
| Hi-index | 0.00 |