default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJack H. Lutz
Person information
- affiliation: Iowa State University, Ames, IA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j66]Jack H. Lutz, Renrui Qi, Liang Yu:
The Point-to-Set Principle and the dimensions of Hamel bases. Comput. 13(2): 105-112 (2024)- [j65]James I. Lathrop
, Jack H. Lutz, Robyn R. Lutz, Hugh D. Potter, Matthew R. Riley:
Population-induced phase transitions and the verification of chemical reaction networks. Nat. Comput. 23(2): 347-363 (2024) - [c82]Jack H. Lutz, Andrei N. Migunov:
Algorithmic Dimensions via Learning Functions. MFCS 2024: 72:1-72:13 - [i58]Jack H. Lutz, Andrei N. Migunov:
Algorithmic Dimensions via Learning Functions. CoRR abs/2407.01747 (2024) - 2023
- [j64]Jack H. Lutz, Neil Lutz, Elvira Mayordomo:
Extending the reach of the point-to-set principle. Inf. Comput. 294: 105078 (2023) - [j63]Jack H. Lutz, Neil Lutz, Elvira Mayordomo:
Dimension and the Structure of Complexity Classes. Theory Comput. Syst. 67(3): 473-490 (2023) - [c81]Jack H. Lutz, Satyadev Nandakumar, Subin Pulari:
A Weyl Criterion for Finite-State Dimension and Applications. MFCS 2023: 65:1-65:16 - 2022
- [c80]Adam Case, Jack H. Lutz:
Finite-State Mutual Dimension. Allerton 2022: 1-8 - [c79]Jack H. Lutz, Neil Lutz, Elvira Mayordomo:
Extending the Reach of the Point-To-Set Principle. STACS 2022: 48:1-48:14 - 2021
- [j62]Jack H. Lutz, Elvira Mayordomo:
Computing absolutely normal numbers in nearly linear time. Inf. Comput. 281: 104746 (2021) - [j61]Xiang Huang, Jack H. Lutz, Elvira Mayordomo, Donald M. Stull:
Asymptotic Divergences and Strong Dichotomy. IEEE Trans. Inf. Theory 67(10): 6296-6305 (2021) - [i57]Jack H. Lutz, Neil Lutz, Elvira Mayordomo:
Dimension and the Structure of Complexity Classes. CoRR abs/2109.05956 (2021) - [i56]Jack H. Lutz:
The Point-to-Set Principle, the Continuum Hypothesis, and the Dimensions of Hamel Bases. CoRR abs/2109.10981 (2021) - [i55]Adam Case, Jack H. Lutz:
Finite-State Mutual Dimension. CoRR abs/2109.14574 (2021) - [i54]Jack H. Lutz, Satyadev Nandakumar, Subin Pulari:
A Weyl Criterion for Finite-State Dimension. CoRR abs/2111.04030 (2021) - 2020
- [j60]Titus H. Klinge, James I. Lathrop, Jack H. Lutz:
Robust biomolecular finite automata. Theor. Comput. Sci. 816: 114-143 (2020) - [c78]Jack H. Lutz, Neil Lutz:
Who Asked Us? How the Theory of Computing Answers Questions about Analysis. Complexity and Approximation 2020: 48-56 - [c77]James I. Lathrop, Jack H. Lutz, Robyn R. Lutz, Hugh D. Potter, Matthew R. Riley:
Population-Induced Phase Transitions and the Verification of Chemical Reaction Networks. DNA 2020: 5:1-5:17 - [c76]Xiang Huang, Jack H. Lutz, Elvira Mayordomo, Donald M. Stull:
Asymptotic Divergences and Strong Dichotomy. STACS 2020: 51:1-51:15 - [i53]Jack H. Lutz, Giora Slutzki:
Nonregularity via Ordinal Extensions. CoRR abs/2001.08846 (2020) - [i52]Jack H. Lutz, Neil Lutz, Elvira Mayordomo:
The Dimensions of Hyperspaces. CoRR abs/2004.07798 (2020) - [i51]Jack H. Lutz, Neil Lutz:
Algorithmically Optimal Outer Measures. CoRR abs/2006.08468 (2020) - [i50]Jack H. Lutz, Elvira Mayordomo:
Algorithmic Fractal Dimensions in Geometric Measure Theory. CoRR abs/2007.14346 (2020)
2010 – 2019
- 2019
- [j59]Xiang Huang, Titus H. Klinge, James I. Lathrop, Xiaoyuan Li, Jack H. Lutz:
Real-time computability of real numbers by chemical reaction networks. Nat. Comput. 18(1): 63-73 (2019) - [j58]Samuel J. Ellis, Titus H. Klinge, James I. Lathrop, Jack H. Lutz, Robyn R. Lutz, Andrew S. Miner, Hugh D. Potter:
Runtime Fault Detection in Programmed Molecular Systems. ACM Trans. Softw. Eng. Methodol. 28(2): 6:1-6:20 (2019) - [c75]Xiang Huang, Jack H. Lutz, Andrei N. Migunov:
Algorithmic Randomness in Continuous-Time Markov Chains. Allerton 2019: 615-622 - [c74]Jack H. Lutz, Neil Lutz, Robyn R. Lutz, Matthew R. Riley:
Robustness and games against nature in molecular programming. ICSE (NIER) 2019: 65-68 - [i49]Jack H. Lutz, Neil Lutz, Robyn R. Lutz, Matthew R. Riley:
Robustness and Games Against Nature in Molecular Programming. CoRR abs/1902.06171 (2019) - [i48]James I. Lathrop, Jack H. Lutz, Robyn R. Lutz, Hugh D. Potter, Matthew R. Riley:
Quorum Sensing and Verification in Chemical Reaction Networks. CoRR abs/1909.05390 (2019) - [i47]Xiang Huang, Jack H. Lutz, Elvira Mayordomo, Donald M. Stull:
Asymptotic Divergences and Strong Dichotomy. CoRR abs/1910.13615 (2019) - [i46]Xiang Huang, Jack H. Lutz, Andrei N. Migunov:
Algorithmic Randomness in Continuous-Time Markov Chains. CoRR abs/1910.13620 (2019) - [i45]Jack H. Lutz, Neil Lutz:
Who Asked Us? How the Theory of Computing Answers Questions about Analysis. CoRR abs/1912.00284 (2019) - 2018
- [j57]Adam Case, Jack H. Lutz, Donald M. Stull:
Reachability problems for continuous chemical reaction networks. Nat. Comput. 17(2): 223-230 (2018) - [j56]Adam Case, Jack H. Lutz:
Mutual dimension and random sequences. Theor. Comput. Sci. 731: 68-87 (2018) - [j55]Jack H. Lutz, Neil Lutz:
Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension. ACM Trans. Comput. Theory 10(2): 7:1-7:22 (2018) - [c73]Jack H. Lutz, Robyn R. Lutz:
Writing Requirements for Molecular Programs. RE 2018: 512 - [i44]Xiang Huang, Titus H. Klinge, James I. Lathrop, Xiaoyuan Li, Jack H. Lutz:
Real-Time Computability of Real Numbers by Chemical Reaction Networks. CoRR abs/1803.10267 (2018) - 2017
- [c72]Jack H. Lutz, Neil Lutz:
Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension. STACS 2017: 53:1-53:13 - [c71]Xiang Huang, Titus H. Klinge, James I. Lathrop, Xiaoyuan Li, Jack H. Lutz:
Real-Time Computability of Real Numbers by Chemical Reaction Networks. UCNC 2017: 29-40 - [i43]Samuel J. Ellis, Titus H. Klinge, James I. Lathrop, Jack H. Lutz, Robyn R. Lutz, Andrew S. Miner:
Runtime Fault Detection in Programmed Molecular Systems. CoRR abs/1710.09494 (2017) - 2016
- [c70]Robyn R. Lutz, Jack H. Lutz:
Software engineering for molecular programming. ICSE (Companion Volume) 2016: 888-889 - [c69]Adam Case, Jack H. Lutz, Donald M. Stull:
Reachability Problems for Continuous Chemical Reaction Networks. UCNC 2016: 1-10 - [i42]Adam Case, Jack H. Lutz:
Mutual Dimension and Random Sequences. CoRR abs/1603.09390 (2016) - [i41]Jack H. Lutz, Elvira Mayordomo:
Computing Absolutely Normal Numbers in Nearly Linear Time. CoRR abs/1611.05911 (2016) - 2015
- [j54]Jack H. Lutz, Neil Lutz:
Lines missing every random point. Comput. 4(2): 85-102 (2015) - [j53]Adam Case, Jack H. Lutz:
Mutual Dimension. ACM Trans. Comput. Theory 7(3): 12:1-12:26 (2015) - [c68]Adam Case, Jack H. Lutz:
Mutual Dimension and Random Sequences. MFCS (2) 2015: 199-210 - [i40]Titus H. Klinge, James I. Lathrop, Jack H. Lutz:
Robust Biomolecular Finite Automata. CoRR abs/1505.03931 (2015) - [i39]Adam Case, Jack H. Lutz, Donald M. Stull:
Reachability Problems for Continuous Chemical Reaction Networks. CoRR abs/1508.04125 (2015) - [i38]Jack H. Lutz, Neil Lutz:
Algorithmic information and plane Kakeya sets. CoRR abs/1511.00442 (2015) - [i37]Adam Case, Jack H. Lutz, Donald M. Stull:
Reachability Problems for Continuous Chemical Reaction Networks. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j52]Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo, Philippe Moser:
Dimension spectra of random subfractals of self-similar fractals. Ann. Pure Appl. Log. 165(11): 1707-1726 (2014) - [j51]Jack H. Lutz:
The frequent paucity of trivial strings. Inf. Process. Lett. 114(11): 643-645 (2014) - [c67]Jack H. Lutz, Neil Lutz:
Lines Missing Every Random Point. CiE 2014: 283-292 - [c66]Samuel J. Ellis, Eric R. Henderson, Titus H. Klinge, James I. Lathrop, Jack H. Lutz, Robyn R. Lutz, Divita Mathur, Andrew S. Miner:
Automated requirements analysis for a molecular watchdog timer. ASE 2014: 767-778 - [i36]Jack H. Lutz, Neil Lutz:
Lines Missing Every Random Point. CoRR abs/1401.3063 (2014) - [i35]Adam Case, Jack H. Lutz:
Mutual Dimension. CoRR abs/1410.4135 (2014) - [i34]Adam Case, Jack H. Lutz:
Mutual Dimension. Electron. Colloquium Comput. Complex. TR14 (2014) - [i33]Jack H. Lutz, Neil Lutz:
Lines Missing Every Random Point. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c65]Adam Case, Jack H. Lutz:
Mutual Dimension. STACS 2013: 116-126 - [i32]Jack H. Lutz:
The Frequent Paucity of Trivial Strings. CoRR abs/1310.6383 (2013) - [i31]Jack H. Lutz:
The Frequent Paucity of Trivial Strings. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j50]Lance Fortnow, Jack H. Lutz, Elvira Mayordomo:
Inseparability and Strong Hypotheses for Disjoint NP Pairs. Theory Comput. Syst. 51(2): 229-247 (2012) - [j49]Jack H. Lutz, Brad Shutters:
Approximate Self-Assembly of the Sierpinski Triangle. Theory Comput. Syst. 51(3): 372-400 (2012) - [c64]David Doty, Jack H. Lutz, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Damien Woods:
The Tile Assembly Model is Intrinsically Universal. FOCS 2012: 302-310 - [c63]Robyn R. Lutz, Jack H. Lutz, James I. Lathrop, Titus H. Klinge, Eric R. Henderson, Divita Mathur, Dalia Abo Sheasha:
Engineering and verifying requirements for programmable self-assembling nanomachines. ICSE 2012: 1361-1364 - [c62]Jack H. Lutz:
The Computer Science of DNA Nanotechnology. LATA 2012: 57 - [c61]Robyn R. Lutz, Jack H. Lutz, James I. Lathrop, Titus H. Klinge, Divita Mathur, Donald M. Stull, Taylor Bergquist, Eric R. Henderson:
Requirements analysis for a product family of DNA nanodevices. RE 2012: 211-220 - [c60]Jack H. Lutz:
Reasoning As Though. UCNC 2012: 11 - [i30]Randall Dougherty, Jack H. Lutz, R. Daniel Mauldin, Jason Teutsch:
Translating the Cantor set by a random. CoRR abs/1205.4821 (2012) - 2011
- [j48]Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo:
Curves that must be retraced. Inf. Comput. 209(6): 992-1006 (2011) - [j47]James I. Lathrop, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers:
Computability and Complexity in Self-assembly. Theory Comput. Syst. 48(3): 617-647 (2011) - [j46]Jack H. Lutz:
A divergence formula for randomness and dimension. Theor. Comput. Sci. 412(1-2): 166-177 (2011) - [j45]Xiaoyang Gu, Jack H. Lutz:
Effective dimensions and relative frequencies. Theor. Comput. Sci. 412(48): 6696-6711 (2011) - [c59]Xiaoyang Gu, Jack H. Lutz, Satyadev Nandakumar, James S. Royer:
Axiomatizing Resource Bounds for Measure. CiE 2011: 102-111 - [c58]James I. Lathrop, Jack H. Lutz, Brian Patterson:
Multi-Resolution Cellular Automata for Real Computation. CiE 2011: 181-190 - [c57]Jack H. Lutz:
The Computer Science of Molecular Programming. DNA 2011: 21 - [i29]Jack H. Lutz:
Resource Bounded Measure. CoRR abs/1101.5455 (2011) - [i28]Xiaoyang Gu, Jack H. Lutz, Satyadev Nandakumar, James S. Royer:
Axiomatizing Resource Bounds for Measure. CoRR abs/1102.2095 (2011) - [i27]David Doty, Jack H. Lutz, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Damien Woods:
The tile assembly model is intrinsically universal. CoRR abs/1111.3097 (2011) - 2010
- [c56]Jack H. Lutz, Brad Shutters:
Approximate Self-assembly of the Sierpinski Triangle. CiE 2010: 286-295 - [c55]David Doty, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers, Damien Woods:
Intrinsic Universality in Self-Assembly. STACS 2010: 275-286 - [c54]Lance Fortnow, Jack H. Lutz, Elvira Mayordomo:
Inseparability and Strong Hypotheses for Disjoint NP Pairs. STACS 2010: 395-404 - [i26]David Doty, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers, Damien Woods:
Intrinsic Universality in Self-Assembly. CoRR abs/1001.0208 (2010) - [i25]Jack H. Lutz, Brad Shutters:
Approximate Self-Assembly of the Sierpinski Triangle. CoRR abs/1001.2888 (2010) - [i24]Jack H. Lutz, Brad Shutters:
Approximate Self-Assembly of the Sierpinski Triangle. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j44]James I. Lathrop, Jack H. Lutz, Scott M. Summers:
Strict self-assembly of discrete Sierpinski triangles. Theor. Comput. Sci. 410(4-5): 384-405 (2009) - [c53]Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo:
Curves That Must Be Retraced. CCA 2009 - [c52]Jack H. Lutz:
A Divergence Formula for Randomness and Dimension. CiE 2009: 342-351 - [c51]David Doty, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers, Damien Woods:
Random Number Selection in Self-assembly. UC 2009: 143-157 - [i23]Jack H. Lutz, Elvira Mayordomo:
Inseparability and Strong Hypotheses for Disjoint NP Pairs. CoRR abs/0902.2674 (2009) - [i22]James I. Lathrop, Jack H. Lutz, Scott M. Summers:
Strict Self-Assembly of Discrete Sierpinski Triangles. CoRR abs/0903.1818 (2009) - [i21]Jack H. Lutz, Elvira Mayordomo:
Inseparability and Strong Hypotheses for Disjoint NP Pairs. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j43]Xiaoyang Gu, Jack H. Lutz:
Dimension Characterizations of Complexity Classes. Comput. Complex. 17(4): 459-474 (2008) - [j42]Jack H. Lutz, Klaus Weihrauch:
Connectivity properties of dimension level sets. Math. Log. Q. 54(5): 483-491 (2008) - [j41]Jack H. Lutz, Elvira Mayordomo:
Dimensions of Points in Self-Similar Fractals. SIAM J. Comput. 38(3): 1080-1112 (2008) - [c50]Xiaoyang Gu, Jack H. Lutz:
Effective Dimensions and Relative Frequencies. CiE 2008: 231-240 - [c49]James I. Lathrop, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers:
Computability and Complexity in Self-assembly. CiE 2008: 349-358 - [c48]Jack H. Lutz, Elvira Mayordomo:
Dimensions of Points in Self-similar Fractals. COCOON 2008: 215-224 - [c47]Neeraj Koul, Jim Lathrop, Jack H. Lutz, Vasant G. Honavar:
Complexes of on-line self assembly. EIT 2008: 448-452 - [c46]Jack H. Lutz:
A Divergence Formula for Randomness and Dimension (Short Version). CSP 2008: 149-152 - [i20]Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo:
Curves That Must Be Retraced. CoRR abs/0802.4312 (2008) - [i19]Jack H. Lutz:
A Divergence Formula for Randomness and Dimension. CoRR abs/0811.1825 (2008) - [i18]Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo:
Curves That Must Be Retraced. Electron. Colloquium Comput. Complex. TR08 (2008) - [i17]James I. Lathrop, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers:
Computability and Complexity in Self-Assembly. Electron. Colloquium Comput. Complex. TR08 (2008) - [i16]James I. Lathrop, Jack H. Lutz, Scott M. Summers:
Strict Self-Assembly of Discrete Sierpinski Triangles. Electron. Colloquium Comput. Complex. TR08 (2008) - [i15]Jack H. Lutz:
A Divergence Formula for Randomness and Dimension. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j40]Xiaoyang Gu, Jack H. Lutz, Philippe Moser:
Dimensions of Copeland-Erdös sequences. Inf. Comput. 205(9): 1317-1333 (2007) - [j39]David Doty, Jack H. Lutz, Satyadev Nandakumar:
Finite-state dimension and real arithmetic. Inf. Comput. 205(11): 1640-1651 (2007) - [j38]Krishna B. Athreya, John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo:
Effective Strong Dimension in Algorithmic Information and Computational Complexity. SIAM J. Comput. 37(3): 671-705 (2007) - [j37]John M. Hitchcock, Jack H. Lutz, Sebastiaan Terwijn:
The arithmetical complexity of dimension and randomness. ACM Trans. Comput. Log. 8(2): 13 (2007) - [c45]James I. Lathrop, Jack H. Lutz, Scott M. Summers:
Strict Self-assembly of Discrete Sierpinski Triangles. CiE 2007: 455-464 - [c44]Jack H. Lutz, Klaus Weihrauch:
Connectivity Properties of Dimension Level Sets. CCA 2007: 295-304 - [i14]Xiaoyang Gu, Jack H. Lutz:
Dimension and Relative Frequencies. CoRR abs/cs/0703085 (2007) - 2006
- [j36]John M. Hitchcock, Jack H. Lutz:
Why Computational Complexity Requires Stricter Martingales. Theory Comput. Syst. 39(2): 277-296 (2006) - [c43]Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo:
Points on Computable Curves. FOCS 2006: 469-474 - [c42]David Doty, Jack H. Lutz, Satyadev Nandakumar:
Finite-State Dimension and Real Arithmetic. ICALP (1) 2006: 537-547 - [c41]Xiaoyang Gu, Jack H. Lutz:
Dimension Characterizations of Complexity Classes. MFCS 2006: 471-479 - [i13]David Doty, Jack H. Lutz, Satyadev Nandakumar:
Finite-State Dimension and Real Arithmetic. CoRR abs/cs/0602032 (2006) - [i12]David Doty, Jack H. Lutz, Satyadev Nandakumar:
Finite-State Dimension and Real Arithmetic. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j35]Stephen A. Fenner, Jack H. Lutz, Elvira Mayordomo, Patrick Reardon:
Weakly useful sequences. Inf. Comput. 197(1-2): 41-54 (2005) - [j34]Lance Fortnow, Jack H. Lutz:
Prediction and dimension. J. Comput. Syst. Sci. 70(4): 570-589 (2005) - [j33]Jack H. Lutz:
Effective fractal dimensions. Math. Log. Q. 51(1): 62-72 (2005) - [c40]Jack H. Lutz:
The Dimension of a Point: Computability Meets Fractal Geometry. CiE 2005: 299-299 - [c39]Xiaoyang Gu, Jack H. Lutz, Philippe Moser:
Dimensions of Copeland-Erdös Sequences. FSTTCS 2005: 250-260 - [c38]David Doty, Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo, Philippe Moser:
Zeta-Dimension. MFCS 2005: 283-294 - [i11]David Doty, Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo, Philippe Moser:
Zeta-Dimension. CoRR abs/cs/0503052 (2005) - [i10]Xiaoyang Gu, Jack H. Lutz, Philippe Moser:
Dimensions of Copeland-Erdos Sequences. CoRR abs/cs/0508001 (2005) - [i9]Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo:
Points on Computable Curves. CoRR abs/cs/0512042 (2005) - [i8]Xiaoyang Gu, Jack H. Lutz, Philippe Moser:
Dimensions of Copeland-Erdös Sequences. Electron. Colloquium Comput. Complex. TR05 (2005) - [i7]Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo:
Points on Computable Curves. Electron. Colloquium Comput. Complex. TR05 (2005) - [i6]Xiaoyang Gu, Jack H. Lutz:
Dimension Characterizations of Complexity Classes. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j32]Jack H. Lutz:
Computability versus exact computability of martingales. Inf. Process. Lett. 92(5): 235-237 (2004) - [j31]John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo:
Scaled dimension and nonuniform complexity. J. Comput. Syst. Sci. 69(2): 97-122 (2004) - [j30]Josef M. Breutzmann, David W. Juedes, Jack H. Lutz:
Baire category and nowhere differentiability for feasible real functions. Math. Log. Q. 50(4-5): 460-472 (2004) - [j29]Jack Jie Dai, James I. Lathrop, Jack H. Lutz, Elvira Mayordomo:
Finite-state dimension. Theor. Comput. Sci. 310(1-3): 1-33 (2004) - [c37]Krishna B. Athreya, John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo:
Effective Strong Dimension in Algorithmic Information and Computational Complexity. STACS 2004: 632-643 - [i5]John M. Hitchcock, Jack H. Lutz, Sebastiaan Terwijn:
The Arithmetical Complexity of Dimension and Randomness. CoRR cs.LO/0408043 (2004) - [i4]John M. Hitchcock, Jack H. Lutz, Sebastiaan Terwijn:
The Arithmetical Complexity of Dimension and Randomness. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j28]Jack H. Lutz:
The dimensions of individual strings and sequences. Inf. Comput. 187(1): 49-79 (2003) - [j27]Jack H. Lutz:
Dimension in Complexity Classes. SIAM J. Comput. 32(5): 1236-1259 (2003) - [c36]John M. Hitchcock, Jack H. Lutz, Sebastiaan Terwijn:
The Arithmetical Complexity of Dimension and Randomness. CSL 2003: 241-254 - [c35]John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo:
Scaled Dimension and Nonuniform Complexity. ICALP 2003: 278-290 - 2002
- [c34]Lance Fortnow, Jack H. Lutz:
Prediction and Dimension. COLT 2002: 380-395 - [c33]John M. Hitchcock, Jack H. Lutz:
Why Computational Complexity Requires Stricter Martingales. ICALP 2002: 549-560 - [i3]Jack H. Lutz:
Dimension in Complexity Classes. CoRR cs.CC/0203016 (2002) - [i2]Jack H. Lutz:
The Dimensions of Individual Strings and Sequences. CoRR cs.CC/0203017 (2002) - [i1]Krishna B. Athreya, John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo:
Effective Strong Dimension, Algorithmic Information, and Computational Complexity. CoRR cs.CC/0211025 (2002) - 2001
- [c32]Jack Jie Dai, James I. Lathrop, Jack H. Lutz, Elvira Mayordomo:
Finite-State Dimension. ICALP 2001: 1028-1039 - [c31]Josef M. Breutzmann, David W. Juedes, Jack H. Lutz:
Baire Category and Nowhere Differentiability for Feasible Real Functions. ISAAC 2001: 219-230 - [p1]Jack H. Lutz, Elvira Mayordomo:
Twelve Problems in Resource-Bounded Measure. Current Trends in Theoretical Computer Science 2001: 83-101 - 2000
- [j26]David W. Juedes, Jack H. Lutz:
Modeling Time-Bounded Prefix Kolmogorov Complexity. Theory Comput. Syst. 33(2): 111-123 (2000) - [j25]Jack H. Lutz, Yong Zhao:
The Density of Weakly Complete Problems under Adaptive Reductions. SIAM J. Comput. 30(4): 1197-1210 (2000) - [c30]Jack H. Lutz:
Dimension in Complexity Classes. CCC 2000: 158-169 - [c29]Jack H. Lutz:
Gales and the Constructive Dimension of Individual Sequences. ICALP 2000: 902-913 - [c28]Jack H. Lutz, Martin Strauss:
Bias Invariance of Small Upper Spans. STACS 2000: 74-86 - [c27]Jack H. Lutz, Vikram Mhetre, Sridhar Srinivasan:
Hard Instances of Hard Problems. STACS 2000: 324-333
1990 – 1999
- 1999
- [j24]Jack H. Lutz, Elvira Mayordomo:
Twelve Problems in Resource-Bounded Measure. Bull. EATCS 68: 64-80 (1999) - [j23]James I. Lathrop, Jack H. Lutz:
Recursive Computational Depth. Inf. Comput. 153(1): 139-172 (1999) - [j22]Josef M. Breutzmann, Jack H. Lutz:
Equivalence of Measures of Complexity Classes. SIAM J. Comput. 29(1): 302-326 (1999) - [j21]Jack H. Lutz, David L. Schweizer:
Feasible Reductions to Kolmogorov-Loveland Stochastic Sequences. Theor. Comput. Sci. 225(1-2): 185-194 (1999) - [c26]Jack Jie Dai, Jack H. Lutz:
Query Order and NP-Completeness. CCC 1999: 142-148 - 1998
- [j20]Amy K. Lorentz, Jack H. Lutz:
Genericity and Randomness over Feasible Probability Measures. Theor. Comput. Sci. 207(1): 245-259 (1998) - [c25]Jack H. Lutz:
Resource-Bounded Measure. CCC 1998: 236-248 - 1997
- [j19]Jack H. Lutz:
Report on the Workshop on Languages, Algorithms and Complexity, Minneapolis, USA, 12 April 1997. Bull. EATCS 62 (1997) - [j18]Jack H. Lutz:
Observations on Measure and Lowness for \Delta^p_2. Theory Comput. Syst. 30(4): 429-442 (1997) - [c24]Amy K. Lorentz, Jack H. Lutz:
Genericity and Randomness over Feasible Probability Measures. Advances in Algorithms, Languages, and Complexity 1997: 171-187 - [c23]Jack H. Lutz, Yong Zhao:
The Density of Weakly Complete Problems under Adaptive Reductions. CCC 1997: 111-120 - [c22]James I. Lathrop, Jack H. Lutz:
Recursive Computational Depth. ICALP 1997: 132-142 - [c21]Josef M. Breutzmann, Jack H. Lutz:
Equivalence of Measures of Complexity Classes. STACS 1997: 535-545 - 1996
- [j17]David W. Juedes, Jack H. Lutz:
Completeness and Weak Completeness Under Polynomial-Size Circuits. Inf. Comput. 125(1): 13-31 (1996) - [j16]Jack H. Lutz, Elvira Mayordomo:
Cook Versus Karp-Levin: Separating Completeness Notions if NP is not Small. Theor. Comput. Sci. 164(1&2): 141-163 (1996) - [c20]Jack H. Lutz:
Observations on Measure and Lowness for Delta^P_2. STACS 1996: 87-97 - 1995
- [j15]Ronald V. Book, Jack H. Lutz, David M. Martin Jr.:
The Global Power of Additional Queries to Random Oracles. Inf. Comput. 120(1): 49-54 (1995) - [j14]David W. Juedes, Jack H. Lutz:
The Complexity and Distribution of Hard Problems. SIAM J. Comput. 24(2): 279-295 (1995) - [j13]Jack H. Lutz:
Weakly Hard Problems. SIAM J. Comput. 24(6): 1170-1189 (1995) - [j12]David W. Juedes, Jack H. Lutz:
Weak Completeness in E and E_2. Theor. Comput. Sci. 143(1): 149-158 (1995) - [c19]Jack H. Lutz:
A Small Span Theorem for P/Poly-Turing Reductions. SCT 1995: 324-330 - [c18]Stephen A. Fenner, Jack H. Lutz, Elvira Mayordomo:
Weakly Useful Sequences. ICALP 1995: 393-404 - [c17]David W. Juedes, Jack H. Lutz:
Completeness and Weak Completeness Under Polynomial-Size Circuits. STACS 1995: 26-37 - 1994
- [j11]Ronald V. Book, Jack H. Lutz, Klaus W. Wagner:
An Observation on Probability Versus Randomness with Applications to Complexity Classes. Math. Syst. Theory 27(3): 201-209 (1994) - [j10]Jack H. Lutz, Elvira Mayordomo:
Measure, Stochasticity, and the Density of Hard Languages. SIAM J. Comput. 23(4): 762-779 (1994) - [j9]David W. Juedes, James I. Lathrop, Jack H. Lutz:
Computational Depth and Reducibility. Theor. Comput. Sci. 132(2): 37-70 (1994) - [c16]Jack H. Lutz:
Weakly Hard Problems. SCT 1994: 146-161 - [c15]Ronald V. Book, Jack H. Lutz, David M. Martin Jr.:
The Global Power of Additional Queries to Random Oracles. STACS 1994: 403-414 - [c14]Jack H. Lutz, Elvira Mayordomo:
Cook Versus Karp-Levin: Separating Completeness Notions if NP Is not Small (Extended Abstract). STACS 1994: 415-426 - 1993
- [j8]Ronald V. Book, Jack H. Lutz:
On Languages With Very High Space-Bounded Kolmogorov Complexity. SIAM J. Comput. 22(2): 395-402 (1993) - [j7]Jack H. Lutz:
A Pseudorandom Oracle Characterization of BPP. SIAM J. Comput. 22(5): 1075-1086 (1993) - [j6]Jack H. Lutz, William J. Schmidt:
Circuit Size Relative to Pseudorandom Oracles. Theor. Comput. Sci. 107(1): 95-120 (1993) - [c13]Jack H. Lutz:
The Quantitative Structure of Exponential Time. SCT 1993: 158-175 - [c12]David W. Juedes, Jack H. Lutz:
The Complexity and Distribution of Hard Problems (Extended Abstract). FOCS 1993: 177-185 - [c11]David W. Juedes, James I. Lathrop, Jack H. Lutz:
Computational Depth and Reducibility (Extended Abstract). ICALP 1993: 277-288 - [c10]Jack H. Lutz, Elvira Mayordomo:
Measure, Stochasticity, and the Density of Hard Languages. STACS 1993: 38-47 - 1992
- [j5]Jack H. Lutz:
Almost Everywhere High Nonuniform Complexity. J. Comput. Syst. Sci. 44(2): 220-258 (1992) - [j4]Jack H. Lutz:
On Independent Random Oracles. Theor. Comput. Sci. 92(2): 301-307 (1992) - [c9]Ronald V. Book, Jack H. Lutz:
On Languages with Very High Information Content. SCT 1992: 255-259 - [c8]Ronald V. Book, Jack H. Lutz, Klaus W. Wagner:
On Complexity Classes and Algorithmically Random Languages (Extended Abstract). STACS 1992: 319-328 - 1991
- [j3]Jack H. Lutz:
An Upward Measure Separation Theorem. Theor. Comput. Sci. 81(1): 127-135 (1991) - [c7]Jack H. Lutz:
A Pseudorandom Oracle Characterization of BPP. SCT 1991: 190-195 - [c6]Jack H. Lutz, William J. Schmidt:
Errata for Circuit Size to Pseudorandom Oracles. SCT 1991: 392 - 1990
- [j2]Jack H. Lutz:
Pseudorandom Sources for BPP. J. Comput. Syst. Sci. 41(3): 307-320 (1990) - [j1]Jack H. Lutz:
Category and Measure in Complexity Classes. SIAM J. Comput. 19(6): 1100-1131 (1990) - [c5]Jack H. Lutz, William J. Schmidt:
Circuit Size Relative to Pseudorandom Oracles. SCT 1990: 268-286 - [c4]Ronald V. Book, Jack H. Lutz, Shouwen Tang:
Additional Queries to Random and Pseudorandom Oracles. ICALP 1990: 283-293
1980 – 1989
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-27 22:57 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:
