Learnability and the Vapnik-Chervonenkis dimension
Journal of the ACM (JACM)
On the distributional complexity of disjointness
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Private vs. common random bits in communication complexity
Information Processing Letters
Decision theoretic generalizations of the PAC model for neural net and other learning applications
Information and Computation
Fat-shattering and the learnability of real-valued functions
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Efficient distribution-free learning of probabilistic concepts
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
.879-approximation algorithms for MAX CUT and MAX 2SAT
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On data structures and asymmetric communication complexity
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Lower Bounds for One-way Probabilistic Communication Complexity
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Complexity classes in communication complexity theory
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Public vs. private coin flips in one round communication games (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Neural networks and efficient associative memory
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
On quantum and probabilistic communication: Las Vegas and one-way protocols
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Randomized Simultaneous Messages: Solution Of A Problem Of Yao In Communication Complexity
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Errata for: on randomized one-round communication complexity
Computational Complexity
Tensor norms and the classical communication complexity of nonlocal quantum measurement
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Approximating Boolean functions by OBDDs
Discrete Applied Mathematics
Learning complexity vs communication complexity
Combinatorics, Probability and Computing
New bounds on classical and quantum one-way communication complexity
Theoretical Computer Science
On the size of randomized OBDDs and read-once branching programs for k-stable functions
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Quantum communication complexity of block-composed functions
Quantum Information & Computation
Complexity of quantum uniform and nonuniform automata
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
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 |