A fast parallel algorithm for the maximal independent set problem
Journal of the ACM (JACM)
On generating all maximal independent sets
Information Processing Letters
Computational limitations on learning from examples
Journal of the ACM (JACM)
Learning read-once formulas with queries
Journal of the ACM (JACM)
The design of relational databases
The design of relational databases
On the complexity of inferring functional dependencies
Discrete Applied Mathematics - Special issue on combinatorial problems in databases
On the limits of proper learnability of subclasses of DNF formulas
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Learning Boolean read-once formulas over generalized bases
Journal of Computer and System Sciences
Approximate inference of functional dependencies from relations
ICDT '92 Selected papers of the fourth international conference on Database theory
Learning Arithmetic Read-Once Formulas
SIAM Journal on Computing
Read-twice DNF formulas are properly learnable
Euro-COLT '93 Proceedings of the first European conference on Computational learning theory
Identifying the Minimal Transversals of a Hypergraph and Related Problems
SIAM Journal on Computing
Complexity of identification and dualization of positive Boolean functions
Information and Computation
Exact learning Boolean functions via the monotone theory
Information and Computation
Oracles and queries that are sufficient for exact learning
Journal of Computer and System Sciences
On the complexity of dualization of monotone disjunctive normal forms
Journal of Algorithms
On Learning Read-k-Satisfy-j DNF
SIAM Journal on Computing
Complexity theoretic hardness results for query learning
Computational Complexity
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Machine Learning
Machine Learning
Translating between Horn representations and their characteristic models
Journal of Artificial Intelligence Research
Version spaces without boundary sets
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
New results on monotone dualization and generating hypergraph transversals
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On frequent sets of Boolean matrices
Annals of Mathematics and Artificial Intelligence
Hypergraph Transversal Computation and Related Problems in Logic and AI
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Discovering all most specific sentences
ACM Transactions on Database Systems (TODS)
Exact algorithms for finding minimum transversals in rank-3 hypergraphs
Journal of Algorithms
All maximal independent sets and dynamic dominance for sparse graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the complexity of the multiplication method for monotone CNF/DNF dualization
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Complexity of DNF minimization and isomorphism testing for monotone formulas
Information and Computation
Computational aspects of monotone dualization: A brief survey
Discrete Applied Mathematics
On the complexity of monotone dualization and generating minimal hypergraph transversals
Discrete Applied Mathematics
All maximal independent sets and dynamic dominance for sparse graphs
ACM Transactions on Algorithms (TALG)
A study of encodings of constraint satisfaction problems with 0/1 variables
ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
Left-to-Right Multiplication for Monotone Boolean Dualization
SIAM Journal on Computing
| Hi-index | 0.00 |