Efim Kinber, Ph.D.

Efim Kinber, Ph.D.

Professor

Dr. Kinber's teaching focus is senior and graduate courses in algorithm design and implementation, and his research includes Computational Learning Theory and Complexity Theory. He joined Sacred Heart University in 1995.

Degrees and Certifications

    Efim Kinber, Ph.D., received a Ph.D. in Computer Science from Latvian University in 1992, a Ph.D. in Mathematics from Steklov Mathematical Institute, Saint-Petersburg Division, Russia, in 1975, and a BS from Latvian University in 1971.

Publications and Presentations

    Dr. Kinber's more than ninety publications include most recently “Theory of Computing: A Gentle Introduction” (with C. Smith), Prentice-Hall, 2000 (Japanese translation – 2002); “Language Learning from Texts: Mind Changes, Limited Memory, and Monotonicity” (with F. Stephan), Information and Computation, v. 123, No. 2, 1995; and “On the Intrinsic Complexity of Learning” (with C. Smith and R. Freivalds), Information and Computation, V. 123, No. 1, 1995. Dr. Kinber is also a member of The Program Committee of the Annual Conference on Learning Theory, COLT'2003, the NEASC University Assessment Committee, the URCG Committee, and the Association for Computing Machinery.

Contact Information

Office Location & Hours

  • Location:
    Computer Science And Information Technology
    Academic Bldg HC 109B
    College of Arts and Sciences
  • View Campus Map