Photo of Prof. Eyal Kushilevitz

Prof. Eyal Kushilevitz

Sophia and William Shamban Academic Chair

Counselor for students in poor academic standing

Contact information
Office Hours:
Wednesday, 9:30–10:30
Research interests
Cryptography; Machine learning; Computational complexity and Communication complexity; Randomized distributed protocols.
Selected publications

KUSHILEVITZ, E., and OSTROVSKY, R., "Replication is not needed: single database, computationally-private information retrieval", 38th IEEE Conference on the Foundations of Computer Science (FOCS), pp. 364-373, 1997.

BEIMEL, A., BERGADANO, F., BSHOUTY, N.H., KUSHILEVITZ, E., and VARRICCHIO, S., "On the applications of multiplicity automata in learning", 37th IEEE Conference on the Foundations of Computer Science (FOCS), pp. 349-358, 1996.

CHOR, B., GOLDREICH, O., KUSHILEVITZ, E., and SUDAN, M., "Private information retrieval", 36th IEEE Conference on the Foundations of Computer Science (FOCS), pp. 41-50, 1995.

FEDER , T., KUSHILEVITZ, E., NAOR, M., and NISAN, N., "Amortized communication complexity", SIAM Journal on Computing, Vol. 24, No. 4, pp. 736-750, 1995.

KUSHILEVITZ, E., and MANSOUR, Y., "Learning decision trees using the fourier spectrum", SIAM Journal on Computing, Vol. 22, No. 6, pp. 1331-1348, 1993.

KUSHILEVITZ, E., MANSOUR, Y., RABIN, M.O., and ZUCKERMAN, D., "Lower bounds for randomized mutual-exclusion", 25th ACM Symposium on Theory of Computing (STOC), pp. 154-163, 1993. To appear in SIAM Journal on Computing, 1998.

CHOR, B., and KUSHILEVITZ, E., "A zero-one law for Boolean privacy", SIAM Journal on Discrete Mathematics. Vol. 4, No.1, pp. 36-47, 1991.