Chris Pollett

35 papers A* 2A 1Journal 23Unranked 9
YearRankTypeTitle / Venue / Authors
2025 J jnl
Arithmetics within the Linear Time Hierarchy.
CoRR
Chris Pollett
2024 — conf
Multi-Label Text Classification with Transfer Learning.
BCD
Likhitha Yelamanchili, Ching-Seh Mike Wu, Chris Pollett, Robert Chun
2023 — conf
Autonomous Lending Organization on Ethereum with Credit Scoring.
SVCC
Thomas H. Austin, Katerina Potika, Chris Pollett
2022 J jnl
MRI-GAN: A Generalized Approach to Detect DeepFakes using Perceptual Image Assessment.
CoRR
Pratikkumar Prajapati, Chris Pollett
2022 J jnl
TontineCoin: Survivor-based Proof-of-Stake.
Peer-to-Peer Netw. Appl.
Chris Pollett, Thomas H. Austin, Katerina Potika, Justin Rietz, Prashant Pardeshi
2020 — conf
Find me if You Can: Aligning Users in Different Social Networks.
BigDataService
Priyanka Kasbekar, Katerina Potika, Chris Pollett
2020 — conf
TontineCoin: Murder-Based Proof-of-Stake.
DAPPS
Chris Pollett, Thomas H. Austin, Katerina Potika, Justin Rietz
2019 — conf
Residual CNN Image Compression.
ISVC (2)
Kunal Deshmukh, Chris Pollett
2018 J jnl
On the finite axiomatizability of.
Math. Log. Q.
Chris Pollett
2017 — conf
Clustering-Based, Fully Automated Mixed-Bag Jigsaw Puzzle Solving.
CAIP (2)
Zayd Hammoudeh, Chris Pollett
2011 J jnl
Conservative fragments of
Arch. Math. Log.
Chris Pollett
2008 J jnl
Alternating Hierarchies for Time-Space Tradeoffs
CoRR
Chris Pollett, Eric Miles
2007 J jnl
Circuit principles and weak pigeonhole variants.
Theor. Comput. Sci.
Chris Pollett, Norman Danner
2006 J jnl
Languages to diagonalize against advice classes.
Comput. Complex.
Chris Pollett
2006 J jnl
The weak pigeonhole principle for function classes in S
Math. Log. Q.
Norman Danner, Chris Pollett
2006 J jnl
The weak pigeonhole principle for function classes in S^1_2
CoRR
Norman Danner, Chris Pollett
2005 — conf
Circuit Principles and Weak Pigeonhole Variants.
CATS
Chris Pollett, Norman Danner
2005 J jnl
On the computational power of probabilistic and quantum branching program.
Inf. Comput.
Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski, Cristopher Moore, Chris Pollett
2005 — conf
Stealthy Ciphertext.
International Conference on Internet Computing
Martina Simova, Mark Stamp, Chris Pollett
2004 J jnl
Languages to diagonalize against advice classes
Electron. Colloquium Comput. Complex.
Chris Pollett
2004 J jnl
Minimization and NP multifunctions.
Theor. Comput. Sci.
Norman Danner, Chris Pollett
2003 J jnl
A theory for Log-Space and NLIN versus coNLIN.
J. Symb. Log.
Chris Pollett
2003 J jnl
Erratum to "Ordinal notations and well-orderings in bounded arithmetic" [Annals of Pure and Applied Logic 120 (2003) 197-223].
Ann. Pure Appl. Log.
Arnold Beckmann, Samuel R. Buss, Chris Pollett
2003 J jnl
On the bounded version of Hilbert's tenth problem.
Arch. Math. Log.
Chris Pollett
2003 J jnl
Ordinal notations and well-orderings in bounded arithmetic.
Ann. Pure Appl. Log.
Arnold Beckmann, Chris Pollett, Samuel R. Buss
2002 J jnl
Nepomnjascij's Theorem and Independence Proofs in Bounded Arithmetic
Electron. Colloquium Comput. Complex.
Chris Pollett
2002 A* conf
Quantum and Stochastic Branching Programs of Bounded Width.
ICALP
Farid M. Ablayev, Cristopher Moore, Chris Pollett
2002 J jnl
Quantum and Stochastic Programs of Bounded Width
Electron. Colloquium Comput. Complex.
Chris Pollett, Farid M. Ablayev, Cristopher Moore
2002 J jnl
Strengths and Weaknesses of LH Arithmetic.
Math. Log. Q.
Chris Pollett, Randall J. Pruim
2000 J jnl
Multifunction algebras and the provability of PH.
Ann. Pure Appl. Log.
Chris Pollett
2000 A conf
On the Complexity of Quantum ACC.
CCC
Frederic Green, Steven Homer, Chris Pollett
2000 J jnl
Translating I-Delta
Math. Log. Q.
Chris Pollett
1999 J jnl
Structure and Definability in General Bounded Arithmetic Theories.
Ann. Pure Appl. Log.
Chris Pollett
1998 A* conf
On Proofs about Threshold Circuits and Counting Hierarchies.
LICS
Jan Johannsen, Chris Pollett
1996 — conf
A propositional proof system for
Proof Complexity and Feasible Arithmetics
Chris Pollett