Dr. Gaber Iris
Fields of Research
Dr. Gaber is a senior lecturer at the School of Computer Science in The Academic College of Tel Aviv Yaffo where she also serves as the head of Disciplinary Committee and the head of Admission Committee of the school of Computer Science. Iris received her doctorate from the School of Computer Science, Tel-Aviv University. Her work has been presented in international conferences and published in scholarly journals.
Iris was Co-organizer of the Teaching Workshop in the Core C++ International Conference on 2019.
Iris teaches many courses, both theoretical such as Data Structures and Algorithms, and practical such as Advanced C Programming.
Gaber I, & Kirsh A, (2021). Using Examples as Guideposts for Programming Exercises: Providing Support while Preserving the Challenge IEEE The 16th International Conference on Computer Science and Education (ICCSE ’21). The paper won the Best Paper Award prize (2021).
Gaber I, Armoni D, Statter I, (2021). Teaching Reduction as an Algorithmic Problem-Solving Strategy. IEEE The 3rd International Conference on Computer Science and Technologies in Education (CSTE ’21) pp. 19-26, doi: 10.1109/CSTE53634.2021.00012 (2021).
Gaber I, Lev A, Zigdon R, (2019). Pedagogical Aspects of the Intermediate Value Theorem. Amer. Math. Monthly, 126(9): 845—849.
Gaber I, Kirsh A, (2017). The Effect of Reporting Known Issues on Students' Work. The 49th ACM SIGCSE Technical Symposium on Computer Science Education (SIGSCE ‘18).
Kirsh A, & Gaber I, (2016). Satisfaction, Time Investment and Success in Students' programming Exercise. Proceedings of the Programming Experience (PX/16): 9-20.
Gaber I, & Roditty Y, (2009). The Depression of a Graph and the Diameter of its Line Graph. SIAM J. Disc. Math, 309: 1774--1778.
Gaber I, (2005). Minimal-Time k-Line Broadcasting. SIAM J. Disc. Math., 18(4): 769-777.
Gaber I, & Parnas M, (2005). All-port line broadcasting in highly connected graphs. Networks. 45(2): 95-103.
Gaber I, & Mansour Y, (2003). Centralized broadcast in multihop radio networks. Journal of Algorithms, 46(1): 1-20. The paper is one of the top 3 most downloaded articles for Journal of Algorithms in 2003.
Averbuch A, Gaber I, Roditty Y, (2001). Low cost minimum-time line broadcasting in complete binary trees. Networks, 38: 189-193.