Michael Kharitonov

According to our database, Michael Kharitonov authored at least 7 papers between 1989 and 1995.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1995

Cryptographic Lower Bounds for Learnability of Boolean Functions on the Uniform Distribution.

Michael Kharitonov

J. Comput. Syst. Sci., 1995

When Won't Membership Queries Help?

Dana Angluin, Michael Kharitonov

J. Comput. Syst. Sci., 1995

1993

The cryptographic hardness of machine learning.

Michael Kharitonov

PhD thesis, 1993

Cryptographic hardness of distribution-specific learning.

Michael Kharitonov

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1991

When Won't Membership Queries Help? (Extended Abstract)

Dana Angluin, Michael Kharitonov

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

On Implementing Scaling Push-Relabel Algorithms for the Minimum-Cost Flow Problem.

Andrew V. Goldberg, Michael Kharitonov

Proceedings of the Network Flows And Matching, 1991

1989

Lower Bounds for Pseudorandom Number Generators

Michael Kharitonov, Andrew V. Goldberg, Moti Yung

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989