Jason Teutsch

According to our database1, Jason Teutsch authored at least 39 papers between 2005 and 2019.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


On decentralized oracles for data availability.
CoRR, 2019

A scalable verification solution for blockchains.
CoRR, 2019

Interactive coin offerings.
CoRR, 2019

Retrofitting a two-way peg between blockchains.
CoRR, 2019

Bootstrapping a stable computation token.
CoRR, 2019

Enumerations including laconic enumerators.
Theor. Comput. Sci., 2017

Smart Contracts Make Bitcoin Mining Pools Vulnerable.
IACR Cryptol. ePrint Arch., 2017

SMART POOL : Practical Decentralized Pooled Mining.
IACR Cryptol. ePrint Arch., 2017

Closed left-r.e. sets.
Comput., 2017

SmartPool: Practical Decentralized Pooled Mining.
Proceedings of the 26th USENIX Security Symposium, 2017

A Brief on Short Descriptions.
SIGACT News, 2016

Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers.
Inf. Comput., 2016

How to verify computation with a rational network.
CoRR, 2016

When Cryptocurrencies Mine Their Own Business.
Proceedings of the Financial Cryptography and Data Security, 2016

On Approximate Decidability of Minimal Programs.
ACM Trans. Comput. Theory, 2015

Demystifying incentives in the consensus computer.
IACR Cryptol. ePrint Arch., 2015

Maximizing T-complexity.
Fundam. Informaticae, 2015

A savings paradox for integer-valued gambling strategies.
Int. J. Game Theory, 2014

Things that can be made into themselves.
Inf. Comput., 2014

Directed Multicut with linearly ordered terminals.
CoRR, 2014

Short lists for shortest descriptions in short time.
Comput. Complex., 2014

Monitor placement for large-scale systems.
Proceedings of the 19th ACM Symposium on Access Control Models and Technologies, 2014

Review of Algorithmic Randomness and Complexity by Downey and Hirschfeldt.
SIGACT News, 2013

Selection by Recursively Enumerable Sets.
Proceedings of the Theory and Applications of Models of Computation, 2013

Using Security Policies to Automate Placement of Network Intrusion Prevention.
Proceedings of the Engineering Secure Software and Systems - 5th International Symposium, 2013

Arithmetic complexity via effective names for random sequences.
ACM Trans. Comput. Log., 2012

How Powerful Are Integer-Valued Martingales?
Theory Comput. Syst., 2012

An incomplete set of shortest descriptions.
J. Symb. Log., 2012

How to build a probability-free casino.
Inf. Comput., 2012

Short lists for shorter programs in short time
CoRR, 2012

Translating the Cantor set by a random
CoRR, 2012

Constant Compression and Random Weights.
Comput., 2012

Transforming commodity security policies to enforce Clark-Wilson integrity.
Proceedings of the 28th Annual Computer Security Applications Conference, 2012

Index sets and universal numberings.
J. Comput. Syst. Sci., 2011

Enumerating randoms
CoRR, 2010

Immunity and Hyperimmunity for Sets of Minimal Indices.
Notre Dame J. Formal Log., 2008

Noncomputable Spectral Sets
CoRR, 2007

On the Turing degrees of minimal index sets.
Ann. Pure Appl. Log., 2007

On the minimal pseudo-codewords of codes from finite geometries.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005