Hi, I’m Michał!

I am pursuing a PhD degree in Computer Science. This part of my academic journey began three years ago when I got accepted to the Doctoral School of the University of Warsaw. A year later, I joined the Sapienza University of Rome as a PhD student at the Department of Computer, Control and Management Engineering. Since then, I have been on a joint PhD program between both universities. My supervisors are Prof. Piotr Sankowski and Prof. Stefano Leonardi. Besides working in academia, I am a Doctoral Researcher at IDEAS NCBR in the Intelligent Algorithms and Data Structures group.

Before that, I graduated with honors with a master’s diploma in Computer Science from the University of Warsaw. I wrote my thesis under the supervision of Dr. Marek Adamczyk (University of Wrocław). Two years prior, I obtained a double bachelor’s degree in Computer Science and Mathematics (with honors) from the same university. My supervisors were Prof. Adam Osękowski and Dr. Janusz Jabłonowski.

My research interests lie in the area of approximation algorithms for optimization under uncertainty. The main problems I have worked on so far revolved around prophet inequalities and online problems with delays. However, during my stay at Sapienza, I also became interested in algorithmic game theory and mechanism design. I love broadening my knowledge and experience.

Last updated: October 2023 

Teaching

Winter semester, 2024/25

Linear Algebra (PL)

Winter semester, 2023/24

Linear Algebra (PL)

Theory of Concurrency (PL)

Winter semester, 2022/23

Algorithms and Data Structures (PL)

Theory of Concurrency (PL)

Summer semester, 2021/22

Theory of Concurrency (EN)

Conference publications

(2024). Online Multi-level Aggregation with Delays and Stochastic Arrivals. In The 35th International Symposium on Algorithms and Computation (ISAAC ‘24).

Cite arXiv Full Paper Detailed Slides

(2024). Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM ‘24).

Cite arXiv PDF Full Paper Slides

(2024). Multi-Level Aggregation with Delays and Stochastic Arrivals. In Proceedings of the 2024 International Conference on Autonomous Agents and Multiagent Systems (AAMAS ‘24) (Extended Abstract).

Cite arXiv PDF Poster

(2023). Online Matching with Delays and Stochastic Arrival Times. In Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems (AAMAS ‘23).

Cite arXiv PDF Poster Animation Slides Detailed Slides

Contact