World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
45
Citations
18621
World Ranking
6993
National Ranking
3064

Mario Szegedy publications per year

1986: 1 publications 1987: 2 publications 1988: 1 publications 1989: 2 publications 1990: 1 publications 1991: 2 publications 1992: 7 publications 1993: 3 publications 1994: 3 publications 1995: 2 publications 1996: 4 publications 1997: 2 publications 1998: 2 publications 1999: 11 publications 2000: 2 publications 2001: 4 publications 2002: 1 publications 2003: 4 publications 2004: 5 publications 2005: 2 publications 2006: 6 publications 2007: 7 publications 2008: 3 publications 2009: 4 publications 2010: 4 publications 2011: 3 publications 2012: 6 publications 2013: 2 publications 2014: 3 publications 2015: 2 publications 2016: 4 publications 2017: 2 publications 2018: 0 publications 2019: 6 publications 2020: 6 publications 2021: 2 publications 2022: 8 publications 2023: 0 publications 2024: 2 publications 2025: 4 publications
1986 2025

135 publications in total across all disciplines

Mario Szegedy publication distribution in Computer Science in 2027

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2027. The highlighted bar marks where Mario Szegedy 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: 124 publications — 16th percentile

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

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

Mario Szegedy D-index placement in Computer Science in 2027

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2027. The highlighted bar marks where Mario Szegedy 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: 45 D-Index — 51st percentile

51% 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

  • 2019 - ACM Paris Kanellakis Theory and Practice Award For seminal work on the foundations of streaming algorithms and their application to large scale data analytics.

Overview

Mario Szegedy is affiliated with Rutgers, The State University of New Jersey in the United States. Their research primarily focuses on Computer Science, with significant contributions to Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications, Industrial and Manufacturing Engineering, and Electrical and Electronic Engineering.

Their work covers multiple topics including Quantum Computing Algorithms and Architecture, Complexity and Algorithms in Graphs, Optimization and Search Problems, Quantum Information and Cryptography, Quantum many-body systems, Advanced Manufacturing and Logistics Optimization, and Markov Chains and Monte Carlo Methods.

Frequent collaborators include Cupjin Huang, Jingjin Yu, Guanyang Wang, Michael Newman, and Fang Zhang.

Szegedy has published extensively in several venues, notably:

  • arXiv (Cornell University)
  • Quantum
  • Nature Computational Science
  • IEEE Transactions on Information Theory
  • The International Journal of Robotics Research

Recent publications from Mario Szegedy include the following papers:

  • Classical Simulation of Quantum Supremacy Circuits, 2020, arXiv (Cornell University)
  • Efficient parallelization of tensor network contraction for simulating quantum computation, 2021, Nature Computational Science
  • Finding Angles for Quantum Signal Processing with Machine Precision, 2020, arXiv (Cornell University)
  • Explicit Lower Bounds on Strong Quantum Simulation, 2020, IEEE Transactions on Information Theory
  • Rubik Tables and object rearrangement, 2022, The International Journal of Robotics Research

Mario Szegedy received the ACM Paris Kanellakis Theory and Practice Award in 2019 for work on the foundations of streaming algorithms and their application to large scale data analytics.

Best Publications

  • Proof verification and the hardness of approximation problems.

    Sanjeev Arora;Carsten Lund;Rajeev Motwani;Madhu Sudan

  • The Space Complexity of Approximating the Frequency Moments

    Noga Alon;Yossi Matias;Mario Szegedy

  • The space complexity of approximating the frequency moments

    Noga Alon;Yossi Matias;Mario Szegedy

  • Proof verification and hardness of approximation problems

    S. Arora;C. Lund;R. Motwani;M. Sudan

  • Checking computations in polylogarithmic time

    László Babai;Lance Fortnow;Leonid A. Levin;Mario Szegedy

  • Quantum speed-up of Markov chain based algorithms

    M. Szegedy

  • Approximating clique is almost NP-complete

    U. Feige;S. Goldwasser;L. Lovasz;S. Safra

  • Interactive proofs and the hardness of approximating cliques

    Uriel Feige;Shafi Goldwasser;Laszlo Lovász;Shmuel Safra

  • On the degree of Boolean functions as real polynomials

    Noam Nisan;Mario Szegedy

  • Threshold circuits of bounded depth

    András Hajnal;András Hajnal;Wolfgang Maass;Wolfgang Maass;Pavel Pudlák;Pavel Pudlák;György Turán;György Turán

  • Efficient Testing of Large Graphs

    Noga Alon;Eldar Fischer;Michael Krivelevich;Mario Szegedy

  • Quantum Algorithms for the Triangle Problem

    Fre´de´ric Magniez;Miklos Santha;Mario Szegedy

  • Threshold circuits of bounded depth

    Andras Hajnal;Wolfgang Maass;Pavel Pudlak;Mario Szegedy

  • Tracking join and self-join sizes in limited storage

    Noga Alon;Phillip B. Gibbons;Yossi Matias;Mario Szegedy

  • Tracking Join and Self-Join Sizes in Limited Storage

    Noga Alon;Phillip B. Gibbons;Yossi Matias;Mario Szegedy

  • Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs

    L. Babai;N. Nisan;M. Szegedy

  • Lower bounds for on-line graph coloring

    Magnús M. Halldórsson;Mario Szegedy

  • Applications of the crossing number

    János Pach;János Pach;Farhad Shahrokhi;Mario Szegedy

  • Regular Languages are Testable with a Constant Number of Queries

    Noga Alon;Michael Krivelevich;Ilan Newman;Mario Szegedy

  • Quantum Query Complexity of State Conversion

    Troy Lee;Rajat Mittal;Ben W. Reichardt;Robert palek

Frequent Co-Authors

Noga Alon
Noga Alon Tel Aviv University
János Pach
János Pach Alfréd Rényi Institute of Mathematics
László Babai
László Babai University of Chicago
Magnús M. Halldórsson
Magnús M. Halldórsson Reykjavík University
Noam Nisan
Noam Nisan Hebrew University of Jerusalem
Michael Krivelevich
Michael Krivelevich Tel Aviv University
Yossi Matias
Yossi Matias Google (United States)
Madhu Sudan
Madhu Sudan Harvard University
Rajeev Motwani
Rajeev Motwani Stanford University
Wolfgang Maass
Wolfgang Maass Graz University of Technology

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

Exploring online education in Computer Science opens up many affordable and flexible options for students. For those keen on specializing in data science, finding the cheapest data science degree can significantly lower the cost barrier, while still delivering a valued credential.

Similarly, students interested in related technical fields should consider the electrical engineering online tuition costs to find degree programs that fit both their academic and budget needs. Comparing tuition rates helps identify reputable schools offering top-notch curriculum at competitive prices.

Not everyone needs a full degree to launch or advance their career. There are many certifications that pay well and can be earned quickly online, helping students move into high-demand roles rapidly.

For those looking to advance fast, searching for the shortest masters degree programs allows motivated learners to boost their qualifications in less time, supporting quicker career progression. Tailoring your path with these options ensures maximum flexibility and value in your educational journey.

Best Scientists Citing Mario Szegedy

Trending Scientists

Recently Published Articles