Adam Karczmarz is a postdoctoral researcher at IDEAS NCBR, also affiliated with the University of Warsaw, from where he obtained a Ph.D. degree in 2019. He is broadly interested in the theoretical and practical aspects of algorithm and data structures design. His research so far has concentrated mainly on classical graph processing problems such as reachability and shortest paths computation, especially in dynamic, fault-tolerant, and parallel settings that address some of the most significant challenges of today’s large networks. Lately, he has also been exploring connections between classical algorithm design and machine learning.
Google Scholar