Bryant Tuckerman
Impact in
- Theoretical Computer Science top 10%
- History and Theory of Mathematics
-
- Analytic Number Theory Research
Papers in
-
- Coding theory and cryptography 2
- Quantum Computing Algorithms and Architecture 1
-
- Computability, Logic, AI Algorithms 2
- Co-authors
- Hugo Steinhaus (1 shared paper)J. L. Selfridge (2 shared papers)John Brillhart (2 shared papers)D. H. Lehmer (1 shared paper)Samuel S. Wagstaff (1 shared paper)J.W. Cooley (1 shared paper)Ramesh C. Agarwal (1 shared paper)Fred G. Gustavson (1 shared paper)
- Journals
- Mathematics of Computation (8 papers)IBM Journal of Research and Development (1 paper)IBM Systems Journal (1 paper)Proceedings of the National Academy of Sciences (1 paper)American Mathematical Monthly (1 paper)
- Partner nations
- United States
In The Last Decade
Bryant Tuckerman
10 papers receiving 169 citations
Peers
Comparison fields: 5 of 68
- Theoretical Computer Science 16
- Algebra and Number Theory 48
- Discrete Mathematics and Combinatorics 19
- Computational Theory and Mathematics 73
- Geometry and Topology 35
Countries citing papers authored by Bryant Tuckerman
This map shows the geographic impact of Bryant Tuckerman'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 Bryant Tuckerman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bryant Tuckerman more than expected).
Fields of papers citing papers by Bryant Tuckerman
This network shows the impact of papers produced by Bryant Tuckerman. 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 Bryant Tuckerman. The network helps show where Bryant Tuckerman may publish in the future.
Co-authors
The 13 scholars most cited alongside Bryant Tuckerman, 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 | 1951 | 68 | |
| 2 | 1988 | 66 | |
| 3 | 1986 | 28 | |
| 4 | 1971 | 16 | |
| 5 | 1973 | 10 | |
| 6 | 1955 | 9 | |
| 7 | 1973 | 6 | |
| 8 | 1980 | 5 | |
| 9 | 1973 | 4 | |
| 10 | 1985 | 4 | |
| 11 | 1973 | 2 | |
| 12 | 1975 | 2 | |
| 13 | 1969 | 1 | |
| 14 | 1973 | 1 | |
| 15 | 1969 | 1 |
About Bryant Tuckerman
Bryant Tuckerman is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Electrical and Electronic Engineering, Geometry and Topology and Theoretical Computer Science, having authored 15 papers that have together received 223 indexed citations. Recurring topics across this work include graph theory and CDMA systems (4 papers), History and Theory of Mathematics (3 papers), Mathematics and Applications (3 papers), Coding theory and cryptography (2 papers), Probability and Statistical Research (2 papers), Computability, Logic, AI Algorithms (2 papers), Analytic Number Theory Research (2 papers) and Quantum Computing Algorithms and Architecture (1 paper). The work is most often cited by research in Theoretical Computer Science (16 citations), Algebra and Number Theory (48 citations), Discrete Mathematics and Combinatorics (19 citations), Computational Theory and Mathematics (73 citations) and Geometry and Topology (35 citations). Bryant Tuckerman has collaborated with scholars based in United States. Frequent co-authors include Hugo Steinhaus, J. L. Selfridge, John Brillhart, D. H. Lehmer, Samuel S. Wagstaff, J.W. Cooley, Ramesh C. Agarwal, Fred G. Gustavson, James B. Shearer and John von Neumann. Their work appears in journals such as Mathematics of Computation, IBM Journal of Research and Development, IBM Systems Journal, Proceedings of the National Academy of Sciences and American Mathematical Monthly.
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.