Chris Pollett - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 30 from 30

2023

Autonomous Lending Organization on Ethereum with Credit ScoringThomas H. Austin, Katerina Potika, Chris Pollett. svcc 2023: 1-8 [doi]

2022

TontineCoin: Survivor-based Proof-of-StakeChris Pollett, Thomas H. Austin, Katerina Potika, Justin Rietz, Prashant Pardeshi. ppna, 15(2):988-1007, 2022. [doi]

2020

Find me if You Can: Aligning Users in Different Social NetworksPriyanka Kasbekar, Katerina Potika, Chris Pollett. bigdataservice 2020: 46-53 [doi]

TontineCoin: Murder-Based Proof-of-StakeChris Pollett, Thomas H. Austin, Katerina Potika, Justin Rietz. dappcon 2019: 82-87 [doi]

2019

Residual CNN Image CompressionKunal Deshmukh, Chris Pollett. isvc 2019: 371-382 [doi]

2018

On the finite axiomatizability ofChris Pollett. mlq, 64(1-2):6-24, 2018. [doi]

2017

Clustering-Based, Fully Automated Mixed-Bag Jigsaw Puzzle SolvingZayd Hammoudeh, Chris Pollett. caip 2017: 205-217 [doi]

2011

Conservative fragments of ::::S:::::::1:::::2:: and ::::R:::::::1:::::2::Chris Pollett. AML, 50(3-4):367-393, 2011. [doi]

2007

Circuit principles and weak pigeonhole variantsChris Pollett, Norman Danner. TCS, 383(2-3):115-131, 2007. [doi]

2006

The weak pigeonhole principle for function classes in S:::1:::::2::Norman Danner, Chris Pollett. mlq, 52(6):575-584, 2006. [doi]

Languages to diagonalize against advice classesChris Pollett. cc, 14(4):341-361, 2006. [doi]

2005

On the computational power of probabilistic and quantum branching programFarid M. Ablayev, Aida Gainutdinova, Marek Karpinski, Cristopher Moore, Chris Pollett. iandc, 203(2):145-162, 2005. [doi]

Circuit Principles and Weak Pigeonhole VariantsChris Pollett, Norman Danner. cats 2005: 31-40 [doi]

Stealthy CiphertextMartina Simova, Mark Stamp, Chris Pollett. ic 2005: 380-388

2004

Minimization and NP multifunctionsNorman Danner, Chris Pollett. TCS, 318(1-2):105-119, 2004. [doi]

Languages to diagonalize against advice classesChris Pollett. eccc, (014), 2004. [doi]

2003

Ordinal notations and well-orderings in bounded arithmeticArnold Beckmann, Chris Pollett, Samuel R. Buss. APAL, 120(1-3):197-223, 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. APAL, 123(1-3):291, 2003. [doi]

On the bounded version of Hilbert s tenth problemChris Pollett. AML, 42(5):469-488, 2003. [doi]

A theory for Log-Space and NLIN versus coNLINChris Pollett. JSYML, 68(4):1082-1090, 2003. [doi]

2002

2000

On the Complexity of Quantum ACCFrederic Green, Steven Homer, Chris Pollett. cocoon 2000: 250-262 [doi]

Multifunction algebras and the provability of PHChris Pollett. APAL, 104(1-3):279-302, 2000.

Translating I-Delta::0:: + exp Proofs into Weaker SystemsChris Pollett. mlq, 46(2):249-256, 2000. [doi]

1999

Structure and Definability in General Bounded Arithmetic TheoriesChris Pollett. APAL, 100(1-3):189-245, 1999.

1998

On Proofs about Threshold Circuits and Counting HierarchiesJan Johannsen, Chris Pollett. lics 1998: 444-452

1996

2Chris Pollett. dimacs 1998: 253-278

Sign in or sign up to see more results.

runs on WebDSL