Introduction to inverse kinematics with jacobian transpose, pseudoinverse and damped least squares methods SR Buss University of California, San Diego, Typeset manuscript, available from http …, 2004 | 963 | 2004 |
Bounded Arithmetic SR Buss | 860 | 1986 |
Selectively damped least squares for inverse kinematics SR Buss, JS Kim Journal of Graphics tools 10 (3), 37-49, 2005 | 426 | 2005 |
Spherical averages and applications to spherical splines and interpolation SR Buss, JP Fillmore ACM Transactions on Graphics (TOG) 20 (2), 95-126, 2001 | 387 | 2001 |
An introduction to proof theory SR Buss Handbook of proof theory 137, 1-78, 1998 | 352 | 1998 |
Handbook of proof theory SR Buss Elsevier, 1998 | 351 | 1998 |
The Boolean formula value problem is in ALOGTIME SR Buss Proceedings of the nineteenth annual ACM symposium on Theory of computing …, 1987 | 315 | 1987 |
3-D computer graphics: a mathematical introduction with OpenGL SR Buss Cambridge Univ Pr, 2003 | 278 | 2003 |
Polynomial size proofs of the propositional pigeonhole principle SR Buss The Journal of Symbolic Logic 52 (4), 916-927, 1987 | 243 | 1987 |
Linear gaps between degrees for the polynomial calculus modulo distinct primes S Buss, D Grigoriev, R Impagliazzo, T Pitassi Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999 | 146 | 1999 |
On truth-table reducibility to SAT SR Buss, L Hay Information and Computation 91 (1), 86-102, 1991 | 146 | 1991 |
First-order proof theory of arithmetic SR Buss Studies in Logic and the Foundations of Mathematics 137, 79-147, 1998 | 133 | 1998 |
Proof complexity in algebraic systems and bounded depth Frege systems with modular counting S Buss, R Impagliazzo, J Krajíček, P Pudlák, AA Razborov, J Sgall Computational Complexity 6 (3), 256-298, 1996 | 129 | 1996 |
An optimal parallel algorithm for formula evaluation SR Buss, S Cook, A Gupta, V Ramachandran SIAM J. Comput. 21 (4), 755-780, 1992 | 128 | 1992 |
The undecidability of k-provability SR Buss Annals of Pure and Applied Logic 53 (1), 75-102, 1991 | 127 | 1991 |
Resolution proofs of generalized pigeonhole principles SR Buss, G Turán Theoretical Computer Science 62 (3), 311-317, 1988 | 125 | 1988 |
A Switching Lemma for Small Restrictions and Lower Bounds for k-DNF Resolution N Segerlind, S Buss, R Impagliazzo SIAM Journal on Computing 33 (5), 1171-1200, 2004 | 120 | 2004 |
Switching lemma for small restrictions and lower bounds for k-DNF resolution N Segerlind, S Buss, R Impagliazzo Foundations of Computer Science, 2002. Proceedings. The 43rd Annual IEEE …, 2002 | 120 | 2002 |
An application of Boolean complexity to separation problems in bounded arithmetic SR Buss, J Krajicek Proceedings of the London Mathematical Society 69 (1), 1-21, 1994 | 110 | 1994 |
On Herbrand's theorem SR Buss International Workshop on Logic and Computational Complexity, 195-209, 1994 | 108 | 1994 |