World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
45
Citations
18621
World Ranking
6992
National Ranking
3063

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