معرفی
Uroš Čibej serves as an Assistant Professor at the Faculty of Computer Science and Informatics, University of Ljubljana, where he teaches core courses including Theoretical Foundations of Computer Science, Computability Theory, and Algorithms and Data Structures. As a member of the Algorithmics Laboratory, he contributes to both educational and research initiatives within the institution.
His research centers on distributed systems, scheduling theory, and complexity theory, with specialized focus on approximate, probabilistic, and distributed algorithms. This work addresses fundamental challenges in computational efficiency and scalability, particularly relevant to modern distributed computing environments and big data applications.
Dr. Čibej actively participates in major research projects such as ARRS Program P2-0095 "Parallel and Distributed Systems" (2020-2026), ARRS Project N2-0171 "Graph Theory and Combinatorial Scientific Computing" (2021-2023), and earlier initiatives including "Graph Optimization and Big Data" (2016-2019). His project portfolio demonstrates consistent engagement in theoretical algorithm development with practical applications in network analysis and visualization.
Within the Algorithmics Laboratory, he collaborates on advancing theoretical computer science methodologies while mentoring students through coursework in foundational programming and computational theory.
