What is he best known for?
The fields of study he is best known for:
- 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.
His most cited work include:
- 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)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Discrete mathematics (61.48%)
- Combinatorics (54.81%)
- Upper and lower bounds (20.00%)
What were the highlights of his more recent work (between 2013-2021)?
- Quantum (13.33%)
- Discrete mathematics (61.48%)
- Electronic circuit (5.93%)
In recent papers he was focusing on the following fields of study:
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.
Between 2013 and 2021, his most popular works were:
- 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)
In his most recent research, the most cited papers focused on:
- 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.
