Data structures and network algorithms
Data structures and network algorithms
The complexity of Boolean functions
The complexity of Boolean functions
Modified branching programs and their computational power
Modified branching programs and their computational power
Negative Results for Equivalence Queries
Machine Learning
Identifying μ-formula decision trees with queries
COLT '90 Proceedings of the third annual workshop on Computational learning theory
Learning switch configurations
COLT '90 Proceedings of the third annual workshop on Computational learning theory
Learning Boolean read-once formulas with arbitrary symmetric and constant fan-in gates
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Learning read-once formulas with queries
Journal of the ACM (JACM)
The complexity of learning formulas and decision trees that have restricted reads
The complexity of learning formulas and decision trees that have restricted reads
Machine Learning
Machine Learning
The Complexity of Equivalence and Containment for Free Single Variable Program Schemes
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
On learning width two branching programs (extended abstract)
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Reduced error pruning of branching programs cannot be approximated to within a logarithmic factor
Information Processing Letters
An efficient query learning algorithm for ordered binary decision diagrams
Information and Computation
Testing Computability by Width Two OBDDs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
An efficient query learning algorithm for ordered binary decision diagrams
Information and Computation
Lower bounds for testing computability by small width OBDDs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Testing computability by width-two OBDDs
Theoretical Computer Science
Testing computability by width-2 OBDDs where the variable order is unknown
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
| Hi-index | 0.00 |