default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJason Teutsch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[i19]Jason Teutsch, Sami Mäkelä, Surya Bakshi:
Bootstrapping a stable computation token. CoRR abs/1908.02946 (2019)- [i18]Jason Teutsch, Michael Straka, Dan Boneh:
Retrofitting a two-way peg between blockchains. CoRR abs/1908.03999 (2019) - [i17]Jason Teutsch, Vitalik Buterin, Christopher Brown:
Interactive coin offerings. CoRR abs/1908.04295 (2019) - [i16]Jason Teutsch, Christian Reitwießner:
A scalable verification solution for blockchains. CoRR abs/1908.04756 (2019) - [i15]Jason Teutsch:
On decentralized oracles for data availability. CoRR abs/1910.10694 (2019) - 2017
- [j18]Sanjay Jain, Frank Stephan
, Jason Teutsch:
Closed left-r.e. sets. Comput. 6(1): 1-21 (2017) - [j17]Sanjay Jain, Jason Teutsch:
Enumerations including laconic enumerators. Theor. Comput. Sci. 700: 89-95 (2017) - [c13]Yaron Velner, Jason Teutsch, Loi Luu:
Smart Contracts Make Bitcoin Mining Pools Vulnerable. Financial Cryptography Workshops 2017: 298-316 - [c12]Loi Luu, Yaron Velner, Jason Teutsch, Prateek Saxena:
SmartPool: Practical Decentralized Pooled Mining. USENIX Security Symposium 2017: 1409-1426 - [i14]Loi Luu, Yaron Velner, Jason Teutsch, Prateek Saxena:
SMART POOL : Practical Decentralized Pooled Mining. IACR Cryptol. ePrint Arch. 2017: 19 (2017) - [i13]Yaron Velner, Jason Teutsch, Loi Luu:
Smart Contracts Make Bitcoin Mining Pools Vulnerable. IACR Cryptol. ePrint Arch. 2017: 230 (2017) - 2016
- [j16]George Barmpalias, Andrew Lewis-Pye, Jason Teutsch:
Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers. Inf. Comput. 251: 287-300 (2016) - [j15]Jason Teutsch, Marius Zimand:
A Brief on Short Descriptions. SIGACT News 47(1): 42-67 (2016) - [c11]Jason Teutsch, Sanjay Jain, Prateek Saxena:
When Cryptocurrencies Mine Their Own Business. Financial Cryptography 2016: 499-514 - [i12]George Barmpalias, Andrew Lewis-Pye, Jason Teutsch:
Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers. CoRR abs/1602.07113 (2016) - [i11]Sanjay Jain, Prateek Saxena, Frank Stephan, Jason Teutsch:
How to verify computation with a rational network. CoRR abs/1606.05917 (2016) - 2015
- [j14]Gregory Clark, Jason Teutsch:
Maximizing T-complexity. Fundam. Informaticae 139(1): 1-19 (2015) - [j13]Jason Teutsch, Marius Zimand:
On Approximate Decidability of Minimal Programs. ACM Trans. Comput. Theory 7(4): 17:1-17:16 (2015) - [c10]Loi Luu, Jason Teutsch, Raghav Kulkarni, Prateek Saxena:
Demystifying Incentives in the Consensus Computer. CCS 2015: 706-719 - [i10]Loi Luu, Jason Teutsch, Raghav Kulkarni, Prateek Saxena:
Demystifying incentives in the consensus computer. IACR Cryptol. ePrint Arch. 2015: 702 (2015) - 2014
- [j12]Jason Teutsch:
Short lists for shortest descriptions in short time. Comput. Complex. 23(4): 565-583 (2014) - [j11]Frank Stephan, Jason Teutsch:
Things that can be made into themselves. Inf. Comput. 237: 174-186 (2014) - [j10]Jason Teutsch:
A savings paradox for integer-valued gambling strategies. Int. J. Game Theory 43(1): 145-151 (2014) - [c9]Nirupama Talele, Jason Teutsch, Robert F. Erbacher, Trent Jaeger:
Monitor placement for large-scale systems. SACMAT 2014: 29-40 - [i9]Robert F. Erbacher, Trent Jaeger, Nirupama Talele, Jason Teutsch:
Directed Multicut with linearly ordered terminals. CoRR abs/1407.7498 (2014) - [i8]Jason Teutsch, Marius Zimand:
On approximate decidability of minimal programs. CoRR abs/1409.0496 (2014) - 2013
- [j9]Jason Teutsch:
Review of Algorithmic Randomness and Complexity by Downey and Hirschfeldt. SIGACT News 44(1): 25-28 (2013) - [c8]Nirupama Talele, Jason Teutsch, Trent Jaeger, Robert F. Erbacher:
Using Security Policies to Automate Placement of Network Intrusion Prevention. ESSoS 2013: 17-32 - [c7]Wolfgang Merkle, Frank Stephan, Jason Teutsch, Wei Wang, Yue Yang:
Selection by Recursively Enumerable Sets. TAMC 2013: 144-155 - 2012
- [j8]Wolfgang Merkle, Jason Teutsch:
Constant Compression and Random Weights. Comput. 1(2): 153-169 (2012) - [j7]Adam Chalcraft, Randall Dougherty, Christopher F. Freiling, Jason Teutsch:
How to build a probability-free casino. Inf. Comput. 211: 160-164 (2012) - [j6]Frank Stephan, Jason Teutsch:
An incomplete set of shortest descriptions. J. Symb. Log. 77(1): 291-307 (2012) - [j5]Laurent Bienvenu, Frank Stephan, Jason Teutsch:
How Powerful Are Integer-Valued Martingales? Theory Comput. Syst. 51(3): 330-351 (2012) - [j4]Bjørn Kjos-Hanssen, Frank Stephan, Jason Teutsch:
Arithmetic complexity via effective names for random sequences. ACM Trans. Comput. Log. 13(3): 24:1-24:18 (2012) - [c6]Divya Muthukumaran, Sandra Julieta Rueda, Nirupama Talele, Hayawardh Vijayakumar, Jason Teutsch, Trent Jaeger:
Transforming commodity security policies to enforce Clark-Wilson integrity. ACSAC 2012: 269-278 - [c5]Wolfgang Merkle, Jason Teutsch:
Constant compression and random weights. STACS 2012: 172-181 - [i7]Randall Dougherty, Jack H. Lutz, R. Daniel Mauldin, Jason Teutsch:
Translating the Cantor set by a random. CoRR abs/1205.4821 (2012) - [i6]Frank Stephan, Jason Teutsch:
Things that can be made into themselves. CoRR abs/1208.0682 (2012) - [i5]Jason Teutsch:
Short lists for shorter programs in short time. CoRR abs/1212.6104 (2012) - 2011
- [j3]Sanjay Jain, Frank Stephan, Jason Teutsch:
Index sets and universal numberings. J. Comput. Syst. Sci. 77(4): 760-773 (2011) - [c4]Sanjay Jain, Frank Stephan, Jason Teutsch:
Closed Left-R.E. Sets. TAMC 2011: 218-229 - 2010
- [c3]Laurent Bienvenu, Frank Stephan, Jason Teutsch:
How Powerful Are Integer-Valued Martingales? CiE 2010: 59-68 - [i4]Laurent Bienvenu, Frank Stephan, Jason Teutsch:
How powerful are integer-valued martingales? CoRR abs/1004.0838 (2010) - [i3]Bjørn Kjos-Hanssen, Frank Stephan, Jason Teutsch:
Enumerating randoms. CoRR abs/1008.4825 (2010)
2000 – 2009
- 2009
- [c2]Sanjay Jain, Frank Stephan, Jason Teutsch:
Index Sets and Universal Numberings. CiE 2009: 270-279 - 2008
- [j2]Frank Stephan, Jason Teutsch:
Immunity and Hyperimmunity for Sets of Minimal Indices. Notre Dame J. Formal Log. 49(2): 107-125 (2008) - 2007
- [j1]Jason Teutsch:
On the Turing degrees of minimal index sets. Ann. Pure Appl. Log. 148(1-3): 63-80 (2007) - [i2]Jason Teutsch:
Noncomputable Spectral Sets. CoRR abs/math/0701904 (2007) - 2005
- [c1]Pascal O. Vontobel, Roxana Smarandache, Negar Kiyavash, Jason Teutsch, Dejan Vukobratovic:
On the minimal pseudo-codewords of codes from finite geometries. ISIT 2005: 980-984 - [i1]Pascal O. Vontobel, Roxana Smarandache, Negar Kiyavash, Jason Teutsch, Dejan Vukobratovic:
On the Minimal Pseudo-Codewords of Codes from Finite Geometries. CoRR abs/cs/0508019 (2005)
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 20:23 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:
