J. Spencer
Impact in
-
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
Papers in
-
- Limits and Structures in Graph Theory 17
-
- Graph theory and applications 9
- Advanced Topology and Set Theory 4
- Co-authors
- Ronald GrahamAvrim BlumP. ErdösDaniel J. KleitmanJennifer ChayesChristian BorgsAlbert R. MeyerRonald L. Rivest
- Journals
- COMBINATORICA (2 papers)Networks (2 papers)Journal of Combinatorial Theory Series A (2 papers)Random Structures and Algorithms (1 paper)Israel Journal of Mathematics (1 paper)
- Partner nations
- United StatesHungaryRussia
In The Last Decade
J. Spencer
39 papers receiving 809 citations
Peers
Comparison fields: 5 of 63
- Discrete Mathematics and Combinatorics 348
- Computational Theory and Mathematics 474
- Geometry and Topology 225
- Computer Graphics and Computer-Aided Design 61
- Mathematical Physics 135
Countries citing papers authored by J. Spencer
This map shows the geographic impact of J. 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 J. Spencer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites J. Spencer more than expected).
Fields of papers citing papers by J. Spencer
This network shows the impact of papers produced by J. 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 J. Spencer. The network helps show where J. Spencer may publish in the future.
Co-authorship network
The 25 scholars most cited alongside J. 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 | 2025 | 1 | |
| 2 | 2016 | 2 | |
| 3 | 2010 | 9 | |
| 4 | 2004 | 11 | |
| 5 | Random subgraphs of finite graphs. Part I: The scaling window under the triangle condition | 2003 | 5 |
| 6 | Random subgraphs of finite graphs. Part II: The lace expansion and the triangle condition | 2003 | 3 |
| 7 | Random subgraphs of finite graphs. Part III: The phase transition for the n-cube | 2003 | 5 |
| 8 | 2001 | 51 | |
| 9 | 1994 | 13 | |
| 10 | 1990 | 12 | |
| 11 | 1986 | 50 | |
| 12 | 1985 | 2 | |
| 13 | 1982 | 50 | |
| 14 | 1980 | 105 | |
| 15 | 1979 | 2 | |
| 16 | 1975 | 51 | |
| 17 | 1973 | 63 | |
| 18 | Pulse processes on signed digraphs: a tool for analyzing energy demand | 1972 | 3 |
| 19 | 1971 | 4 | |
| 20 | 1969 | 1 |
About J. Spencer
J. Spencer is a scholar working on Discrete Mathematics and Combinatorics, Geometry and Topology, Computational Theory and Mathematics, Algebra and Number Theory and Numerical Analysis, having authored 41 papers that have together received 928 indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (17 papers), Advanced Graph Theory Research (14 papers), Graph theory and applications (9 papers), Advanced Topology and Set Theory (4 papers), Analytic Number Theory Research (3 papers), Digital Image Processing Techniques (3 papers), graph theory and CDMA systems (3 papers) and Stochastic processes and statistical mechanics (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (348 citations), Computational Theory and Mathematics (474 citations), Geometry and Topology (225 citations), Computer Graphics and Computer-Aided Design (61 citations) and Mathematical Physics (135 citations). J. Spencer has collaborated with scholars based in United States, Hungary and Russia. Frequent co-authors include Ronald Graham, Avrim Blum, P. Erdös, Daniel J. Kleitman, Jennifer Chayes, Christian Borgs, Albert R. Meyer, Ronald L. Rivest, Harry Kesten and K. Vesztergombi. Their work appears in journals such as COMBINATORICA, Networks, Journal of Combinatorial Theory Series A, Random Structures and Algorithms and Israel Journal of Mathematics.
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.