Benny Sudakov
Benny Sudakov publishes mostly in Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Mathematical Physics, on topics such as Limits and Structures in Graph Theory, Advanced Graph Theory Research and Topological and Geometric Data Analysis.
- World rank
- #4,370,230 of 7,710,434 ranked researchers
- Rank in Switzerland
- #59,396 of 80,918
- Works
- 16
- Citations
- 2
- Citations per work
- 0.1
What does Benny Sudakov research?
Benny Sudakov's work is mostly in Mathematics (48%), Computer Science (40%), Physics and Astronomy (4%).
Their six largest subfields, inside their fields and domains; the grey slice is everything else they publish. The interactive view splits every one of their works down to single topics.
The fields and subfields, with their numbers
- Physical Sciences1591.8%
- Mathematics848.0%
- Computer Science639.6%
- Physics and Astronomy14.2%
- Everything else18.2%
- 1Computational Theory and Mathematics40% of their works
- 2Discrete Mathematics and Combinatorics33% of their works
- 3Mathematical Physics6% of their works
- 4Geometry and Topology4% of their works
- 5Condensed Matter Physics4% of their works
- 6Statistics and Probability4% of their works
Research topics
- Limits and Structures in Graph Theory
- Advanced Graph Theory Research
- Topological and Geometric Data Analysis
- Stochastic processes and statistical mechanics
- Computability, Logic, AI Algorithms
- Complexity and Algorithms in Graphs
- Commutative Algebra and Its Applications
- Nonlinear Partial Differential Equations
Which keywords describe Benny Sudakov's research?
The keywords of their largest research topics: Graph Limits, Szemerédi's Theorem, Algorithmic Applications, Approximation Algorithms, Graph Theory, Parameterized Complexity, Interacting Particle Systems and Persistent Homology.
- Sobolev Spaces
- Graded Betti Numbers
- Computability
- Combinatorial Optimization
- Topological Methods
- Persistent Homology
- Parameterized Complexity
- Approximation Algorithms
- Szemerédi's Theorem
- Graph Limits
- Algorithmic Applications
- Graph Theory
- Interacting Particle Systems
- Scaling Limits
- Algorithmic Information Theory
- Complexity Theory
- Fractional Laplacian
- Monomial Ideals
Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most. The words come from the keyword list OpenAlex gives each topic, not from the text of the papers, so a word can appear that none of the papers uses.
All 18 words, with their numbers
- Graph Limits151 topic
- Szemerédi's Theorem151 topic
- Algorithmic Applications142 topics
- Approximation Algorithms142 topics
- Graph Theory121 topic
- Parameterized Complexity121 topic
- Interacting Particle Systems31 topic
- Persistent Homology31 topic
- Scaling Limits31 topic
- Topological Methods31 topic
- Algorithmic Information Theory21 topic
- Combinatorial Optimization21 topic
- Complexity Theory21 topic
- Computability21 topic
- Fractional Laplacian21 topic
- Graded Betti Numbers21 topic
- Monomial Ideals21 topic
- Sobolev Spaces21 topic
Where does Benny Sudakov work?
Benny Sudakov's main affiliation in the publication record is ETH Zurich, Switzerland.
How many publications and citations does Benny Sudakov have?
OpenAlex counts 16 works and 2 citations for Benny Sudakov, an h-index of 1, ranking #4,370,230 of 7,710,434 researchers worldwide on the quality score.
Ranked on field-normalised citation excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.
Other researchers named Benny Sudakov
Papers, co-authors, who cited this work and researchers on the nearest topics have tabs of their own, above. Is this your page? Claim it with your ORCID iD, or request a correction or removal.
Discussion
Ask a question or share a note about Benny Sudakov. Keep it to the research: no personal attacks, advertising or links. Any reader can report a post, which collapses it for everyone until it is opened.