I am broadly interested in theoretical computer science, with an focus on the principles of distributed computing. My goal is to design distributed algorithms that perfectly (and provably so) adapt to the underlying communication network. This includes exploring the fundamental features of networks that prevent ultra-fast distributed algorithm from existing, as well as creating user-friendly tools that aid in designing such algorithms when they are achievable.
This pursuit has led to uncovering new connections between distributed computing and many seemingly unrelated fields of theoretical computer science. Notably, these connections have proven to be mutually benefitial and have already led to important breakthroughs not only in distributed computing, but also in the theory of metric embedding, information theory, and optimal oblivious packet routing.
Short BiographyI am a postdoc at ETH Zurich, in the research group of Prof. Mohsen Ghaffari. I received my Ph.D. from the School of Computer Science at Carnegie Mellon University under the advisorship of Prof. Bernhard Haeupler with the thesis titled Towards Universal Optimality in Distributed Optimization. Earlier, I obtained my B.Sc. and M.Sc. from University of Zagreb under the advisorship of Prof. Mile Šikić. I like competitive programming and playing volleyball.
I am extremely honored to have received the 2021 ACM-EATCS Principles of Distributed Computing Doctoral Dissertation Award (see here and here). Earlier, I was also awarded the 2018 DFINITY Scholarship.Links:
|my CV||my fledgling blog|
|Pan-African Math Circle||Principles of Distributed Computing|