1995 |
6 | | Dana Angluin,
Michael Kharitonov:
When Won't Membership Queries Help?
J. Comput. Syst. Sci. 50(2): 336-355 (1995) |
5 | | Michael Kharitonov:
Cryptographic Lower Bounds for Learnability of Boolean Functions on the Uniform Distribution.
J. Comput. Syst. Sci. 50(3): 600-610 (1995) |
1993 |
4 | EE | Michael Kharitonov:
Cryptographic hardness of distribution-specific learning.
STOC 1993: 372-381 |
1992 |
3 | EE | Michael Kharitonov:
Cryptographic Lower Bounds for Learnability of Boolean Functions on the Uniform Distribution.
COLT 1992: 29-36 |
1991 |
2 | | Dana Angluin,
Michael Kharitonov:
When Won't Membership Queries Help? (Extended Abstract)
STOC 1991: 444-454 |
1989 |
1 | | Michael Kharitonov,
Andrew V. Goldberg,
Moti Yung:
Lower Bounds for Pseudorandom Number Generators
FOCS 1989: 242-247 |