Samuel R. Buss

3.5k total citations
72 papers, 1.3k citations indexed

About

Samuel R. Buss is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Samuel R. Buss has authored 72 papers receiving a total of 1.3k indexed citations (citations by other indexed papers that have themselves been cited), including 50 papers in Computational Theory and Mathematics, 45 papers in Artificial Intelligence and 5 papers in Computer Networks and Communications. Recurrent topics in Samuel R. Buss's work include Logic, Reasoning, and Knowledge (34 papers), Logic, programming, and type systems (28 papers) and Computability, Logic, AI Algorithms (22 papers). Samuel R. Buss is often cited by papers focused on Logic, Reasoning, and Knowledge (34 papers), Logic, programming, and type systems (28 papers) and Computability, Logic, AI Algorithms (22 papers). Samuel R. Buss collaborates with scholars based in United States, United Kingdom and Germany. Samuel R. Buss's 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 and has published in prestigious journals such as Journal of Computational Physics, ACM Transactions on Graphics and Physics in Medicine and Biology.

In The Last Decade

Samuel R. Buss

66 papers receiving 1.2k citations

Peers

Countries citing papers authored by Samuel R. Buss

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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 of co-authors of Samuel R. Buss

This figure shows the co-authorship network connecting the top 25 collaborators of Samuel R. Buss. A scholar is included among the top collaborators of Samuel R. Buss based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Samuel R. Buss. Samuel R. Buss is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Gray: a ray tracing-based Monte Carlo simulator for PET 2018 ·Physics in Medicine and Biology ·(unknown), Peter D. Olcott, Samuel R. Buss, Craig S. Levin	1
2	Collapsing modular counting in bounded arithmetic and constant depth propositional proofs 2015 ·Transactions of the American Mathematical Society ·Samuel R. Buss, (unknown), (unknown)	13
3	Small Stone in Pool 2014 ·Logical Methods in Computer Science ·Samuel R. Buss, (unknown)	4
4	Propositional proofs and reductions betweenNPsearch problems 2012 ·Annals of Pure and Applied Logic ·Samuel R. Buss, (unknown)	11
5	TowardsNP–Pvia proof complexity and search 2011 ·Annals of Pure and Applied Logic ·Samuel R. Buss	23
6	Corrected upper bounds for free-cut elimination 2011 ·Theoretical Computer Science ·Arnold Beckmann, Samuel R. Buss	5
7	Lower complexity bounds in justification logic 2011 ·Annals of Pure and Applied Logic ·Samuel R. Buss, Roman Kuznets	4
8	The NP-hardness of finding a directed acyclic graph for regular resolution 2008 ·Theoretical Computer Science ·Samuel R. Buss, Jan Hoffmann	2
9	Mathematical Logic: Proof Theory, Type Theory and Constructive Mathematics 2005 ·Oberwolfach Reports ·Samuel R. Buss, Yiannis N. Moschovakis, Helmut Schwichtenberg	1
10	Separation results for the size of constant-depth propositional proofs 2005 ·Annals of Pure and Applied Logic ·Arnold Beckmann, Samuel R. Buss	11
11	Ordinal notations and well-orderings in bounded arithmetic 2002 ·Annals of Pure and Applied Logic ·Arnold Beckmann, (unknown), Samuel R. Buss	2
12	On the computational content of intuitionistic propositional proofs 2001 ·Annals of Pure and Applied Logic ·Samuel R. Buss, Pavel Pudlák	13
13	Bounded arithmetic, proof complexity and two papers of Parikh 1999 ·Annals of Pure and Applied Logic ·Samuel R. Buss	4
14	Proof complexity and feasible arithmetics : DIMACS workshop, April 21-24, 1996 1998 ·American Mathematical Society eBooks ·Paul Beame, Samuel R. Buss	1
15	Unprovability of consistency statements in fragments of bounded arithmetic 1995 ·Annals of Pure and Applied Logic ·Samuel R. Buss, (unknown)	12
16	Linear and O(n log n) time minimum-cost matching algorithms for quasi-convex tours 1994 ·Symposium on Discrete Algorithms ·Samuel R. Buss, P.N. Yianilos	6
17	On the Predictability of Coupled Automata: An Allegory about Chaos. 1991 ·Complex Systems ·Samuel R. Buss, Christos H. Papadimitriou, John N. Tsitsiklis	35
18	On truth-table reducibility to SAT 1991 ·Information and Computation ·Samuel R. Buss, Louise Hay	61
19	The undecidability of k-provability 1991 ·Annals of Pure and Applied Logic ·Samuel R. Buss	43
20	Resolution proofs of generalized pigeonhole principles 1988 ·Theoretical Computer Science ·Samuel R. Buss, György Turán	51

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.

Explore authors with similar magnitude of impact