Joel Spencer
Impact in
- Discrete Mathematics and Combinatorics top 0.05%
- Limits and Structures in Graph Theory
- Computational Theory and Mathematics top 0.05%
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
Papers in
-
- Limits and Structures in Graph Theory 53
-
- Advanced Graph Theory Research 37
- Graph Labeling and Dimension Problems 14
- Computability, Logic, AI Algorithms 14
- semigroups and automata theory 12
- Co-authors
- Noga AlonRaissa M. D’SouzaDimitris AchlioptasBéla BollobásOliver RiordanGábor TusnádyNicholas WormaldP. Erdös
- Journals
- Journal of Combinatorial Theory Series A (17 papers)Random Structures and Algorithms (14 papers)Discrete Mathematics (8 papers)COMBINATORICA (8 papers)Journal of Combinatorial Theory Series B (6 papers)
- Partner nations
- United StatesHungaryGermany
In The Last Decade
Joel Spencer
147 papers receiving 7.0k citations
Hit Papers
Peers
Comparison fields: 5 of 136
- Discrete Mathematics and Combinatorics 2.6k
- Computational Theory and Mathematics 3.7k
- Geometry and Topology 1.4k
- Mathematical Physics 1.2k
- Computer Graphics and Computer-Aided Design 466
Countries citing papers authored by Joel Spencer
This map shows the geographic impact of Joel Spencer's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Joel Spencer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Joel Spencer more than expected).
Fields of papers citing papers by Joel Spencer
This network shows the impact of papers produced by Joel Spencer. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Joel Spencer. The network helps show where Joel Spencer may publish in the future.
Co-authors
The 25 scholars most cited alongside Joel Spencer, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2018 | 0 | |
| 2 | 2014 | 10 | |
| 3 | 2007 | 17 | |
| 4 | 2005 | 12 | |
| 5 | Succinct Definitions in the First Order Theory of Graphs II: No Quantifier Alternation | 2004 | 1 |
| 6 | 2003 | 7 | |
| 7 | 2002 | 3 | |
| 8 | 1997 | 2 | |
| 9 | Real time asymtotic packing | 1997 | 1 |
| 10 | 1991 | 20 | |
| 11 | 1990 | 27 | |
| 12 | 1988 | 40 | |
| 13 | 1988 | 3 | |
| 14 | Sequences with small discrepancy relative to n events | 1982 | 4 |
| 15 | 1981 | 30 | |
| 16 | 1981 | 1 | |
| 17 | 1977 | 30 | |
| 18 | 1975 | 18 | |
| 19 | 1972 | 32 | |
| 20 | 1968 | 24 |
About Joel Spencer
Joel Spencer is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Mathematical Physics, Geometry and Topology and Theoretical Computer Science, having authored 155 papers that have together received 7.7k indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (53 papers), Advanced Graph Theory Research (37 papers), Stochastic processes and statistical mechanics (26 papers), graph theory and CDMA systems (21 papers), Graph Labeling and Dimension Problems (14 papers), Computability, Logic, AI Algorithms (14 papers), semigroups and automata theory (12 papers) and Graph theory and applications (12 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (2.6k citations), Computational Theory and Mathematics (3.7k citations), Geometry and Topology (1.4k citations), Mathematical Physics (1.2k citations) and Computer Graphics and Computer-Aided Design (466 citations). Joel Spencer has collaborated with scholars based in United States, Hungary and Germany. Frequent co-authors include Noga Alon, Raissa M. D’Souza, Dimitris Achlioptas, Béla Bollobás, Oliver Riordan, Gábor Tusnády, Nicholas Wormald, P. Erdös, Boris Pittel and Daniel J. Kleitman. Their work appears in journals such as Journal of Combinatorial Theory Series A, Random Structures and Algorithms, Discrete Mathematics, COMBINATORICA and Journal of Combinatorial Theory Series B.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.