B. F. Caviness
-
- Polynomial and algebraic computation 11
- semigroups and automata theory 3
- Numerical Methods and Algorithms 3
- Theoretical Computer Science top 10%
- Geometry and Topology top 5%
- Advanced Differential Equations and Dynamical Systems 3
-
- Coding theory and cryptography 3
- Algorithms and Data Compression 3
-
- Mathematical and Theoretical Analysis 3
-
- Advanced Combinatorial Mathematics 3
- Co-authors
- Jeremy JohnsonErwin EngelerY. N. LakshmanMichael F. SingerB. David SaundersRichard J. FatemanGeorge E. CollinsAnn Boyle
- Journals
- Journal of the ACM (1 paper)SIAM Journal on Computing (2 papers)Information Processing Letters (2 papers)
- Partner nations
- United StatesSwitzerlandFrance
In The Last Decade
B. F. Caviness
22 papers receiving 415 citations
Peers
Comparison fields: 5 of 56
- Computational Theory and Mathematics 329
- Computational Mathematics 8
- Theoretical Computer Science 13
- Geometry and Topology 93
- Algebra and Number Theory 45
Countries citing papers authored by B. F. Caviness
This map shows the geographic impact of B. F. Caviness'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 B. F. Caviness with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites B. F. Caviness more than expected).
Fields of papers citing papers by B. F. Caviness
This network shows the impact of papers produced by B. F. Caviness. 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 B. F. Caviness. The network helps show where B. F. Caviness may publish in the future.
Co-authorship network
The 12 scholars most cited alongside B. F. Caviness, 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 | 1998 | 238 | |
| 2 | Proceedings of the 1996 international symposium on Symbolic and algebraic computation | 1996 | 49 |
| 3 | Future Directions for Research in Symbolic Computation | 1990 | 8 |
| 4 | 1986 | 7 | |
| 5 | 1981 | 2 | |
| 6 | 1979 | 18 | |
| 7 | 1979 | 2 | |
| 8 | 1978 | 3 | |
| 9 | 1978 | 13 | |
| 10 | Modular polynomial arithmetic in partial fraction decomposition | 1977 | 2 |
| 11 | Proceedings of the fourth ACM symposium on Symbolic and algebraic computation | 1976 | 11 |
| 12 | 1976 | 8 | |
| 13 | 1976 | 2 | |
| 14 | 1976 | 14 | |
| 15 | 1975 | 3 | |
| 16 | 1975 | 3 | |
| 17 | 1975 | 2 | |
| 18 | 1975 | 1 | |
| 19 | 1972 | 1 | |
| 20 | 1971 | 2 |
About B. F. Caviness
B. F. Caviness is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Theoretical Computer Science, having authored 23 papers that have together received 485 indexed citations. Recurring topics across this work include Polynomial and algebraic computation (11 papers), semigroups and automata theory (3 papers), Numerical Methods and Algorithms (3 papers), Coding theory and cryptography (3 papers), Mathematical and Theoretical Analysis (3 papers), Advanced Combinatorial Mathematics (3 papers), Advanced Differential Equations and Dynamical Systems (3 papers) and Algorithms and Data Compression (3 papers). The work is most often cited by research in Computational Theory and Mathematics (329 citations), Computational Mathematics (8 citations) and Theoretical Computer Science (13 citations). B. F. Caviness has collaborated with scholars based in United States, Switzerland and France. Frequent co-authors include Jeremy Johnson, Erwin Engeler, Y. N. Lakshman, Michael F. Singer, B. David Saunders, Richard J. Fateman, George E. Collins, Ann Boyle, Richard D. Jenks and A. C. Norman. Their work appears in journals such as Journal of the ACM, SIAM Journal on Computing and Information Processing Letters.
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.