Exact lower time bounds for computing Boolean functions on CREW PRAMs
Journal of Computer and System Sciences
Learning Sub-classes of Monotone DNF on the Uniform Distribution
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
On Using Extended Statistical Queries to Avoid Membership Queries
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
A discriminative model for semi-supervised learning
Journal of the ACM (JACM)
Oracle-guided component-based program synthesis
Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1
Hi-index | 0.03 |
The use of highly expanding bipartite multigraphs (called dispersers) to reduce greatly the error of probabilistic algorithms at the cost of few additional random bits is treated. Explicit constructions of such graphs are generalized and used to obtain ...