World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
38
Citations
5515
World Ranking
10322
National Ranking
646

Artur Czumaj publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Artur Czumaj sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 220 publications — 53rd percentile

53% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Artur Czumaj D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Artur Czumaj sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 38 D-Index — 30th percentile

30% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

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