On the structure of degrees of inferability
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
The strength of noninclusions for teams of finite learners (extended abstract)
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Inclusion problems in parallel learning and games (extended abstract)
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Learning via queries and oracles
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Comparing Verboseness for Finite Automata and Turing Machines
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Six Hypotheses in Search of a Theorem
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Some connections between bounded query classes and non-uniform complexity
Information and Computation
Choosing, agreeing, and eliminating in communication complexity
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
ON A QUANTITATIVE NOTION OF UNIFORMITY
Fundamenta Informaticae
Choosing, Agreeing, and Eliminating in Communication Complexity
Computational Complexity
| Hi-index | 0.00 |