- Home
- Best Scientists - Computer Science
- Mario Szegedy

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
35
Citations
13,301
78
World Ranking
5841
National Ranking
2832

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.

- Combinatorics
- Discrete mathematics
- Algorithm

Mario Szegedy focuses on Discrete mathematics, Combinatorics, PCP theorem, Boolean function and Randomized algorithm. His Discrete mathematics research is multidisciplinary, incorporating elements of Electronic circuit, Probabilistic logic, Bounded function, Quantum computer and Algorithm. His study on Time complexity is often connected to High probability as part of broader study in Combinatorics.

His research investigates the connection with PCP theorem and areas like MAX-3SAT which intersect with concerns in Approximation algorithm. His work carried out in the field of Boolean function brings together such families of science as Boolean algebras canonically defined and Product term. Mario Szegedy has included themes like Coloring problem, Existential quantification and Graph in his Randomized algorithm study.

- Proof verification and the hardness of approximation problems (1121 citations)
- The Space Complexity of Approximating the Frequency Moments (980 citations)
- The space complexity of approximating the frequency moments (709 citations)

His primary areas of investigation include Discrete mathematics, Combinatorics, Upper and lower bounds, Quantum and Boolean function. His Discrete mathematics study combines topics from a wide range of disciplines, such as Quantum computer and Quantum algorithm. Mario Szegedy interconnects Adversary, Kolmogorov complexity and Qubit in the investigation of issues within Quantum algorithm.

His research in Combinatorics intersects with topics in Bounded function and Constant. His Upper and lower bounds research integrates issues from Computational complexity theory and Semidefinite programming. As a part of the same scientific family, Mario Szegedy mostly works in the field of Boolean function, focusing on Function and, on occasion, Theoretical computer science.

- Discrete mathematics (61.48%)
- Combinatorics (54.81%)
- Upper and lower bounds (20.00%)

- Quantum (13.33%)
- Discrete mathematics (61.48%)
- Electronic circuit (5.93%)

Mario Szegedy spends much of his time researching Quantum, Discrete mathematics, Electronic circuit, Upper and lower bounds and Statistical physics. His studies deal with areas such as Constant, Sequence, Computational science and Benchmark as well as Quantum. His Discrete mathematics research includes elements of Squashed entanglement, No-communication theorem, One-way quantum computer and Combinatorics.

His Combinatorics research incorporates a variety of disciplines, including Zero error and Algebraic number. His study in Upper and lower bounds is interdisciplinary in nature, drawing from both Quantum simulator and Conjecture. His Statistical physics research incorporates themes from Scale, Tensor, Light cone, Markov chain and Contraction.

- Classical Simulation of Quantum Supremacy Circuits (17 citations)
- Alibaba Cloud Quantum Development Platform: Applications to Quantum Algorithm Design (17 citations)
- A Simple Yet Effective Balanced Edge Partition Model for Parallel Computing (15 citations)

- Algorithm
- Combinatorics
- Discrete mathematics

His scientific interests lie mostly in Quantum, Discrete mathematics, Parallel computing, Independent set and Reduction. His work on Quantum simulator as part of general Quantum research is often related to Monotone polygon, thus linking different fields of science. His Discrete mathematics study combines topics in areas such as Squashed entanglement, Entanglement witness, W state, Quantum capacity and Quantum teleportation.

His Parallel computing research is multidisciplinary, relying on both Edge contraction, Graph partition, Edge cover, Level structure and Partition. The Independent set study combines topics in areas such as Space, Streaming algorithm, Measure and Theory of computation. His Reduction research is multidisciplinary, incorporating perspectives in Quantum computer, Computation, Pairwise comparison and Sequence.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Proof verification and the hardness of approximation problems

Sanjeev Arora;Carsten Lund;Rajeev Motwani;Madhu Sudan.

Journal of the ACM **(1998)**

2729 Citations

The Space Complexity of Approximating the Frequency Moments

Noga Alon;Yossi Matias;Mario Szegedy.

Journal of Computer and System Sciences **(1999)**

2024 Citations

Proof verification and hardness of approximation problems

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

foundations of computer science **(1992)**

1026 Citations

Checking computations in polylogarithmic time

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

symposium on the theory of computing **(1991)**

727 Citations

Approximating clique is almost NP-complete

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

foundations of computer science **(1991)**

568 Citations

Quantum speed-up of Markov chain based algorithms

M. Szegedy.

foundations of computer science **(2004)**

520 Citations

Interactive proofs and the hardness of approximating cliques

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

Journal of the ACM **(1996)**

482 Citations

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.

Journal of Computer and System Sciences **(1993)**

463 Citations

Threshold circuits of bounded depth

Andras Hajnal;Wolfgang Maass;Pavel Pudlak;Mario Szegedy.

foundations of computer science **(1987)**

413 Citations

Efficient Testing of Large Graphs

Noga Alon;Eldar Fischer;Michael Krivelevich;Mario Szegedy.

Combinatorica **(2000)**

392 Citations

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

Contact us

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:

Tel Aviv University

University of Chicago

Alfréd Rényi Institute of Mathematics

Hebrew University of Jerusalem

Reykjavík University

Tel Aviv University

Google (United States)

Princeton University

Stanford University

Eötvös Loránd University

Something went wrong. Please try again later.