World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
38
Citations
5515
World Ranking
10324
National Ranking
649

Research.com Recognitions

  • 2015 - European Association for Theoretical Computer Science (EATCS) Fellow For contributions to analysis and design of algorithms, especially to understanding the role of randomization in computer science

Overview

Artur Czumaj is affiliated with the University of Warwick in the United Kingdom. Their primary research field is Computer Science, with a particular focus on Computational Theory and Mathematics, as well as related subfields including Computer Networks and Communications, Artificial Intelligence, Computer Graphics and Computer-Aided Design, and Hardware and Architecture.

The research topics that Artur Czumaj has explored cover a broad range of areas within computer science:

  • Complexity and Algorithms in Graphs
  • Advanced Graph Theory Research
  • Computational Geometry and Mesh Generation
  • Optimization and Search Problems
  • Cooperative Communication and Network Coding
  • Parallel Computing and Optimization Techniques
  • Cryptography and Data Security

The scientist has published their work in various notable venues, including:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • SIAM Journal on Computing
  • 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
  • Distributed Computing

Among their recent papers are the following:

  • Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC (2021, SIAM Journal on Computing)
  • Streaming Facility Location in High Dimension via Geometric Hashing (2022, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS))
  • Near-Shortest Path Routing in Hybrid Communication Networks (2022, Leibniz-Zentrum für Informatik (Schloss Dagstuhl))
  • Component stability in low-space massively parallel computation (2024, Distributed Computing)
  • Almost Tight Bounds for Reordering Buffer Management (2022, SIAM Journal on Computing)

Artur Czumaj frequently collaborates with several other researchers. Their most common coauthors include:

  • Sam Coy
  • Peter Maxwell Davies
  • Gopinath Mishra
  • Merav Parter
  • Robert Krauthgamer

In 2015, Artur Czumaj was recognized as a Fellow of the European Association for Theoretical Computer Science (EATCS) for contributions to the analysis and design of algorithms, focusing especially on understanding the role of randomization in computer science.

Best Publications

  • Tight bounds for worst-case equilibria

    Artur Czumaj;Berthold Vöcking

  • Balanced Allocations: The Heavily Loaded Case

    Petra Berenbrink;Artur Czumaj;Angelika Steger;Berthold Vöcking

  • Speeding up two string-matching algorithms

    Maxime Crochemore;Artur Czumaj;Leszek Gasieniec;Stefan Jarominek

  • Broadcasting algorithms in radio networks with unknown topology

    Artur Czumaj;Wojciech Rytter

  • Broadcasting algorithms in radio networks with unknown topology

    A. Czumaj;W. Rytter

  • Testing expansion in bounded-degree graphs

    Artur Czumaj;Christian Sohler

  • Selfish Traffic Allocation for Server Farms

    Artur Czumaj;Piotr Krysta;Berthold Vöcking

  • Randomized allocation processes

    Artur Czumaj;Volker Stemann

  • Fast practical multi-pattern matching

    Maxime Crochemore;Artur Czumaj;Leszek Gasieniec;Thierry Lecroq

  • Fault-Tolerant Geometric Spanners

    Artur Czumaj;Hairong Zhao

  • Faster algorithms for finding lowest common ancestors in directed acyclic graphs

    Artur Czumaj;Mirosław Kowaluk;Andrzej Lingas

  • Round compression for parallel matching algorithms

    Artur Czumaj;Jakub Łącki;Aleksander Mądry;Slobodan Mitrović

  • Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time

    Artur Czumaj;Christian Sohler

  • Round Compression for Parallel Matching Algorithms

    Artur Czumaj;Jakub Ła̧cki;Aleksander Ma̧dry;Slobodan Mitrović

  • On approximability of the minimum-cost k-connected spanning subgraph problem

    Artur Czumaj;Andrzej Lingas

  • Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs

    Artur Czumaj;Asaf Shapira;Christian Sohler

  • Property Testing in Computational Geometry

    Artur Czumaj;Christian Sohler;Martin Ziegler

  • Sublinear-time algorithms

    Artur Czumaj;Christian Sohler

  • Coloring nonuniform hypergraphs: a new algorithmic approach to the general Lovász local lemma

    Artur Czumaj;Christian Schiedeler

  • Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time

    Artur Czumaj;Funda Ergün;Lance Fortnow;Avner Magen

Frequent Co-Authors

Christian Sohler
Christian Sohler University of Cologne
Peter Davies
Peter Davies French Research Institute for Exploitation of the Sea
Leszek Gasieniec
Leszek Gasieniec University of Liverpool
Wojciech Rytter
Wojciech Rytter University of Warsaw
Berthold Vöcking
Berthold Vöcking RWTH Aachen University
Maxime Crochemore
Maxime Crochemore King's College London
Christian Scheideler
Christian Scheideler University of Paderborn
Oded Goldreich
Oded Goldreich Weizmann Institute of Science
Kurt Mehlhorn
Kurt Mehlhorn Max Planck Institute for Informatics

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Pursuing a career in computer science offers flexible online education options. For those beginning their journey or seeking a quicker entry into the workforce, consider an associate's degree online. This is a practical pathway for gaining essential skills in a shorter timeframe.

Cost is a key consideration when selecting a program. There are many affordable online courses that allow you to earn your degree without accumulating excessive debt. These options make quality education accessible to a wider range of students.

Admission requirements can vary. If your academic record is less than perfect, you can still find a college that accepts low gpa. This helps ensure that opportunities are not limited by past challenges.

A computer science background also opens doors across diverse industries, including tech, finance, and research. If you’re interested in interdisciplinary roles, you might explore sectors similar to technology, such as environmental science. Discover what kinds of positions are available with such a background by learning about jobs for environmental science majors.

Best Scientists Citing Artur Czumaj

Trending Scientists

Recently Published Articles