Search the dblp DataBase
Samuel R. Buss :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Samuel R. Buss The Boolean Formula Value Problem Is in ALOGTIME [Citation Graph (2, 0)][DBLP ] STOC, 1987, pp:123-131 [Conf ] Samuel R. Buss , Christos H. Papadimitriou , John N. Tsitsiklis On the Predictability of Coupled Automata: An Allegory about Chaos [Citation Graph (1, 0)][DBLP ] FOCS, 1990, pp:788-793 [Conf ] Samuel R. Buss The Polynomial Hierarchy and Intuitionistic Bounded Arithmetic. [Citation Graph (0, 0)][DBLP ] Structure in Complexity Theory Conference, 1986, pp:77-103 [Conf ] Samuel R. Buss , Dima Grigoriev , Russell Impagliazzo , Toniann Pitassi Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (Abstract). [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1999, pp:5- [Conf ] Samuel R. Buss , Toniann Pitassi Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1996, pp:233-242 [Conf ] Samuel R. Buss , Toniann Pitassi Resolution and the Weak Pigeonhole Principle. [Citation Graph (0, 0)][DBLP ] CSL, 1997, pp:149-156 [Conf ] Pavel Pudlák , Samuel R. Buss How to Lie Without Being (Easily) Convicted and the Length of Proofs in Propositional Calculus. [Citation Graph (0, 0)][DBLP ] CSL, 1994, pp:151-162 [Conf ] Nathan Segerlind , Samuel R. Buss , Russell Impagliazzo A Switching Lemma for Small Restrictions and Lower Bounds for k - DNF Resolution. [Citation Graph (0, 0)][DBLP ] FOCS, 2002, pp:604-0 [Conf ] Samuel R. Buss Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization. [Citation Graph (0, 0)][DBLP ] Kurt Gödel Colloquium, 1997, pp:18-33 [Conf ] Samuel R. Buss On Herbrand's Theorem. [Citation Graph (0, 0)][DBLP ] LCC, 1994, pp:195-209 [Conf ] Maria Luisa Bonet , Samuel R. Buss On the Deduction Rule and the Number of Proof Lines [Citation Graph (0, 0)][DBLP ] LICS, 1991, pp:286-297 [Conf ] Samuel R. Buss , Bruce M. Kapron Resource-Bounded Continuity and Sequentiality for Type-Two Functionals. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:77-83 [Conf ] Michael Alekhnovich , Samuel R. Buss , Shlomo Moran , Toniann Pitassi Minimum Propositional Proof Length is NP-Hard to Linearly Approximate. [Citation Graph (0, 0)][DBLP ] MFCS, 1998, pp:176-184 [Conf ] Samuel R. Buss , Peter N. Yianilos Linear and O(n log n) Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours. [Citation Graph (0, 0)][DBLP ] SODA, 1994, pp:65-76 [Conf ] Samuel R. Buss The Polynomial Hierarchy and Fragments of Bounded Arithmetic (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1985, pp:285-290 [Conf ] Samuel R. Buss , Dima Grigoriev , Russell Impagliazzo , Toniann Pitassi Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes. [Citation Graph (0, 0)][DBLP ] STOC, 1999, pp:547-556 [Conf ] Arnold Beckmann , Samuel R. Buss Separation results for the size of constant-depth propositional proofs. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 2005, v:136, n:1-2, pp:30-55 [Journal ] Arnold Beckmann , Samuel R. Buss , Chris Pollett Erratum to "Ordinal notations and well-orderings in bounded arithmetic" [Annals of Pure and Applied Logic 120 (2003) 197-223]. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 2003, v:123, n:1-3, pp:291-0 [Journal ] Arnold Beckmann , Chris Pollett , Samuel R. Buss Ordinal notations and well-orderings in bounded arithmetic. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 2003, v:120, n:1-3, pp:197-223 [Journal ] Samuel R. Buss Propositional Consistency Proofs. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1991, v:52, n:1-2, pp:3-29 [Journal ] Samuel R. Buss The Undecidability of k-Provability. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1991, v:53, n:1, pp:75-102 [Journal ] Samuel R. Buss Intuitionistic Validity in T-Normal Kripke Structures. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1993, v:59, n:3, pp:159-173 [Journal ] Samuel R. Buss Relating the Bounded Arithmetic and Polynomial Time Hierarchies. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1995, v:75, n:1-2, pp:67-77 [Journal ] Samuel R. Buss Bounded Arithmetic, Proof Complexity and Two Papers of Parikh. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1999, v:96, n:1-3, pp:43-55 [Journal ] Samuel R. Buss , Aleksandar Ignjatovic Unprovability of Consistency Statements in Fragments of Bounded Arithmetic. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1995, v:74, n:3, pp:221-244 [Journal ] Samuel R. Buss , Grigori Mints The Complexity of the Disjunction and Existential Properties in Intuitionistic Logic. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1999, v:99, n:1-3, pp:93-104 [Journal ] Samuel R. Buss , Pavel Pudlák On the computational content of intuitionistic propositional proofs. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 2001, v:109, n:1-2, pp:49-63 [Journal ] Samuel R. Buss , Alexander S. Kechris , Anand Pillay , Richard A. Shore The prospects for mathematical logic in the twenty-first century. [Citation Graph (0, 0)][DBLP ] Bulletin of Symbolic Logic, 2001, v:7, n:2, pp:169-196 [Journal ] Samuel R. Buss , Russell Impagliazzo , Jan Krajícek , Pavel Pudlák , Alexander A. Razborov , Jiri Sgall Proof Complexity in Algebraic Systems and Bounded Depth Frege Systems with Modular Counting. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1997, v:6, n:3, pp:256-298 [Journal ] Samuel R. Buss , Alexander S. Kechris , Anand Pillay , Richard A. Shore The prospects for mathematical logic in the twenty-first century [Citation Graph (0, 0)][DBLP ] CoRR, 2002, v:0, n:, pp:- [Journal ] Samuel R. Buss , Grigore Rosu Incompleteness of Behavioral Logics. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2000, v:33, n:, pp:- [Journal ] Samuel R. Buss , Louise Hay On Truth-Table Reducibility to SAT [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1991, v:91, n:1, pp:86-102 [Journal ] Maria Luisa Bonet , Samuel R. Buss Size-Depth Tradeoffs for Boolean Fomulae. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1994, v:49, n:3, pp:151-155 [Journal ] Samuel R. Buss The Graph of Multiplication is Equivalent to Counting. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1992, v:41, n:4, pp:199-201 [Journal ] Samuel R. Buss , Dima Grigoriev , Russell Impagliazzo , Toniann Pitassi Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2001, v:62, n:2, pp:267-289 [Journal ] Samuel R. Buss , Toniann Pitassi Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1998, v:57, n:2, pp:162-171 [Journal ] Michael Alekhnovich , Samuel R. Buss , Shlomo Moran , Toniann Pitassi Minimum Propositional Proof Length Is NP-Hard to Linearly Approximate. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 2001, v:66, n:1, pp:171-191 [Journal ] Maria Luisa Bonet , Samuel R. Buss The Deduction Rule and Linear and Near-Linear Proof Simulations. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1993, v:58, n:2, pp:688-709 [Journal ] Samuel R. Buss Polynomial Size Proofs of the Propositional Pigeonhole Principle. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1987, v:52, n:4, pp:916-927 [Journal ] Samuel R. Buss On Gödel's Theorems on Lenghts of Proofs I: Number of Lines and Speedup for Arithmetics. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1994, v:59, n:3, pp:737-756 [Journal ] Samuel R. Buss The Modal Logic of Pure Provability. [Citation Graph (0, 0)][DBLP ] Notre Dame Journal of Formal Logic, 1990, v:31, n:2, pp:225-231 [Journal ] Maria Luisa Bonet , Samuel R. Buss The Serial Transitive Closure Problem for Trees. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:1, pp:109-122 [Journal ] Samuel R. Buss , S. Cook , A. Gupta , V. Ramachandran An Optimal Parallel Algorithm for Formula Evaluation. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1992, v:21, n:4, pp:755-780 [Journal ] Samuel R. Buss , Peter N. Yianilos Linear and O (n log n ) Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:27, n:1, pp:170-201 [Journal ] Nathan Segerlind , Samuel R. Buss , Russell Impagliazzo A Switching Lemma for Small Restrictions and Lower Bounds for k-DNF Resolution. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2004, v:33, n:5, pp:1171-1200 [Journal ] Samuel R. Buss Polynomial-size Frege and resolution proofs of st -connectivity and Hex tautologies. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:357, n:1-3, pp:35-52 [Journal ] Samuel R. Buss , György Turán Resolution Proofs of Generalized Pigeonhole Principles. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1988, v:62, n:3, pp:311-317 [Journal ] Samuel R. Buss , Bruce M. Kapron Resource-bounded continuity and sequentiality for type-two functionals. [Citation Graph (0, 0)][DBLP ] ACM Trans. Comput. Log., 2002, v:3, n:3, pp:402-417 [Journal ] Samuel R. Buss , Jay P. Fillmore Spherical averages and applications to spherical splines and interpolation. [Citation Graph (0, 0)][DBLP ] ACM Trans. Graph., 2001, v:20, n:2, pp:95-126 [Journal ] Samuel R. Buss Collision detection with relative screw motion. [Citation Graph (0, 0)][DBLP ] The Visual Computer, 2005, v:21, n:1-2, pp:41-58 [Journal ] The NP-Completeness of Reflected Fragments of Justification Logics. [Citation Graph (, )][DBLP ] Efficient Large-Scale Sweep and Prune Methods with AABB Insertion and Removal. [Citation Graph (, )][DBLP ] Pool resolution is NP-hard to recognize. [Citation Graph (, )][DBLP ] Preface. [Citation Graph (, )][DBLP ] Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning [Citation Graph (, )][DBLP ] Search in 0.079secs, Finished in 0.080secs