Sam Buss - RankMe

63 papers A* 4A 6B 2Misc 1Journal 46Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A simple supercritical tradeoff between size and height in resolution. Inf. Process. Lett. Sam Buss, Neil Thapen
2025	J	`jnl`	A Logspace Constructive Proof of L=SL. CoRR Sam Buss, Anant Dhayal, Valentine Kabanets, Antonina Kolokolova, Sasank Mouli
2025	J	`jnl`	A Logspace Constructive Proof of L=SL. Electron. Colloquium Comput. Complex. Sam Buss, Anant Dhayal, Valentine Kabanets, Antonina Kolokolova, Sasank Mouli
2025	J	`jnl`	On the consistency of circuit lower bounds for non-deterministic time. J. Math. Log. Albert Atserias, Sam Buss, Moritz Müller
2025	A	`conf`	Redundancy Rules for MaxSAT. SAT Ilario Bonacina, Maria Luisa Bonet, Sam Buss, Massimo Lauria
2025	J	`jnl`	Redundancy rules for MaxSAT. CoRR Ilario Bonacina, Maria Luisa Bonet, Sam Buss, Massimo Lauria
2024	J	`jnl`	A Simple Supercritical Tradeoff between Size and Height in Resolution. Electron. Colloquium Comput. Complex. Sam Buss, Neil Thapen
2024	J	`jnl`	Extended Resolution Clause Learning via Dual Implication Points. CoRR Sam Buss, Jonathan Chung, Vijay Ganesh, Albert Oliveras
2024	J	`jnl`	Redundancy for MaxSAT. Electron. Colloquium Comput. Complex. Ilario Bonacina, Maria Luisa Bonet, Sam Buss, Massimo Lauria
2024	J	`jnl`	Regular resolution effectively simulates resolution. CoRR Sam Buss, Emre Yolcu
2024	J	`jnl`	Regular resolution effectively simulates resolution. Electron. Colloquium Comput. Complex. Sam Buss, Emre Yolcu
2024	J	`jnl`	Regular resolution effectively simulates resolution. Inf. Process. Lett. Sam Buss, Emre Yolcu
2023	J	`jnl`	On the Consistency of Circuit Lower Bounds for Non-Deterministic Time. CoRR Albert Atserias, Sam Buss, Moritz Müller
2023	A*	`conf`	On the Consistency of Circuit Lower Bounds for Non-deterministic Time. STOC Albert Atserias, Sam Buss, Moritz Müller
2023	—	`ch.`	Polynomially Verifiable Arithmetic. Logic, Automata, and Computational Complexity Sam Buss
2023	A	`conf`	TFNP Characterizations of Proof Systems and Monotone Circuits. ITCS Sam Buss, Noah Fleming, Russell Impagliazzo
2022	J	`jnl`	TFNP Characterizations of Proof Systems and Monotone Circuits. Electron. Colloquium Comput. Complex. Sam Buss, Noah Fleming, Russell Impagliazzo
2021	J	`jnl`	DRAT and Propagation Redundancy Proofs Without New Variables. Log. Methods Comput. Sci. Sam Buss, Neil Thapen
2021	J	`jnl`	Lower Bounds on OBDD Proofs with Several Orders. ACM Trans. Comput. Log. Sam Buss, Dmitry Itsykson, Alexander Knop, Artur Riazanov, Dmitry Sokolov
2021	—	`ch.`	Proof Complexity and SAT Solving. Handbook of Satisfiability Sam Buss, Jakob Nordström
2021	J	`jnl`	Propositional proof systems based on maximum satisfiability. Artif. Intell. Maria Luisa Bonet, Sam Buss, Alexey Ignatiev, António Morgado, João Marques-Silva
2020	J	`jnl`	2-D Tucker is PPA complete. J. Comput. Syst. Sci. James Aisenberg, Maria Luisa Bonet, Sam Buss
2020	J	`jnl`	Expander construction in VNC Ann. Pure Appl. Log. Sam Buss, Valentine Kabanets, Antonina Kolokolova, Michal Koucký
2020	J	`jnl`	Lower Bounds on OBDD Proofs with Several Orders. Electron. Colloquium Comput. Complex. Sam Buss, Dmitry Itsykson, Alexander Knop, Artur Riazanov, Dmitry Sokolov
2020	B	`conf`	Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs. CSL Sam Buss, Anupam Das, Alexander Knop
2019	A	`conf`	DRAT Proofs, Propagation Redundancy, and Extended Resolution. SAT Sam Buss, Neil Thapen
2019	J	`jnl`	DRAT and Propagation Redundancy Proofs Without New Variables. CoRR Sam Buss, Neil Thapen
2019	A	`conf`	DRMaxSAT with MaxHS: First Contact. SAT António Morgado, Alexey Ignatiev, Maria Luisa Bonet, João Marques-Silva, Sam Buss
2019	J	`jnl`	Feasible set functions have small circuits. Comput. Arnold Beckmann, Sam Buss, Sy-David Friedman, Moritz Müller, Neil Thapen
2019	J	`jnl`	On transformations of constant depth propositional proofs. Ann. Pure Appl. Log. Arnold Beckmann, Sam Buss
2019	J	`jnl`	Proof complexity of systems of (non-deterministic) decision trees and branching programs. CoRR Sam Buss, Anupam Das, Alexander Knop
2019	A*	`conf`	Strategies for Stable Merge Sorting. SODA Sam Buss, Alexander Knop
2018	A*	`conf`	MaxSAT Resolution With the Dual Rail Encoding. AAAI Maria Luisa Bonet, Sam Buss, Alexey Ignatiev, João Marques-Silva, António Morgado
2018	A	`conf`	Reordering Rule Makes OBDD Proof Systems Stronger. CCC Sam Buss, Dmitry Itsykson, Alexander Knop, Dmitry Sokolov
2018	J	`jnl`	Reordering Rule Makes OBDD Proof Systems Stronger. Electron. Colloquium Comput. Complex. Sam Buss, Dmitry Itsykson, Alexander Knop, Dmitry Sokolov
2018	J	`jnl`	Short proofs of the Kneser-Lovász coloring principle. Inf. Comput. James Aisenberg, Maria Luisa Bonet, Sam Buss, Adrian Craciun, Gabriel Istrate
2018	J	`jnl`	Short refutations for an equivalence-chain principle for constant-depth formulas. Math. Log. Q. Sam Buss, Ramyaa Ramyaa
2018	J	`jnl`	Strategies for Stable Merge Sorting. CoRR Sam Buss, Alexander Knop
2017	A	`conf`	Expander Construction in VNC1. ITCS Sam Buss, Valentine Kabanets, Antonina Kolokolova, Michal Koucký
2017	—	`conf`	Injection Structures Specified by Finite State Transducers. Computability and Complexity Sam Buss, Douglas Cenzer, Mia Minnes, Jeffrey B. Remmel
2017	J	`jnl`	The NP Search Problems of Frege and Extended Frege Proofs. ACM Trans. Comput. Log. Arnold Beckmann, Sam Buss
2017	J	`jnl`	Uniform proofs of ACC representations. Arch. Math. Log. Sam Buss
2016	J	`jnl`	Cobham recursive set functions. Ann. Pure Appl. Log. Arnold Beckmann, Sam Buss, Sy-David Friedman, Moritz Müller, Neil Thapen
2016	J	`jnl`	Expander Construction in VNC Electron. Colloquium Comput. Complex. Sam Buss, Valentine Kabanets, Antonina Kolokolova, Michal Koucký
2016	J	`jnl`	On Linear Resolution. J. Satisf. Boolean Model. Comput. Sam Buss, Jan Johannsen
2016	J	`jnl`	Quasipolynomial Size Frege Proofs of Frankl's Theorem on the Trace of Sets. J. Symb. Log. James Aisenberg, Maria Luisa Bonet, Sam Buss
2015	J	`jnl`	2-D Tucker is PPA complete. Electron. Colloquium Comput. Complex. James Aisenberg, Maria Luisa Bonet, Sam Buss
2015	J	`jnl`	Book Review: Matthias Baaz and Alexander Leitsch, Methods of Cut-Elimination. Stud Logica Sam Buss
2015	Misc	`conf`	Propositional Proofs in Frege and Extended Frege Systems (Abstract). CSR Sam Buss
2015	J	`jnl`	Quasipolynomial size proofs of the propositional pigeonhole principle. Theor. Comput. Sci. Sam Buss
2015	—	`conf`	Short Proofs of the Kneser-Lovász Coloring Principle. ICALP (2) James Aisenberg, Maria Luisa Bonet, Sam Buss, Adrian Craciun, Gabriel Istrate
2015	J	`jnl`	Short Proofs of the Kneser-Lovász Coloring Principle. CoRR James Aisenberg, Maria Luisa Bonet, Sam Buss, Adrian Craciun, Gabriel Istrate
2014	J	`jnl`	Improved Separations of Regular Resolution from Clause Learning Proof Systems. J. Artif. Intell. Res. Maria Luisa Bonet, Sam Buss, Jan Johannsen
2014	J	`jnl`	Sub-computable Boundedness Randomness. Log. Methods Comput. Sci. Sam Buss, Douglas Cenzer, Jeffrey B. Remmel
2014	J	`jnl`	Unshuffling a square is NP-hard. J. Comput. Syst. Sci. Sam Buss, Michael Soltys
2013	B	`conf`	Alternation Trading Proofs and Their Limitations. MFCS Sam Buss
2013	A*	`conf`	An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning (Extended Abstract). IJCAI Maria Luisa Bonet, Sam Buss
2013	J	`jnl`	Computability in Europe 2011. Ann. Pure Appl. Log. Sam Buss, Benedikt Löwe, Dag Normann, Ivan N. Soskov
2013	J	`jnl`	Probabilistic algorithmic randomness. J. Symb. Log. Sam Buss, Mia Minnes
2012	J	`jnl`	Improved Separations of Regular Resolution from Clause Learning Proof Systems CoRR Maria Luisa Bonet, Sam Buss, Jan Johannsen
2012	J	`jnl`	Unshuffling a Square is NP-Hard. CoRR Sam Buss, Michael Soltys
2011	J	`jnl`	Limits on Alternation-Trading Proofs for Time-Space Lower Bounds. Electron. Colloquium Comput. Complex. Sam Buss, Ryan Williams
2011	J	`jnl`	Strong isomorphism reductions in complexity theory. J. Symb. Log. Sam Buss, Yijia Chen, Jörg Flum, Sy-David Friedman, Moritz Müller