Sam Buss

1.3k total citations
35 papers, 483 citations indexed

About

Sam Buss is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Sam Buss has authored 35 papers receiving a total of 483 indexed citations (citations by other indexed papers that have themselves been cited), including 29 papers in Computational Theory and Mathematics, 22 papers in Artificial Intelligence and 3 papers in Computer Networks and Communications. Recurrent topics in Sam Buss's work include Complexity and Algorithms in Graphs (14 papers), semigroups and automata theory (11 papers) and Logic, programming, and type systems (10 papers). Sam Buss is often cited by papers focused on Complexity and Algorithms in Graphs (14 papers), semigroups and automata theory (11 papers) and Logic, programming, and type systems (10 papers). Sam Buss collaborates with scholars based in United States, Spain and United Kingdom. Sam Buss's co-authors include Russell Impagliazzo, Nathan Segerlind, Toniann Pitassi, Louise Hay, Stephen Cook, Vijaya Ramachandran, Ajay Gupta, Dima Grigoriev, Grigori Mint︠s︡ and Alexander Razborov and has published in prestigious journals such as Artificial Intelligence, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Sam Buss

29 papers receiving 441 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Sam Buss United States	13	392	295	51	23	22	35	483
H. Ramesh India	9	137 0.3×	122 0.4×	61 1.2×	2 0.1×	37 1.7×	14	294
Jean-Claude Bajard France	13	105 0.3×	497 1.7×	26 0.5×	8 0.3×		52	623
Abbas Mehrabian Canada	9	68 0.2×	124 0.4×	29 0.6×	3 0.1×	4 0.2×	27	258
Bertrand Estellon France	10	82 0.2×	30 0.1×	42 0.8×	7 0.3×	12 0.5×	18	267
Ragesh Jaiswal India	9	129 0.3×	211 0.7×	49 1.0×		14 0.6×	27	316
Daniel Dadush Netherlands	10	160 0.4×	92 0.3×	35 0.7×		39 1.8×	37	282
Christoph Dürr France	11	94 0.2×	69 0.2×	142 2.8×	46 2.0×	23 1.0×	49	413
Jan Pachl Canada	13	215 0.5×	99 0.3×	249 4.9×	4 0.2×	4 0.2×	40	541
William L. Kocay Canada	11	104 0.3×	58 0.2×	22 0.4×	3 0.1×	26 1.2×	39	245
Troy Lee Singapore	10	191 0.5×	243 0.8×	39 0.8×		4 0.2×	35	376

Countries citing papers authored by Sam Buss

Since Specialization

Citations

This map shows the geographic impact of Sam 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 Sam Buss with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sam Buss more than expected).

Fields of papers citing papers by Sam Buss

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Sam 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 Sam Buss. The network helps show where Sam Buss may publish in the future.

Co-authorship network of co-authors of Sam Buss

This figure shows the co-authorship network connecting the top 25 collaborators of Sam Buss. A scholar is included among the top collaborators of Sam 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 Sam Buss. Sam 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

Bonet, Marı́a Luisa, Sam Buss, Alexey Ignatiev, António Morgado, & João Marques‐Silva. (2021). Propositional proof systems based on maximum satisfiability. Artificial Intelligence. 300. 103552–103552. 5 indexed citations

Buss, Sam, et al.. (2020). Proof complexity of systems of (non-deterministic) decision trees and branching programs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 17. 1 indexed citations

Bonet, Marı́a Luisa, et al.. (2019). 2-D Tucker is PPA complete. Journal of Computer and System Sciences. 108. 92–103.

Buss, Sam, et al.. (2018). Short refutations for an equivalence‐chain principle for constant‐depth formulas. Mathematical logic quarterly. 64(6). 505–513.

Beckmann, Arnold & Sam Buss. (2017). The NP Search Problems of Frege and Extended Frege Proofs. ACM Transactions on Computational Logic. 18(2). 1–19. 2 indexed citations

Buss, Sam & Jan Johannsen. (2017). On Linear Resolution. 10(1). 23–35.

Bonet, Marı́a Luisa, et al.. (2016). QUASIPOLYNOMIAL SIZE FREGE PROOFS OF FRANKL’S THEOREM ON THE TRACE OF SETS. Journal of Symbolic Logic. 81(2). 687–710. 1 indexed citations

Buss, Sam. (2015). Quasipolynomial size proofs of the propositional pigeonhole principle. Theoretical Computer Science. 576. 77–84. 2 indexed citations

Beckmann, Arnold, Sam Buss, Sy‐David Friedman, Moritz Müller, & Neil Thapen. (2015). Cobham recursive set functions. Annals of Pure and Applied Logic. 167(3). 335–369. 1 indexed citations

10.

Buss, Sam, Douglas Cenzer, & Jeffrey B. Remmel. (2014). Sub-computable Boundedness Randomness. Logical Methods in Computer Science. Volume 10, Issue 4.

11.

Buss, Sam & Michael Soltys. (2013). Unshuffling a square is NP-hard. Journal of Computer and System Sciences. 80(4). 766–776. 12 indexed citations

12.

Buss, Sam, et al.. (2009). Efficient Large-Scale Sweep and Prune Methods with AABB Insertion and Removal. 191–198. 28 indexed citations

13.

Segerlind, Nathan, Sam Buss, & Russell Impagliazzo. (2004). A Switching Lemma for Small Restrictions and Lower Bounds for k-DNF Resolution. SIAM Journal on Computing. 33(5). 1171–1200. 42 indexed citations

14.

Razborov, Alexander, Michael Alekhnovich, Sam Buss, Shlomo Moran, & Toniann Pitassi. (2002). Minimum Propositional Proof Length Is NP-Hard to Linearly Approximate. Bulletin of Symbolic Logic. 8(2). 301–301. 1 indexed citations

15.

Segerlind, Nathan, Sam Buss, & Russell Impagliazzo. (2002). A Switching Lemma for Small Restrictions and Lower Bounds for k-DNF Resolution (extended abstract). 3 indexed citations

16.

Buss, Sam, et al.. (2002). On the predictability of coupled automata: an allegory about chaos. DSpace@MIT (Massachusetts Institute of Technology). 788–793. 16 indexed citations

17.

Buss, Sam, Dima Grigoriev, Russell Impagliazzo, & Toniann Pitassi. (2001). Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes. Journal of Computer and System Sciences. 62(2). 267–289. 41 indexed citations

18.

Alekhnovich, Michael, Sam Buss, Shlomo Moran, & Toniann Pitassi. (2001). Minimum propositional proof length is NP-hard to linearly approximate. Journal of Symbolic Logic. 66(1). 171–191. 20 indexed citations

19.

Buss, Sam & Grigori Mint︠s︡. (1999). The complexity of the disjunction and existential properties in intuitionistic logic. Annals of Pure and Applied Logic. 99(1-3). 93–104. 17 indexed citations

20.

Buss, Sam & Louise Hay. (1988). On truth-table reducibility to SAT and the difference hierarchy over NP. 224–233. 27 indexed citations

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