Sam Buss

Dikutip oleh

	Semua	Sejak 2020
Kutipan	9178	2161
indeks-h	45	22
indeks-i10	112	51

460

230

115

345

198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202531 77 67 67 82 94 140 105 109 141 116 162 183 178 200 205 260 290 290 296 292 293 304 285 329 330 341 361 379 422 393 391 417 428 418 446 61

Akses publik

Lihat semua

26 artikel

0 artikel

tersedia

tidak tersedia

Berdasarkan pada mandat pendanaan

Pengarang bersama

Maria Luisa BonetLSI, UPCEmail yang diverifikasi di lsi.upc.edu
Arnold BeckmannProfessor of Computer Science, Swansea UniversityEmail yang diverifikasi di swansea.ac.uk
Pavel Pudlákresearcher, Institute of Mathematics, CASEmail yang diverifikasi di math.cas.cz
Russell ImpagliazzoUCSDEmail yang diverifikasi di ucsd.edu
Peter N YianilosCIO Edgestream PartnersEmail yang diverifikasi di yianilos.com
Neil ThapenResearcher, Institute of Mathematics, Czech Academy of SciencesEmail yang diverifikasi di math.cas.cz
Stephen CookDepartment of Computer Science, University of TorontoEmail yang diverifikasi di cs.toronto.edu
Jan KrajicekCharles UniversityEmail yang diverifikasi di karlin.mff.cuni.cz
Jan JohannsenInstitut für Informatik, LMU MünchenEmail yang diverifikasi di ifi.lmu.de
Joao Marques-SilvaResearch Professor, ICREA, University of LleidaEmail yang diverifikasi di icrea.cat
Alexey IgnatievFaculty of Information Technology, Monash UniversityEmail yang diverifikasi di monash.edu
António MorgadoARSR, Inesc-ID; IST, Universidade de LisboaEmail yang diverifikasi di arsr.inesc-id.pt
Moritz MüllerEmail yang diverifikasi di uni-passau.de
Leszek KołodziejczykAssociate Professor, University of WarsawEmail yang diverifikasi di mimuw.edu.pl
Dima GrigorievDirecteur de recherche, CNRS, LilleEmail yang diverifikasi di math.univ-lille1.fr
Peter CloteBoston CollgeEmail yang diverifikasi di bc.edu
Jan HoffmannCarnegie Mellon UniversityEmail yang diverifikasi di cmu.edu
shlomo moranCS Department, Technion, IsraelEmail yang diverifikasi di cs.technion.ac.il
Christos H PAPADIMITRIOUColumbia UniversityEmail yang diverifikasi di columbia.edu
Jiri SgallComputer Science Institute of Charles UniversityEmail yang diverifikasi di iuuk.mff.cuni.cz

Ikuti

Sam Buss

Professor of Mathematics and Computer Science

Email yang diverifikasi di ucsd.edu - Beranda

Logic Theory of Computer Science


Judul Urutkan menurut kutipan Urutkan menurut tahun Urutkan menurut judul	Dikutip oleh Dikutip oleh	Tahun
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	1008	2004
Bounded Arithmetic SR Buss	878	1986
Selectively damped least squares for inverse kinematics SR Buss, JS Kim Journal of Graphics tools 10 (3), 37-49, 2005	450	2005
Spherical averages and applications to spherical splines and interpolation SR Buss, JP Fillmore ACM Transactions on Graphics (TOG) 20 (2), 95-126, 2001	400	2001
An introduction to proof theory SR Buss Handbook of proof theory 137, 1-78, 1998	367	1998
Handbook of proof theory SR Buss Elsevier, 1998	365	1998
3-D computer graphics: a mathematical introduction with OpenGL SR Buss Cambridge Univ Pr, 2003	326	2003
The Boolean formula value problem is in ALOGTIME SR Buss Proceedings of the nineteenth annual ACM symposium on Theory of computing …, 1987	325	1987
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	151	1999
On truth-table reducibility to SAT SR Buss, L Hay Information and Computation 91 (1), 86-102, 1991	148	1991
First-order proof theory of arithmetic SR Buss Studies in Logic and the Foundations of Mathematics 137, 79-147, 1998	142	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	136	1996
An optimal parallel algorithm for formula evaluation SR Buss, S Cook, A Gupta, V Ramachandran SIAM J. Comput. 21 (4), 755-780, 1992	132	1992
The undecidability of k-provability SR Buss Annals of Pure and Applied Logic 53 (1), 75-102, 1991	130	1991
Resolution proofs of generalized pigeonhole principles SR Buss, G Turán Theoretical Computer Science 62 (3), 311-317, 1988	127	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	113	1994
On Herbrand's theorem SR Buss International Workshop on Logic and Computational Complexity, 195-209, 1994	110	1994

Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.

Artikel 1–20

Kutipan per tahun

Kutipan duplikat

Kutipan yang digabung

Tambahkan pengarang bersamaPengarang bersama

Ikuti

Dikutip oleh

Pengarang bersama