default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChris Pollett
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c11]Thomas H. Austin, Katerina Potika
, Chris Pollett:
Autonomous Lending Organization on Ethereum with Credit Scoring. SVCC 2023: 1-8- 2022
- [j17]Chris Pollett, Thomas H. Austin, Katerina Potika, Justin Rietz, Prashant Pardeshi:
TontineCoin: Survivor-based Proof-of-Stake. Peer-to-Peer Netw. Appl. 15(2): 988-1007 (2022) - [i6]Pratikkumar Prajapati, Chris Pollett:
MRI-GAN: A Generalized Approach to Detect DeepFakes using Perceptual Image Assessment. CoRR abs/2203.00108 (2022) - 2020
- [c10]Priyanka Kasbekar, Katerina Potika, Chris Pollett:
Find me if You Can: Aligning Users in Different Social Networks. BigDataService 2020: 46-53 - [c9]Chris Pollett, Thomas H. Austin, Katerina Potika, Justin Rietz:
TontineCoin: Murder-Based Proof-of-Stake. DAPPS 2020: 82-87
2010 – 2019
- 2019
- [c8]Kunal Deshmukh, Chris Pollett:
Residual CNN Image Compression. ISVC (2) 2019: 371-382 - 2018
- [j16]Chris Pollett:
On the finite axiomatizability of. Math. Log. Q. 64(1-2): 6-24 (2018) - 2017
- [c7]Zayd Hammoudeh, Chris Pollett:
Clustering-Based, Fully Automated Mixed-Bag Jigsaw Puzzle Solving. CAIP (2) 2017: 205-217 - 2011
- [j15]Chris Pollett:
Conservative fragments of S12 and R12. Arch. Math. Log. 50(3-4): 367-393 (2011)
2000 – 2009
- 2008
- [i5]Chris Pollett, Eric Miles:
Alternating Hierarchies for Time-Space Tradeoffs. CoRR abs/0801.1307 (2008) - 2007
- [j14]Chris Pollett, Norman Danner:
Circuit principles and weak pigeonhole variants. Theor. Comput. Sci. 383(2-3): 115-131 (2007) - 2006
- [j13]Chris Pollett:
Languages to diagonalize against advice classes. Comput. Complex. 14(4): 341-361 (2006) - [j12]Norman Danner, Chris Pollett:
The weak pigeonhole principle for function classes in S12. Math. Log. Q. 52(6): 575-584 (2006) - [i4]Norman Danner, Chris Pollett:
The weak pigeonhole principle for function classes in S^1_2. CoRR abs/cs/0608039 (2006) - 2005
- [j11]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): 145-162 (2005) - [c6]Chris Pollett, Norman Danner:
Circuit Principles and Weak Pigeonhole Variants. CATS 2005: 31-40 - [c5]Martina Simova, Mark Stamp, Chris Pollett:
Stealthy Ciphertext. International Conference on Internet Computing 2005: 380-388 - 2004
- [j10]Norman Danner, Chris Pollett:
Minimization and NP multifunctions. Theor. Comput. Sci. 318(1-2): 105-119 (2004) - [i3]Chris Pollett:
Languages to diagonalize against advice classes. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j9]Chris Pollett:
On the bounded version of Hilbert's tenth problem. Arch. Math. Log. 42(5): 469-488 (2003) - [j8]Arnold Beckmann, Chris Pollett, Samuel R. Buss:
Ordinal notations and well-orderings in bounded arithmetic. Ann. Pure Appl. Log. 120(1-3): 197-223 (2003) - [j7]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): 291- (2003) - [j6]Chris Pollett:
A theory for Log-Space and NLIN versus coNLIN. J. Symb. Log. 68(4): 1082-1090 (2003) - 2002
- [j5]Chris Pollett, Randall Pruim:
Strengths and Weaknesses of LH Arithmetic. Math. Log. Q. 48(2): 221-243 (2002) - [j4]Frederic Green, Steven Homer, Cristopher Moore, Christopher Pollett:
Counting, fanout and the complexity of quantum ACC. Quantum Inf. Comput. 2(1): 35-65 (2002) - [c4]Farid M. Ablayev, Cristopher Moore, Chris Pollett:
Quantum and Stochastic Branching Programs of Bounded Width. ICALP 2002: 343-354 - [i2]Chris Pollett, Farid M. Ablayev, Cristopher Moore:
Quantum and Stochastic Programs of Bounded Width. Electron. Colloquium Comput. Complex. TR02 (2002) - [i1]Chris Pollett:
Nepomnjascij's Theorem and Independence Proofs in Bounded Arithmetic. Electron. Colloquium Comput. Complex. TR02 (2002) - 2000
- [j3]Chris Pollett:
Multifunction algebras and the provability of PH. Ann. Pure Appl. Log. 104(1-3): 279-302 (2000) - [j2]Chris Pollett:
Translating I-Delta0 + exp Proofs into Weaker Systems. Math. Log. Q. 46(2): 249-256 (2000) - [c3]Frederic Green, Steven Homer, Chris Pollett:
On the Complexity of Quantum ACC. CCC 2000: 250-262
1990 – 1999
- 1999
- [j1]Chris Pollett:
Structure and Definability in General Bounded Arithmetic Theories. Ann. Pure Appl. Log. 100(1-3): 189-245 (1999) - 1998
- [c2]Jan Johannsen, Chris Pollett:
On Proofs about Threshold Circuits and Counting Hierarchies. LICS 1998: 444-452 - 1996
- [c1]Chris Pollett:
A propositional proof system for Ri2. Proof Complexity and Feasible Arithmetics 1996: 253-277
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
