Chris Pollett

According to our database, Chris Pollett authored at least 32 papers between 1996 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Autonomous Lending Organization on Ethereum with Credit Scoring.

Thomas H. Austin, Katerina Potika, Chris Pollett

Proceedings of the Silicon Valley Cybersecurity Conference, 2023

2022

TontineCoin: Survivor-based Proof-of-Stake.

Chris Pollett, Thomas H. Austin, Katerina Potika, Justin Rietz, Prashant Pardeshi

Peer-to-Peer Netw. Appl., 2022

MRI-GAN: A Generalized Approach to Detect DeepFakes using Perceptual Image Assessment.

Pratikkumar Prajapati, Chris Pollett

CoRR, 2022

2020

TontineCoin: Murder-Based Proof-of-Stake.

Chris Pollett, Thomas H. Austin, Katerina Potika, Justin Rietz

Proceedings of the 2nd IEEE International Conference on Decentralized Applications and Infrastructures, 2020

Find me if You Can: Aligning Users in Different Social Networks.

Priyanka Kasbekar, Katerina Potika, Chris Pollett

Proceedings of the 6th IEEE International Conference on Big Data Computing Service and Applications, 2020

2019

Residual CNN Image Compression.

Kunal Deshmukh, Chris Pollett

Proceedings of the Advances in Visual Computing, 2019

2018

On the finite axiomatizability of.

Chris Pollett

Math. Log. Q., 2018

2017

Clustering-Based, Fully Automated Mixed-Bag Jigsaw Puzzle Solving.

Zayd Hammoudeh, Chris Pollett

Proceedings of the Computer Analysis of Images and Patterns, 2017

2011

Conservative fragments of <i>S</i>¹₂ and <i>R</i>¹₂.

Chris Pollett

Arch. Math. Log., 2011

2008

Alternating Hierarchies for Time-Space Tradeoffs

Chris Pollett, Eric Miles

CoRR, 2008

2007

Circuit principles and weak pigeonhole variants.

Chris Pollett, Norman Danner

Theor. Comput. Sci., 2007

2006

The weak pigeonhole principle for function classes in S¹₂.

Norman Danner, Chris Pollett

Math. Log. Q., 2006

The weak pigeonhole principle for function classes in S^1_2

Norman Danner, Chris Pollett

CoRR, 2006

Languages to diagonalize against advice classes.

Chris Pollett

Comput. Complex., 2006

2005

On the computational power of probabilistic and quantum branching program.

Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski, Cristopher Moore, Chris Pollett

Inf. Comput., 2005

Stealthy Ciphertext.

Martina Simova, Mark Stamp, Chris Pollett

Proceedings of The 2005 International Conference on Internet Computing, 2005

2004

Minimization and NP multifunctions.

Norman Danner, Chris Pollett

Theor. Comput. Sci., 2004

2003

A theory for Log-Space and NLIN versus coNLIN.

Chris Pollett

J. Symb. Log., 2003

Ordinal notations and well-orderings in bounded arithmetic.

Arnold Beckmann, Chris Pollett, Samuel R. Buss

Ann. Pure Appl. Log., 2003

Erratum to "Ordinal notations and well-orderings in bounded arithmetic" [Annals of Pure and Applied Logic 120 (2003) 197-223].

Arnold Beckmann, Samuel R. Buss, Chris Pollett

Ann. Pure Appl. Log., 2003

On the bounded version of Hilbert's tenth problem.

Chris Pollett

Arch. Math. Log., 2003

2002

Counting, fanout and the complexity of quantum ACC.

Frederic Green, Steven Homer, Cristopher Moore, Christopher Pollett

Quantum Inf. Comput., 2002

Strengths and Weaknesses of LH Arithmetic.

Chris Pollett, Randall Pruim

Math. Log. Q., 2002

Nepomnjascij's Theorem and Independence Proofs in Bounded Arithmetic

Chris Pollett

Electron. Colloquium Comput. Complex., 2002

Quantum and Stochastic Programs of Bounded Width

Chris Pollett, Farid M. Ablayev, Cristopher Moore

Electron. Colloquium Comput. Complex., 2002

Quantum and Stochastic Branching Programs of Bounded Width.

Farid M. Ablayev, Cristopher Moore, Chris Pollett

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2000

Translating I-Delta₀ + exp Proofs into Weaker Systems.

Chris Pollett

Math. Log. Q., 2000

Multifunction algebras and the provability of PH.

Chris Pollett

Ann. Pure Appl. Log., 2000

On the Complexity of Quantum ACC.

Frederic Green, Steven Homer, Chris Pollett

Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000

1999

Structure and Definability in General Bounded Arithmetic Theories.

Chris Pollett

Ann. Pure Appl. Log., 1999

1998

On Proofs about Threshold Circuits and Counting Hierarchies.

Jan Johannsen, Chris Pollett

Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

1996

A propositional proof system for <i>Rⁱ₂</i>.

Chris Pollett

Proceedings of the Proof Complexity and Feasible Arithmetics, 1996