Samuel Buss | Academic Influence

Samuel Buss's AcademicInfluence.com Rankings

Samuel Buss

Computer Science

#1819

World Rank

#1886

Historical Rank

#868

USA Rank

computer-science Degrees

Samuel Buss

Mathematics

#1685

World Rank

#2709

Historical Rank

#689

USA Rank

Measure Theory

#1832

World Rank

#2239

Historical Rank

#573

USA Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Samuel Buss's Degrees

PhD Mathematics University of California, Berkeley
Bachelors Mathematics California Institute of Technology

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Samuel Buss Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Samuel R. Buss is an American computer scientist and mathematician who has made major contributions to the fields of mathematical logic, complexity theory and proof complexity. He is currently a professor at the University of California, San Diego, Department of Computer Science and Department of Mathematics.

(See a Problem?)

Samuel Buss's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Introduction to Inverse Kinematics with Jacobian Transpose , Pseudoinverse and Damped Least Squares methods (2004) (604)
The logic of the provability (1998) (396)
Spherical averages and applications to spherical splines and interpolation (2001) (314)
Selectively Damped Least Squares for Inverse Kinematics (2005) (303)
Handbook of proof theory (1998) (300)
The Boolean formula value problem is in ALOGTIME (1987) (283)
Polynomial size proofs of the propositional pigeonhole principle (1987) (187)
Chapter I - An Introduction to Proof Theory (1998) (168)
An Introduction to Proof Theory (2010) (143)
On Truth-Table Reducibility to SAT (1991) (119)
Linear gaps between degrees for the polynomial calculus modulo distinct primes (1999) (117)
Resolution Proofs of Generalized Pigeonhole Principles (1988) (113)
3D Computer Graphics: A Mathematical Introduction with OpenGL (2003) (109)
An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic (1994) (105)
Switching lemma for small restrictions and lower bounds for k-DNF resolution (2002) (99)
An Optimal Parallel Algorithm for Formula Evaluation (1992) (99)
Chapter II - First-Order Proof Theory of Arithmetic (1998) (91)
The Undecidability of k-Provability (1991) (90)
On Herbrand's Theorem (1994) (86)
Axiomatizations and Conservation Results for Fragments of Bounded Arithmetic ∗ (1990) (84)
Minimum propositional proof length is NP-hard to linearly approximate (1998) (83)
Resolution and the Weak Pigeonhole Principle (1997) (82)
Towards NP-P via proof complexity and search (2012) (74)
Cutting planes, connectivity, and threshold logic (1996) (71)
Entailment relations and distributive lattices (2000) (71)
On the predictability of coupled automata: an allegory about chaos (1990) (69)
Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization (1997) (68)
Relating the Bounded Arithmetic and Polynomial Time Hierarchies (1995) (67)
Proof complexity in algebraic systems and bounded depth Frege systems with modular counting (1997) (64)
Are there Hard Examples for Frege Systems (1995) (63)
The Polynomial Hierarchy and Intuitionistic Bounded Arithmetic (1986) (61)
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning (2008) (58)
On truth-table reducibility to SAT and the difference hierarchy over NP (1988) (52)
Size-Depth Tradeoffs for Boolean Fomulae (1994) (49)
Efficient Large-Scale Sweep and Prune Methods with AABB Insertion and Removal (2009) (48)
The deduction rule and linear and near-linear proof simulations (1993) (48)
FRAGMENTS OF APPROXIMATE COUNTING (2014) (43)
Good degree bounds on Nullstellensatz refutations of the induction principle (1996) (42)
The Prospects for Mathematical Logic in the Twenty-First Century (2001) (41)
Improved witnessing and local improvement principles for second-order bounded arithmetic (2014) (40)
How to Lie Without Being (Easily) Convicted and the Length of Proofs in Propositional Calculus (1994) (39)
Unprovability of Consistency Statements in Fragments of Bounded Arithmetic (1995) (37)
Some remarks on lengths of propositional proofs (1995) (36)
Bounded Arithmetic and Propositional Proof Complexity (1997) (35)
Accurate and efficient simulation of rigid-body rotations (2000) (35)
Unshuffling a square is NP-hard (2012) (33)
On Gödel's theorems on lengths of proofs I: Number of lines and speedup for arithmetics (1994) (33)
The Complexity of the Disjunction and Existential Properties in Intuitionistic Logic (1999) (33)
On Linear Resolution (2017) (32)
On the computational content of intuitionistic propositional proofs (2001) (32)
Lectures on Proof Theory (1996) (31)
Intuitionistic Validity in T-Normal Kripke Structures (1993) (30)
The NP Search Problems of Frege and Extended Frege Proofs (2017) (30)
Collapsing modular counting in bounded arithmetic and constant depth propositional proofs (2015) (30)
QUASIPOLYNOMIAL SIZE FREGE PROOFS OF FRANKL’S THEOREM ON THE TRACE OF SETS (2016) (29)
Incompleteness of Behavioral Logics (2000) (29)
Propositional Consistency Proofs (1991) (29)
Proof Complexity and SAT Solving (2021) (29)
Lower bounds on Nullstellensatz proofs via designs (1996) (28)
On Gödel’s Theorems on Lengths of Proofs II: Lower Bounds for Recognizing k Symbol Provability (1995) (25)
Propositional Proof Complexity An Introduction (1999) (25)
Linear and O(n log n) time minimum-cost matching algorithms for quasi-convex tours (1994) (25)
A conservation result concerning bounded theories and the collection axiom (1987) (24)
2-D Tucker is PPA complete (2020) (24)
GRAY: High Energy Photon Ray Tracer for PET Applications (2006) (23)
Lower complexity bounds in justification logic (2012) (22)
MaxSAT Resolution With the Dual Rail Encoding (2018) (22)
Improved Separations of Regular Resolution from Clause Learning Proof Systems (2012) (22)
3-D computer graphics : a mathematical introduction with OpenGL / Samuel R. Buss. (2003) (21)
Algorithms for Boolean Formula Evaluation and for Tree Contraction (2007) (20)
A Bipartite Matching Approach to Approximate String Comparison and Search (1995) (20)
Limits on Alternation Trading Proofs for Time–Space Lower Bounds (2012) (20)
The Modal Logic of Pure Provability (1990) (20)
Separation results for the size of constant-depth propositional proofs (2005) (19)
The witness function method and provably recursive functions of peano arithmetic (1995) (19)
On Model Theory for Intuitionistic Bounded Arithmetic with Applications to Independence Results (1990) (18)
Small Stone in Pool (2014) (18)
Propositional proofs and reductions between NP search problems (2012) (17)
Polynomial Local Search in the Polynomial Hierarchy and Witnessing in Fragments of Bounded Arithmetic (2009) (17)
Polynomial-size Frege and resolution proofs of st-connectivity and Hex tautologies (2006) (17)
Chip-Firing Games with Dirichlet Eigenvalues and Discrete Green's Functions (2002) (17)
Strategies for Stable Merge Sorting (2018) (17)
SAFE RECURSIVE SET FUNCTIONS (2015) (15)
The Superjump in Martin-Löf Type Theory (2002) (14)
Bounded Arithmetic, Proof Complexity and Two Papers of Parikh (1999) (14)
Cut Elimination In Situ (2015) (14)
Strong isomorphism reductions in complexity theory (2011) (13)
The Graph of Multiplication is Equivalent to Counting (1992) (13)
Nelson's Work on Logic and Foundations and Other Reflections on Foundations of Mathematics (2006) (13)
Reordering Rule Makes OBDD Proof Systems Stronger (2018) (13)
An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning (2012) (13)
Provably Total Functions in Bounded Arithmetic Theories . . . (1992) (12)
A note on bootstrapping intuitionistic bounded arithmetic (1993) (12)
3-D Computer Graphics (2003) (12)
DRAT Proofs, Propagation Redundancy, and Extended Resolution (2019) (11)
“Just Because”: Taking Belief Bases Seriously (2016) (11)
Arithmetic theories with prenex normal form induction (1997) (11)
No Counter-Example Interpretation and Interactive Computation, in (2007) (10)
The polynomial hierarchy and fragments of bounded arithmetic (1985) (10)
Short Proofs of the Kneser-Lovász Coloring Principle (2015) (9)
On the Bit-Comprehension Rule (2016) (9)
Corrected upper bounds for free-cut elimination (2011) (9)
Ordinal notations and well-orderings in bounded arithmetic (2003) (8)
Liftings of Homomorphisms Between Quotient Structures and Ulam Stability (2016) (8)
Provably Total Functions in Bounded Arithmetic Theories Ri 3 , U i 2 and V i 2 (2002) (8)
Resource-bounded continuity and sequentiality for type-two functionals (2000) (7)
Chapter Eight. Nelson's Work on Logic and Foundations and Other Reflections on the Foundations of Mathematics (2006) (7)
The NP-Completeness of Reflected Fragments of Justification Logics (2009) (7)
The depth of intuitionistic cut free proofs (2003) (6)
Collision detection with relative screw motion (2005) (6)
How Small Can the Set of Generics Be (2016) (5)
Cobham recursive set functions (2016) (5)
On Definability of Admissible Sets (2016) (5)
On the deduction rule and the number of proof lines (1991) (5)
Proof Complexity and Feasible Arithmetics (1997) (5)
Solving the Fisher-Wright and coalescence problems with a discrete Markov chain analysis (2004) (5)
DRMaxSAT with MaxHS: First Contact (2019) (5)
Probabilistic Algorithmic Randomness (2013) (5)
Bounded Arithmetic, Cryptography and Complexity (2008) (5)
The Application Of A Pattern Matching Algorithm to Searching Medical Record Text (1978) (4)
The Log Space Oracle Hierarchy Collapses DRAFT (1987) (4)
Expander Construction in VNC1 (2020) (4)
The Serial Transitive Closure Problem for Trees (1995) (4)
Propositional proof systems based on maximum satisfiability (2021) (4)
Classification of Subsheaves over GL-Algebras (2016) (4)
New separations in propositional proof complexity (2003) (3)
Proof complexity of systems of (non-deterministic) decision trees and branching programs (2019) (3)
On transformations of constant depth propositional proofs (2019) (3)
3D Computer Graphics (2003) (3)
Feasible Mathematics: A Mathematical Sciences Institute Workshop, Ithaca, New York, June 1989 (1990) (3)
The boolean formula value problem (1987) (3)
Dimension Theory and Smooth Stratification of Rigid Subanalytic Sets (2016) (3)
The NP-hardness of finding a directed acyclic graph for regular resolution (2008) (3)
Injection Structures Specified by Finite State Transducers (2017) (3)
Pool resolution is NP-hard to recognize (2009) (3)
Propositional Proofs in Frege and Extended Frege Systems (Abstract) (2015) (3)
Bounded Arithmetic and Constant Depth Frege Proofs (2004) (3)
Sub-computable Boundedness Randomness (2014) (2)
Adding Multiplication to an O-minimal Expansion of the Additive Group of Real Numbers (2016) (2)
Mathematical Logic: Proof Theory, Constructive Mathematics (2008) (2)
Solving the Minimum-Cost Matching Problem for Quasi-Convex Tours: An Efficient ANSI C Implementation (1994) (2)
Lower Bounds on OBDD Proofs with Several Orders (2021) (2)
Cardinal Invariants Associated with Predictors (2016) (2)
DRAT and Propagation Redundancy Proofs Without New Variables (2019) (2)
A Theorem on Countable Ordered Sets with an Application to Universal Graphs (2016) (1)
Incompleteness of Behavioral Logics -24 December 1999 (1999) (1)
Continuous Images of Coanalytic Sets (2016) (1)
The Computational Power of Bounded Arithmetic from the Predicative Viewpoint (2008) (1)
University of California, Irvine Irvine, California March 27–30, 2008 (2008) (1)
3-D Computer Graphics: Bibliography (2003) (1)
Expander Construction in VNC 1 . (2016) (1)
The Ramsey Structure of A-Determined Sets in a Saturated Universe (2016) (1)
Logic Colloquium '98 : proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, held in Prague, Czech Republic August 9-15, 1998 (2016) (1)
Collision Detection with Glide Rotations (2003) (1)
Gray: a ray tracing-based Monte Carlo simulator for PET (2018) (1)
The quantifier complexity of polynomial‐size iterated definitions in first‐order logic (2010) (1)
Mathematical Fuzzy Logic – State of Art (2016) (1)
Hartley Rogers’ 1965 Agenda (2016) (1)
SUB-COMPUTABLE BOUNDED RANDOMNESS (2014) (1)
Math 267 a-Propositional Proof Complexity Lecture # 6 : 4 February 2002 (2002) (0)
3-D Computer Graphics: Ray Tracing (2003) (0)
Erratum to "Ordinal notations and well-orderings in bounded arithmetic" [Annals of Pure and Applied Logic 120 (2003) 197-223] (2003) (0)
3-D Computer Graphics: Bézier Curves (2003) (0)
Short refutations for the equivalence-chain principle for constant-depth formulas Preliminary version — Comments appreciated (2017) (0)
Mathematical Logic: Proof Theory, Type Theory and Constructive Mathematics (2005) (0)
AnApplication of BooleanComplexity to Separation Problems inBoundedArithmetic (1998) (0)
3-D Computer Graphics: Plate section (2003) (0)
3-D Computer Graphics: Radiosity (2003) (0)
Uniform proofs of ACC representations (2017) (0)
3-D Computer Graphics: Mathematics Background (2003) (0)
Feasible set functions have small circuits (2019) (0)
Jan Krajíček. Forcing with random variables and proof complexity . London Mathematical Society Lecture Note Series, vol. 232. Cambridge University Press, 2011, xvi + 247 pp. (2012) (0)
Bolzano Medal awarded to Gaisi Takeuti (2016) (0)
3-D Computer Graphics: Color (2003) (0)
Lighting, Illumination, and Shading (2003) (0)
3-D Computer Graphics: B-Splines (2003) (0)
3-D Computer Graphics: Introduction (2003) (0)
Proof complexity and feasible arithmetics : DIMACS workshop, April 21-24, 1996 (1998) (0)
Preface (2009) (0)
2019 NORTH AMERICAN ANNUAL MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC City University of New York Graduate Center New York, New York, USA May 20–23, 2019 (2019) (0)
Jsl Review (0)
Version Incompleteness of Behavioral Logics (2000) (0)
Uniform proofs of ACC representations (2017) (0)
Corrected Upper Bounds for Free-Cut Elimination Preliminary Draft # 2 — Comments Appreciated (2009) (0)
The Friedberg Jump Inversion Theorem Revisited: A Study of Undefinable Cuts (2016) (0)
Threshold logic proof systems (2006) (0)
Substitution and Propositional Proof Complexity (2021) (0)
DRAT and Propagation Redundancy (2019) (0)
Subset-Bounded Recursion and a Circuit Model for Cobham Recursive Set Functions (2016) (0)
Michal Garĺık Model constructions for bounded arithmetic (2015) (0)
Computability in Europe 2011 (2013) (0)
1998 European Summer Meeting of the Association for Symbolic Logic (1999) (0)
Opening speech of Petr Vopěnka (2016) (0)
Mathematical Logic Pool resolution is NP-hard to recognize (2009) (0)
On the Consistency of Circuit Lower Bounds for Non-Deterministic Time (2023) (0)
Relative Splittings of in the-Enumeration Degrees (2016) (0)
Math 262A Lecture Notes - Sorting Networks (2013) (0)
3-D Computer Graphics: Texture Mapping (2003) (0)
TFNP Characterizations of Proof Systems and Monotone Circuits (2022) (0)
Incorporating Function Values into Quasi-Newton Updates (2006) (0)
Expander Construction in VNC (2017) (0)
3-D Computer Graphics: Preface (2003) (0)
3-D Computer Graphics: Animation and Kinematics (2003) (0)
Accurate and Eecient Simulation of Rigid Body Rotations Revised Version (1999) (0)
Qualitative and Probabilistic Models of Full Belief (2016) (0)
Berarducci, A. and Fornasiero, A., o-Minimal Cohomology: Finiteness and Invariance Results 2 (2009) 167 Burdges, J. and Cherlin, G., Semisimple Torsion in Groups of Finite Morley Rank 2 (2009) 183 (2009) (0)
Algorithmic Randomness with Probabilistic Strategies and Intermediate Success (2013) (0)
Short refutations for an equivalence‐chain principle for constant‐depth formulas (2018) (0)
5 Constructing bipartite vertex expanders (2016) (0)
Computability in Europe 2009 (2012) (0)
3-D Computer Graphics: RayTrace Software Package (2003) (0)
3-D Computer Graphics: Transformations and Viewing (2003) (0)
1998–99 Annual Meeting of the Association for Symbolic Logic (1999) (0)
Artin Approximation via the Model Theory of Cohen-Macaulay Rings (2016) (0)
Proof complexity (11w5103) (2011) (0)
Book Review: Matthias Baaz and Alexander Leitsch, Methods of Cut-Elimination (2015) (0)
Construction in VNC 1 ( Extended Abstract ) (2017) (0)
Theoretical Foundations of Applied SAT Solving ( 14 w 5101 ) January 19-24 , 2014 (2015) (0)
Reflections on the Last Delfino Problem (2016) (0)
Some Remarks on the Maximality of Inner Models (2016) (0)
OnModel Theory for Intuitionistic BoundedArithmetic withApplications to IndependenceResults (1999) (0)
Finitary Reductions for Local Predicativity, I: Recursively Regular Ordinals (2016) (0)
3-D Computer Graphics: Averaging and Interpolation (2003) (0)
Alternation Trading Proofs and Their Limitations (2013) (0)
3-D Computer Graphics: Intersection Testing (2003) (0)
2008 Annual Meeting of the Association for Symbolic Logic-University of California, Irvine-Irvine, California-March 27-30, 2008-Abstracts (2008) (0)
Sharpened lower bounds for cut elimination (2012) (0)
Kearnes, KA, Kiss, EW and Valeriote, MA, A geometric (1999) (0)
Construction in VNC 1 (2016) (0)
Cobham Recursive Set Functions Submitted to Annals of Pure and Applied Logic (2015) (0)
AnApplication ofBooleanComplexity to SeparationProblems inBoundedArithmetic (2007) (0)

This paper list is powered by the following services:

Other Resources About Samuel Buss

en.wikipedia.org

What Schools Are Affiliated With Samuel Buss?

Samuel Buss is affiliated with the following schools: