Joe Neeman
Joe Neeman publishes mostly in Artificial Intelligence, Computational Theory and Mathematics and Statistics and Probability, on topics such as Markov Chains and Monte Carlo Methods, Complexity and Algorithms in Graphs and Machine Learning and Algorithms.
- World rank
- #1,877,182 of 7,710,434 ranked researchers
- Rank in United States
- #574,246 of 1,627,098
- Works
- 64
- Citations
- 1.6k
- Citations per work
- 25.0
What does Joe Neeman research?
Joe Neeman's work is mostly in Mathematics (40%), Computer Science (31%).
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 Sciences4570.7%
- Mathematics2640.0%
- Computer Science2030.7%
- Everything else1929.3%
- 1Artificial Intelligence16% of their works
- 2Computational Theory and Mathematics15% of their works
- 3Statistics and Probability15% of their works
- 4Applied Mathematics11% of their works
- 5Mathematical Physics8% of their works
- 6Geometry and Topology6% of their works
Research topics
- Markov Chains and Monte Carlo Methods
- Complexity and Algorithms in Graphs
- Machine Learning and Algorithms
- Stochastic processes and statistical mechanics
- Point processes and geometric inequalities
- Random Matrices and Applications
- Limits and Structures in Graph Theory
- Computational Geometry and Mesh Generation
Which keywords describe Joe Neeman's research?
The keywords of their largest research topics: Approximation Algorithms, Bayesian Monte Carlo, Markov Chain, Combinatorial Optimization, Complexity Theory, Active Learning, Interacting Particle Systems and Machine Learning.
- Delaunay Triangulations
- Graph Limits
- Eigenvalues
- Point Processes
- Machine Learning
- Active Learning
- Combinatorial Optimization
- Bayesian Monte Carlo
- Approximation Algorithms
- Markov Chain
- Complexity Theory
- Interacting Particle Systems
- Scaling Limits
- Spatstat
- Random Matrix Theory
- Szemerédi's Theorem
- Mesh Generation
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.
All 17 words, with their numbers
- Approximation Algorithms343 topics
- Bayesian Monte Carlo151 topic
- Markov Chain151 topic
- Combinatorial Optimization131 topic
- Complexity Theory131 topic
- Active Learning111 topic
- Interacting Particle Systems111 topic
- Machine Learning111 topic
- Scaling Limits111 topic
- Point Processes91 topic
- Spatstat91 topic
- Eigenvalues81 topic
- Random Matrix Theory81 topic
- Graph Limits71 topic
- Szemerédi's Theorem71 topic
- Delaunay Triangulations61 topic
- Mesh Generation61 topic
Where does Joe Neeman work?
Joe Neeman's main affiliation in the publication record is The University of Texas at Austin, United States.
How many publications and citations does Joe Neeman have?
OpenAlex counts 64 works and 1,601 citations for Joe Neeman, an h-index of 14, ranking #1,877,182 of 7,710,434 researchers worldwide on the quality score.
Ranked on field-normalised 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.
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 Joe Neeman. Posts are plain text and can be reported.