|
[1]
| |
Sanjay Jain and Jason Teutsch.
Enumerations
including laconic enumerators.
Theoretical Computer Science, 700:89-95, 2017.
[ .pdf ]
|
| |
|
[2]
| |
Sanjay Jain, Frank Stephan, and Jason Teutsch.
Closed left-r.e. sets.
Computability, 6(1):1-21, 2017.
[ .pdf ]
|
| |
|
[3]
| |
George Barmpalias, Andrew Lewis-Pye, and Jason Teutsch.
Lower bounds on the
redundancy in computations from random oracles via betting strategies with
restricted wagers.
Information and Computation, 251:287-300, December 2016.
[ .pdf ]
|
| |
|
[4]
| |
Jason Teutsch and Marius Zimand.
On approximate decidability
of minimal programs.
ACM Transactions on Computational Theory, 7(4):17:1-17:16,
August 2015.
[ .pdf ]
|
| |
|
[5]
| |
Greg Clark and Jason Teutsch.
Maximizing
T-complexity.
Fundamenta Informaticae, 139(1):1-19, 2015.
[ .pdf ]
|
| |
|
[6]
| |
Jason Teutsch.
Short lists for
shortest descriptions in short time.
Computational Complexity, 23(4):565-583, December 2014.
[ .pdf ]
|
| |
|
[7]
| |
Frank Stephan and Jason Teutsch.
Things that can be
made into themselves.
Information and Computation, 237:174-186, October 2014.
[ .pdf ]
|
| |
|
[8]
| |
Randall Dougherty, Jack H. Lutz, Daniel R. Mauldin, and Jason Teutsch.
Translating
the Cantor set by a random real.
Transactions of the American Mathematical Society,
366:3027-3041, 2014.
[ .pdf ]
|
| |
|
[9]
| |
Jason Teutsch.
A savings paradox
for integer-valued gambling strategies.
International Journal of Game Theory, 43(1):145-151, February
2014.
[ .pdf ]
|
| |
|
[10]
| |
Wolfgang Merkle and Jason Teutsch.
Constant compression and
random weights.
Computability, 1(2):153-169, 2012.
[ .pdf ]
|
| |
|
[11]
| |
Bjørn Kjos-Hanssen, Frank Stephan, and Jason Teutsch.
Arithmetic
complexity via effective names for random sequences.
ACM Transactions on Computational Logic, 13(3):24:1-24:18,
August 2012.
[ .pdf ]
|
| |
|
[12]
| |
Frank Stephan and Jason Teutsch.
An incomplete
set of shortest descriptions.
The Journal of Symbolic Logic, 77(1):291-307, March 2012.
[ .pdf ]
|
| |
|
[13]
| |
Adam Chalcraft, Randall Dougherty, Chris Freiling, and Jason Teutsch.
How to build a
probability-free casino.
Information and Computation, 211:160-164, February 2012.
[ .pdf ]
|
| |
|
[14]
| |
Laurent Bienvenu, Frank Stephan, and Jason Teutsch.
How powerful are
integer-valued martingales?
Theory of Computing Systems, 51(3):330-351, October 2012.
Special issue for CiE 2010.
[ .pdf ]
|
| |
|
[15]
| |
Sanjay Jain, Frank Stephan, and Jason Teutsch.
Index sets and
universal numberings.
Journal of Computer and System Sciences, 77(4):760-773, July
2011.
[ .pdf ]
|
| |
|
[16]
| |
Frank Stephan and Jason Teutsch.
Immunity and
hyperimmunity for sets of minimal indices.
Notre Dame Journal of Formal Logic, 49(2):107-125, 2008.
[ .pdf ]
|
| |
|
[17]
| |
Jason Teutsch.
On the Turing
degrees of minimal index sets.
Annals of Pure and Applied Logic, 148:63-80, September 2007.
[ .pdf ]
|
| |
|
[1]
| |
Jason Teutsch and Christian Reitwießner.
A scalable
verification solution for blockchains.
In Aspects of Computation and Automata Theory with
Applications, volume 42 of Lecture Notes Series, Institute for
Mathematical Sciences, National University of Singapore, pages 377-424.
World Scientific, November 2023.
[ http |
.pdf ]
|
| |
|
[2]
| |
Sanjay Jain, Prateek Saxena, Frank Stephan, and Jason Teutsch.
How to verify
computation with a rational network.
In Aspects of Computation and Automata Theory with
Applications, volume 42 of Lecture Notes Series, Institute for
Mathematical Sciences, National University of Singapore, pages 283-313.
World Scientific, November 2023.
[ .pdf ]
|
| |
|
[3]
| |
Loi Luu, Yaron Velner, Jason Teutsch, and Prateek Saxena.
SmartPool:
Practical Decentralized Pooled Mining.
In 26th USENIX Security Symposium (USENIX 17), pages
1409-1426, Vancouver, BC, 2017. USENIX Association.
[ http |
.pdf ]
|
| |
|
[4]
| |
Yaron Velner, Jason Teutsch, and Loi Luu.
Smart contracts
make Bitcoin mining pools vulnerable.
In Financial Cryptography and Data Security (BITCOIN 2017),
pages 298-316. Springer Cham, 2017.
To appear in 4th Workshop on Bitcoin and Blockchain Research.
[ .pdf ]
|
| |
|
[5]
| |
Jason Teutsch, Sanjay Jain, and Prateek Saxena.
When
cryptocurrencies mine their own business.
In Financial Cryptography and Data Security: 20th International
Conference (FC 2016) Christ Church, Barbados, pages 499-514. Springer
Berlin / Heidelberg, 2017.
[ .pdf ]
|
| |
|
[6]
| |
Loi Luu, Jason Teutsch, Raghav Kulkarni, and Prateek Saxena.
Demystifying
incentives in the consensus computer.
In Proceedings of the 22nd ACM SIGSAC Conference on Computer and
Communications Security (CCS 2015), pages 706-719, New York, NY, USA, 2015.
ACM.
[ .pdf ]
|
| |
|
[7]
| |
Nirupama Talele, Jason Teutsch, Robert Erbacher, and Trent Jaeger.
Monitor placement
for large-scale systems.
In Proceedings of the 19th ACM Symposium on Access Control
Models and Technologies (SACMAT 2014), pages 29-40, New York, NY, USA,
2014. ACM.
[ .pdf ]
|
| |
|
[8]
| |
Wolfgang Merkle, Frank Stephan, Jason Teutsch, Wei Wang, and Yue Yang.
Selection by
recursively enumerable sets.
In Theory and Applications of Models of Computation (TAMC
2013), volume 7876 of Lecture Notes in Computer Science, pages
144-155. Springer, Berlin / Heidelberg, 2013.
[ .pdf ]
|
| |
|
[9]
| |
Nirupama Talele, Jason Teutsch, Trent Jaeger, and Robert F. Erbacher.
Using security
policies to automate placement of network intrusion prevention.
In Engineering Secure Software and Systems (ESSoS 2013), volume
7781 of Lecture Notes in Computer Science, pages 17-32. Springer,
Berlin / Heidelberg, 2013.
[ .pdf ]
|
| |
|
[10]
| |
Divya Muthukumaran, Sandra Rueda, Nirupama Talele, Hayawardh Vijayakumar, Trent
Jaeger, Jason Teutsch, and Nigel Edwards.
Transforming
commodity security policies to enforce Clark-Wilson integrity.
In Proceedings of the 28th Annual Computer Security Applications
Conference (ACSAC 2012), December 2012.
[ .pdf ]
|
| |
|
[11]
| |
Wolfgang Merkle and Jason Teutsch.
Constant
compression and random weights.
In 29th International Symposium on Theoretical Aspects of
Computer Science (STACS 2012), volume 14 of Leibniz International
Proceedings in Informatics (LIPIcs), pages 172-181, Dagstuhl, Germany,
2012.
[ .pdf ]
|
| |
|
[12]
| |
Sanjay Jain, Frank Stephan, and Jason Teutsch.
Closed
left-r.e. sets.
In Theory and Applications of Models of Computation (TAMC
2011), volume 6648 of Lecture Notes in Computer Science, pages
218-229. Springer, Berlin / Heidelberg, 2011.
[ .pdf ]
|
| |
|
[13]
| |
Laurent Bienvenu, Frank Stephan, and Jason Teutsch.
How powerful are
integer-valued martingales?
In Programs, Proofs, Processes (CiE 2010), volume 6158 of
Lecture Notes in Computer Science, pages 59-68. Springer-Verlag, Berlin /
Heidelberg, 2010.
[ .pdf ]
|
| |
|
[14]
| |
Sanjay Jain, Frank Stephan, and Jason Teutsch.
Index sets and
universal numberings.
In Mathematical Theory and Computational Practice (CiE 2009),
volume 5635 of Lecture Notes in Computer Science, pages 270-279.
Springer-Verlag, Berlin / Heidelberg, 2009.
[ .pdf ]
|
| |
|
[15]
| |
Pascal O. Vontobel, Roxana Smarandache, Negar Kiyavash, Jason Teutsch, and
Dejan Vukobratovic.
On the minimal
pseudo-codewords of codes from finite geometries.
In Proceedings of IEEE International Symposium on Information
Theory (ISIT 2005), pages 980-984, Adelaide, Australia, 2005.
[ ArXiv ]
|
| |