Lower Bounds for Pseudorandom Number Generators - Michael Kharitonov; Andrew V. Goldberg; Moti Yung (FOCS, 1989)

On Implementing Scaling Push-Relabel Algorithms for the Minimum-Cost Flow Problem. - Andrew V. Goldberg; Michael Kharitonov (Network Flows And Matching, 1991)

When Won't Membership Queries Help? (Extended Abstract) - Dana Angluin; Michael Kharitonov (STOC, 1991)

Cryptographic hardness of distribution-specific learning. - Michael Kharitonov (STOC, 1993)

The cryptographic hardness of machine learning. - Michael Kharitonov (1993)

When Won't Membership Queries Help? - Dana Angluin; Michael Kharitonov (J. Comput. Syst. Sci., 1995)

Cryptographic Lower Bounds for Learnability of Boolean Functions on the Uniform Distribution. - Michael Kharitonov (J. Comput. Syst. Sci., 1995)