Ivona Bezakova Headshot

Ivona Bezakova

Professor

Department of Computer Science
Golisano College of Computing and Information Sciences

585-475-4526
Office Location

Ivona Bezakova

Professor

Department of Computer Science
Golisano College of Computing and Information Sciences

Education

Magister in Computer Science, Comenius University (Slovakia); MS, Ph.D. in Computer Science, University of Chicago

Bio

Ivona Bezáková is a Professor in the Department of Computer Science. She received her PhD from the University of Chicago in 2006 and a BS from Comenius University in 2000. Her research interests are centered around the design and analysis of counting and sampling algorithms for various graph structures. 

585-475-4526

Personal Links
Areas of Expertise

Currently Teaching

CSCI-261
3 Credits
This course provides an introduction to the design and analysis of algorithms. It covers a variety of classical algorithms and data structures and their complexity and will equip students with the intellectual tools to design, analyze, implement, and evaluate their own algorithms.
CSCI-264
3 Credits
This course provides a challenging introduction to the design and analysis of algorithms with an emphasis on problem solving and algorithmic research. It covers a variety of classical algorithms and data structures and their complexity, as well as deeper coverage of more advanced material; for example, linear programming, approximation algorithms, and randomized algorithms. The course will equip students with the intellectual tools to design, analyze, implement, and evaluate their own algorithms.
CSCI-761
3 Credits
This course focuses on advanced algorithms and data structures in a specialized area of computer science or in a specific scientific domain. Both practical and theoretical aspects of algorithms will be explored to provide coverage of the state of the art and shortcomings of computing in the specialized area. This includes proofs of correctness and complexity analysis of the algorithms. Students will write a term paper that explores the current state of research in the area or reports on the student's implementation and experiments with algorithms for a chosen problem. Students will also be required to make presentations. The instructor will post the specifics of each course offering before the registration. With the approval of the program coordinator, this course can be taken for credit more than once, provided each instance concerns a different specialized area or domain.

In the News

  • March 17, 2023

    RIT students Mohammed Raeesul Irfan Riaz Ahmed, Eric Karschner, and Quinn Tucker

    CS@RIT hosts regional programming competition

    CS@RIT recently hosted regional competitors of the International Collegiate Programming Contest (ICPC), with 84 registered teams from 19 universities competing. The top four universities will advance to the North America Championship, from which the top teams will advance to the World Finals. Two RIT teams performed well, placing 13th and 17th overall. The contest involves teams of up to three students solving problems within five hours, using a single computer.