Samuel R. Buss
- Computational Theory and Mathematics top 0.5%
- Computability, Logic, AI Algorithms 22
- Complexity and Algorithms in Graphs 15
- Formal Methods in Verification 11
- semigroups and automata theory 9
- Advanced Algebra and Logic 6
- Artificial Intelligence top 2%
- Logic, Reasoning, and Knowledge 34
- Logic, programming, and type systems 28
- Algorithms and Data Compression 4
- Theoretical Computer Science top 10%
- Co-authors
- Jin-Su KimJay P. FillmoreLouise HayGyörgy TuránJan Krajı́čekArnold BeckmannPeter CloteMarı́a Luisa Bonet
- Cited by
- Computational Theory and MathematicsComputer Graphics and Computer-Aided DesignArtificial Intelligence
- Journals
- Journal of Computational Physics (1 paper)ACM Transactions on Graphics (1 paper)Physics in Medicine and Biology (1 paper)
- Partner nations
- United StatesUnited KingdomGermany
In The Last Decade
Samuel R. Buss
66 papers receiving 1.2k citations
Peers
Comparison fields: 5 of 102
- Computational Theory and Mathematics 657
- Computer Graphics and Computer-Aided Design 97
- Artificial Intelligence 565
- Theoretical Computer Science 15
- Control and Systems Engineering 267
Countries citing papers authored by Samuel R. Buss
This map shows the geographic impact of Samuel R. Buss'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 Samuel R. Buss with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Samuel R. Buss more than expected).
Fields of papers citing papers by Samuel R. Buss
This network shows the impact of papers produced by Samuel R. Buss. 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 Samuel R. Buss. The network helps show where Samuel R. Buss may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Samuel R. Buss, 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 | 1 | |
| 2 | 2015 | 13 | |
| 3 | 2014 | 4 | |
| 4 | 2012 | 11 | |
| 5 | 2011 | 23 | |
| 6 | 2011 | 5 | |
| 7 | 2011 | 4 | |
| 8 | 2008 | 2 | |
| 9 | 2005 | 1 | |
| 10 | 2005 | 11 | |
| 11 | 2002 | 2 | |
| 12 | 2001 | 13 | |
| 13 | 1999 | 4 | |
| 14 | Proof complexity and feasible arithmetics : DIMACS workshop, April 21-24, 1996 | 1998 | 1 |
| 15 | 1995 | 12 | |
| 16 | 1994 | 6 | |
| 17 | On the Predictability of Coupled Automata: An Allegory about Chaos. | 1991 | 35 |
| 18 | 1991 | 61 | |
| 19 | 1991 | 43 | |
| 20 | 1988 | 51 |
About Samuel R. Buss
Samuel R. Buss is a scholar working on Computational Theory and Mathematics, Theoretical Computer Science and Artificial Intelligence, having authored 72 papers that have together received 1.3k indexed citations. Recurring topics across this work include Logic, Reasoning, and Knowledge (34 papers), Logic, programming, and type systems (28 papers), Computability, Logic, AI Algorithms (22 papers), Complexity and Algorithms in Graphs (15 papers), Formal Methods in Verification (11 papers), semigroups and automata theory (9 papers), Advanced Algebra and Logic (6 papers) and Algorithms and Data Compression (4 papers). The work is most often cited by research in Computational Theory and Mathematics (657 citations), Computer Graphics and Computer-Aided Design (97 citations) and Artificial Intelligence (565 citations). Samuel R. Buss has collaborated with scholars based in United States, United Kingdom and Germany. Frequent co-authors include Jin-Su Kim, Jay P. Fillmore, Louise Hay, György Turán, Jan Krajı́ček, Arnold Beckmann, Peter Clote, Marı́a Luisa Bonet, John N. Tsitsiklis and Christos H. Papadimitriou. Their work appears in journals such as Journal of Computational Physics, ACM Transactions on Graphics and Physics in Medicine and Biology.
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.