Biography:

Artur Czumaj is a Professor of Computer Science and Director of the Centre for Discrete Mathematics and its Applications (DIMAP) at the University of Warwick. He received his PhD and Habilitation degree from the University of Paderborn in Germany. He is currently President of the European Association for Theoretical Computer Science (EATCS) and he used to be Chair of the London Mathematical Society (LMS) Computer Science Committee. He is Fellow of the European Association for Theoretical Computer Science (EATCS) and recipient of the IBM Award.  Has has been Programme Committee Chair of SWAT’22, ICALP’20, SODA’18, and HALG’16 conferences, conference chair of ICALP’2012, and a member of the Steering Committee of ICALP and HALG conferences. His research has been funded by the Engineering and Physical Sciences Research Council (EPSRC), the National Science Foundation (NSF), the Royal Society, European Union, the Simons Foundation, and IBM.

His research interest is concentrated on the study of theoretical aspect of computer science, focusing on the design of randomized algorithms and the analysis of large data, with applications to parallel and distributed computing, property testing and sublinear algorithms, optimization algorithms, and algorithmic game theory.

Selected publications:

• S. Coy and A. Czumaj. Deterministic Massively Parallel connectivity. In Proceedings of the 54th Annual ACM Symposium on Theory of Computing (STOC), pages 162 - 175, 2022. 
• A. Czumaj and P. Davies. Exploiting spontaneous transmissions for broadcasting and leader election in radio networks. Journal of the ACM, 68(2): Article 13, March 2021
• A. Czumaj, J. Łacki, A. Madry, S. Mitrovic, K. Onak, and P. Sankowski. Round compression for parallel matching algorithms. SIAM Journal on Computing, 49(5): STOC18-1–STOC18-44, 2020.
• A. Czumaj and C. Sohler. Sublinear time approximation of the cost of a metric k-nearest neighbor graph. In Proceedings of the 31st ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2973 - 2992, 2020.
• A. Czumaj and C. Sohler. A characterization of graph properties testable for general planar graphs with one-sided error (It’s all about forbidden subgraphs). In Proceedings of the 60th IEEE Symposium on Foundations of Computer Science (FOCS), pages 1513–1536, 2019.
• A. Czumaj, P. Peng, and C. Sohler. Testing cluster structure of graphs. In Proceedings of the 47th Annual ACM Symposium on Theory of Computing (STOC), pages 723–732, 2015.
• A. Czumaj, O. Goldreich, D. Ron, C. Seshadhri, A. Shapira, and C. Sohler. Finding cycles and trees in sublinear time. Random Structures and Algorithms, 45(2): 139–184, September 2014.
• A. Czumaj and C. Sohler. Estimating the weight of metric minimum spanning trees in sublinear-time. SIAM Journal on Computing, 39(3): 904–922, August 2009.
• A. Czumaj and C. Sohler. Testing expansion in bounded-degree graphs. In Proceedings of the 48th IEEE Symposium on Foundations of Computer Science (FOCS), pages 570–578, 2007.
• A. Czumaj and B. Vöcking. Tight bounds for worst-case equilibria. ACM Transactions on Algorithms, 3(1), January 2007.
• P. Berenbrink, A. Czumaj, A. Steger, and B. Vöcking. Balanced allocations: The heavily loaded case. SIAM Journal on Computing, 35(6): 1350–1385, March 2006.