Chris Pollett

Publication Activity (10 Years)

Years Active: 1996-2023
Publications (10 Years): 8

Top Topics

Social Networks

Completely Automated

Top Venues

Peer-to-Peer Netw. Appl.

Publications

Thomas H. Austin, Katerina Potika, Chris Pollett
Autonomous Lending Organization on Ethereum with Credit Scoring. SVCC (2023)
Chris Pollett, Thomas H. Austin, Katerina Potika, Justin Rietz, Prashant Pardeshi
TontineCoin: Survivor-based Proof-of-Stake. Peer-to-Peer Netw. Appl. 15 (2) (2022)
Pratikkumar Prajapati, Chris Pollett
MRI-GAN: A Generalized Approach to Detect DeepFakes using Perceptual Image Assessment. CoRR (2022)
Chris Pollett, Thomas H. Austin, Katerina Potika, Justin Rietz
TontineCoin: Murder-Based Proof-of-Stake. DAPPS (2020)
Priyanka Kasbekar, Katerina Potika, Chris Pollett
Find me if You Can: Aligning Users in Different Social Networks. BigDataService (2020)
Kunal Deshmukh, Chris Pollett
Residual CNN Image Compression. ISVC (2) (2019)
Chris Pollett
On the finite axiomatizability of. Math. Log. Q. 64 (1-2) (2018)
Zayd Hammoudeh, Chris Pollett
Clustering-Based, Fully Automated Mixed-Bag Jigsaw Puzzle Solving. CAIP (2) (2017)
Chris Pollett
. Arch. Math. Log. 50 (3-4) (2011)
Chris Pollett, Eric Miles
Alternating Hierarchies for Time-Space Tradeoffs CoRR (2008)
Chris Pollett, Norman Danner
Circuit principles and weak pigeonhole variants. Theor. Comput. Sci. 383 (2-3) (2007)
Chris Pollett
Languages to diagonalize against advice classes. Comput. Complex. 14 (4) (2006)
Norman Danner, Chris Pollett
The weak pigeonhole principle for function classes in S^1_2 CoRR (2006)
Norman Danner, Chris Pollett
. Math. Log. Q. 52 (6) (2006)
Chris Pollett, Norman Danner
Circuit Principles and Weak Pigeonhole Variants. CATS (2005)
Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski, Cristopher Moore, Chris Pollett
On the computational power of probabilistic and quantum branching program. Inf. Comput. 203 (2) (2005)
Martina Simova, Mark Stamp, Chris Pollett
Stealthy Ciphertext. International Conference on Internet Computing (2005)
Norman Danner, Chris Pollett
Minimization and NP multifunctions. Theor. Comput. Sci. 318 (1-2) (2004)
Chris Pollett
Languages to diagonalize against advice classes Electron. Colloquium Comput. Complex. (014) (2004)
Arnold Beckmann, Chris Pollett, Samuel R. Buss
Ordinal notations and well-orderings in bounded arithmetic. Ann. Pure Appl. Log. 120 (1-3) (2003)
Chris Pollett
On the bounded version of Hilbert's tenth problem. Arch. Math. Log. 42 (5) (2003)
Chris Pollett
A theory for Log-Space and NLIN versus coNLIN. J. Symb. Log. 68 (4) (2003)
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]. Ann. Pure Appl. Log. 123 (1-3) (2003)
Chris Pollett, Randall Pruim
Strengths and Weaknesses of LH Arithmetic. Math. Log. Q. 48 (2) (2002)
Farid M. Ablayev, Cristopher Moore, Chris Pollett
Quantum and Stochastic Branching Programs of Bounded Width. ICALP (2002)
Chris Pollett
Nepomnjascij's Theorem and Independence Proofs in Bounded Arithmetic Electron. Colloquium Comput. Complex. (051) (2002)
Chris Pollett, Farid M. Ablayev, Cristopher Moore
Quantum and Stochastic Programs of Bounded Width Electron. Colloquium Comput. Complex. (013) (2002)
Chris Pollett
Multifunction algebras and the provability of PH. Ann. Pure Appl. Log. 104 (1-3) (2000)
Chris Pollett
+ exp Proofs into Weaker Systems. Math. Log. Q. 46 (2) (2000)
Frederic Green, Steven Homer, Chris Pollett
On the Complexity of Quantum ACC. Computational Complexity Conference (2000)
Chris Pollett
Structure and Definability in General Bounded Arithmetic Theories. Ann. Pure Appl. Log. 100 (1-3) (1999)
Jan Johannsen, Chris Pollett
On Proofs about Threshold Circuits and Counting Hierarchies. LICS (1998)
Chris Pollett
. Proof Complexity and Feasible Arithmetics (1996)