Resource bounded baire category and small circuits in exponential space. - Jack H. Lutz (SCT, 1987)

Additional Queries to Random and Pseudorandom Oracles. - Ronald V. Book; Jack H. Lutz; Shouwen Tang (ICALP, 1990)

Pseudorandom Sources for BPP. - Jack H. Lutz (J. Comput. Syst. Sci., 1990)

Category and Measure in Complexity Classes. - Jack H. Lutz (SIAM J. Comput., 1990)

Errata for Circuit Size to Pseudorandom Oracles. - Jack H. Lutz; William J. Schmidt (SCT, 1991)

An Upward Measure Separation Theorem. - Jack H. Lutz (Theor. Comput. Sci., 1991)

On Languages with Very High Information Content. - Ronald V. Book; Jack H. Lutz (SCT, 1992)

On Complexity Classes and Algorithmically Random Languages (Extended Abstract). - Ronald V. Book; Jack H. Lutz; Klaus W. Wagner (STACS, 1992)

Almost Everywhere High Nonuniform Complexity. - Jack H. Lutz (J. Comput. Syst. Sci., 1992)

On Independent Random Oracles. - Jack H. Lutz (Theor. Comput. Sci., 1992)

The Quantitative Structure of Exponential Time. - Jack H. Lutz (SCT, 1993)

The Complexity and Distribution of Hard Problems (Extended Abstract) - David W. Juedes; Jack H. Lutz (FOCS, 1993)

Computational Depth and Reducibility (Extended Abstract). - David W. Juedes; James I. Lathrop; Jack H. Lutz (ICALP, 1993)

On Languages With Very High Space-Bounded Kolmogorov Complexity. - Ronald V. Book; Jack H. Lutz (SIAM J. Comput., 1993)

A Pseudorandom Oracle Characterization of BPP. - Jack H. Lutz (SIAM J. Comput., 1993)

Circuit Size Relative to Pseudorandom Oracles. - Jack H. Lutz; William J. Schmidt (Theor. Comput. Sci., 1993)

Cook Versus Karp-Levin: Separating Completeness Notions if NP Is not Small (Extended Abstract). - Jack H. Lutz; Elvira Mayordomo (STACS, 1994)

An Observation on Probability Versus Randomness with Applications to Complexity Classes. - Ronald V. Book; Jack H. Lutz; Klaus W. Wagner (Math. Syst. Theory, 1994)

Measure, Stochasticity, and the Density of Hard Languages. - Jack H. Lutz; Elvira Mayordomo (SIAM J. Comput., 1994)

Computational Depth and Reducibility. - David W. Juedes; James I. Lathrop; Jack H. Lutz (Theor. Comput. Sci., 1994)

A Small Span Theorem for P/Poly-Turing Reductions. - Jack H. Lutz (SCT, 1995)

Weakly Useful Sequences. - Stephen A. Fenner; Jack H. Lutz; Elvira Mayordomo (ICALP, 1995)

The Complexity and Distribution of Hard Problems. - David W. Juedes; Jack H. Lutz (SIAM J. Comput., 1995)

Weakly Hard Problems. - Jack H. Lutz (SIAM J. Comput., 1995)

Weak Completeness in E and E_2. - David W. Juedes; Jack H. Lutz (Theor. Comput. Sci., 1995)

The Global Power of Additional Queries to Random Oracles - Ronald V. Book; Jack H. Lutz; David M. Martin Jr. (Inf. Comput., 1995)

Completeness and Weak Completeness Under Polynomial-Size Circuits. - David W. Juedes; Jack H. Lutz (Inf. Comput., 1996)

Cook Versus Karp-Levin: Separating Completeness Notions if NP is not Small. - Jack H. Lutz; Elvira Mayordomo (Theor. Comput. Sci., 1996)

Report on the Workshop on Languages, Algorithms and Complexity, Minneapolis, USA, 12 April 1997. - Jack H. Lutz (Bull. EATCS, 1997)

Observations on Measure and Lowness for Delta^p_2. - Jack H. Lutz (Theory Comput. Syst., 1997)

Resource-Bounded Measure. - Jack H. Lutz (CCC, 1998)

Genericity and Randomness over Feasible Probability Measures. - Amy K. Lorentz; Jack H. Lutz (Theor. Comput. Sci., 1998)

Query Order and NP-Completeness. - Jack Jie Dai; Jack H. Lutz (CCC, 1999)

Twelve Problems in Resource-Bounded Measure. - Jack H. Lutz; Elvira Mayordomo (Bull. EATCS, 1999)

Recursive Computational Depth. - James I. Lathrop; Jack H. Lutz (Inf. Comput., 1999)

Equivalence of Measures of Complexity Classes. - Josef M. Breutzmann; Jack H. Lutz (SIAM J. Comput., 1999)

Feasible Reductions to Kolmogorov-Loveland Stochastic Sequences. - Jack H. Lutz; David L. Schweizer (Theor. Comput. Sci., 1999)

Gales and the Constructive Dimension of Individual Sequences. - Jack H. Lutz (ICALP, 2000)

Hard Instances of Hard Problems. - Jack H. Lutz; Vikram Mhetre; Sridhar Srinivasan (STACS, 2000)

Bias Invariance of Small Upper Spans. - Jack H. Lutz; Martin Strauss 001 (STACS, 2000)

Modeling Time-Bounded Prefix Kolmogorov Complexity. - David W. Juedes; Jack H. Lutz (Theory Comput. Syst., 2000)

The Density of Weakly Complete Problems under Adaptive Reductions. - Jack H. Lutz; Yong Zhao (SIAM J. Comput., 2000)

Twelve Problems in Resource-Bounded Measure. - Jack H. Lutz; Elvira Mayordomo (Current Trends in Theoretical Computer Science, 2001)

The dimensions of individual strings and sequences. - Jack H. Lutz (Inf. Comput., 2003)

Dimension in Complexity Classes. - Jack H. Lutz (SIAM J. Comput., 2003)

The Arithmetical Complexity of Dimension and Randomness - John M. Hitchcock; Jack H. Lutz; Sebastiaan Terwijn (Electron. Colloquium Comput. Complex., 2004)

Computability versus exact computability of martingales. - Jack H. Lutz (Inf. Process. Lett., 2004)

Scaled dimension and nonuniform complexity. - John M. Hitchcock; Jack H. Lutz; Elvira Mayordomo (J. Comput. Syst. Sci., 2004)

Baire category and nowhere differentiability for feasible real functions. - Josef M. Breutzmann; David W. Juedes; Jack H. Lutz (Math. Log. Q., 2004)

Finite-state dimension. - Jack Jie Dai; James I. Lathrop; Jack H. Lutz; Elvira Mayordomo (Theor. Comput. Sci., 2004)

The Dimension of a Point: Computability Meets Fractal Geometry. - Jack H. Lutz (CiE, 2005)

Zeta-Dimension. - David Doty; Xiaoyang Gu; Jack H. Lutz; Elvira Mayordomo; Philippe Moser (MFCS, 2005)

Dimensions of Copeland-Erdös Sequences - Xiaoyang Gu; Jack H. Lutz; Philippe Moser (Electron. Colloquium Comput. Complex., 2005)

Points on Computable Curves - Xiaoyang Gu; Jack H. Lutz; Elvira Mayordomo (Electron. Colloquium Comput. Complex., 2005)

Weakly useful sequences. - Stephen A. Fenner; Jack H. Lutz; Elvira Mayordomo; Patrick Reardon (Inf. Comput., 2005)

Prediction and dimension. - Lance Fortnow; Jack H. Lutz (J. Comput. Syst. Sci., 2005)

Effective fractal dimensions. - Jack H. Lutz (Math. Log. Q., 2005)

Finite-State Dimension and Real Arithmetic. - David Doty; Jack H. Lutz; Satyadev Nandakumar (Electron. Colloquium Comput. Complex., 2006)

Why Computational Complexity Requires Stricter Martingales. - John M. Hitchcock; Jack H. Lutz (Theory Comput. Syst., 2006)

Dimension and Relative Frequencies - Xiaoyang Gu; Jack H. Lutz (CoRR, 2007)

Connectivity Properties of Dimension Level Sets. - Jack H. Lutz; Klaus Weihrauch (CCA, 2007)

Effective Strong Dimension in Algorithmic Information and Computational Complexity. - Krishna B. Athreya; John M. Hitchcock; Jack H. Lutz; Elvira Mayordomo (SIAM J. Comput., 2007)

Complexes of on-line self assembly. - Neeraj Koul; Jim Lathrop; Jack H. Lutz; Vasant G. Honavar (EIT, 2008)

Dimension Characterizations of Complexity Classes. - Xiaoyang Gu; Jack H. Lutz (Comput. Complex., 2008)

A Divergence Formula for Randomness and Dimension (Short Version) - Jack H. Lutz (CSP, 2008)

Curves That Must Be Retraced. - Xiaoyang Gu; Jack H. Lutz; Elvira Mayordomo (Electron. Colloquium Comput. Complex., 2008)

Computability and Complexity in Self-Assembly. - James I. Lathrop; Jack H. Lutz; Matthew J. Patitz; Scott M. Summers (Electron. Colloquium Comput. Complex., 2008)

Dimensions of Points in Self-Similar Fractals. - Jack H. Lutz; Elvira Mayordomo (SIAM J. Comput., 2008)

Random Number Selection in Self-assembly. - David Doty; Jack H. Lutz; Matthew J. Patitz; Scott M. Summers; Damien Woods (UC, 2009)

Inseparability and Strong Hypotheses for Disjoint NP Pairs. - Jack H. Lutz; Elvira Mayordomo (Electron. Colloquium Comput. Complex., 2009)

Strict self-assembly of discrete Sierpinski triangles. - James I. Lathrop; Jack H. Lutz; Scott M. Summers (Theor. Comput. Sci., 2009)

Intrinsic Universality in Self-Assembly. - David Doty; Jack H. Lutz; Matthew J. Patitz; Scott M. Summers; Damien Woods (STACS, 2010)

Approximate Self-Assembly of the Sierpinski Triangle. - Jack H. Lutz; Brad Shutters (Electron. Colloquium Comput. Complex., 2010)

Axiomatizing Resource Bounds for Measure. - Xiaoyang Gu; Jack H. Lutz; Satyadev Nandakumar; James S. Royer (CiE, 2011)

Multi-Resolution Cellular Automata for Real Computation. - James I. Lathrop; Jack H. Lutz; Brian Patterson (CiE, 2011)

The Computer Science of Molecular Programming. - Jack H. Lutz (DNA, 2011)

Effective dimensions and relative frequencies. - Xiaoyang Gu; Jack H. Lutz (Theor. Comput. Sci., 2011)

A divergence formula for randomness and dimension. - Jack H. Lutz (Theor. Comput. Sci., 2011)

The Tile Assembly Model is Intrinsically Universal. - David Doty; Jack H. Lutz; Matthew J. Patitz; Robert T. Schweller; Scott M. Summers; Damien Woods (FOCS, 2012)

Engineering and verifying requirements for programmable self-assembling nanomachines. - Robyn R. Lutz; Jack H. Lutz; James I. Lathrop; Titus H. Klinge; Eric R. Henderson; Divita Mathur; Dalia Abo Sheasha (ICSE, 2012)

The Computer Science of DNA Nanotechnology. - Jack H. Lutz (LATA, 2012)

Requirements analysis for a product family of DNA nanodevices. - Robyn R. Lutz; Jack H. Lutz; James I. Lathrop; Titus H. Klinge; Divita Mathur; Donald M. Stull; Taylor Bergquist; Eric R. Henderson (RE, 2012)

Reasoning As Though. - Jack H. Lutz (UCNC, 2012)

Translating the Cantor set by a random - Randall Dougherty; Jack H. Lutz; R. Daniel Mauldin; Jason Teutsch (CoRR, 2012)

Inseparability and Strong Hypotheses for Disjoint NP Pairs. - Lance Fortnow; Jack H. Lutz; Elvira Mayordomo (Theory Comput. Syst., 2012)

Automated requirements analysis for a molecular watchdog timer. - Samuel J. Ellis; Eric R. Henderson; Titus H. Klinge; James I. Lathrop; Jack H. Lutz; Robyn R. Lutz; Divita Mathur; Andrew S. Miner (ASE, 2014)

Dimension spectra of random subfractals of self-similar fractals. - Xiaoyang Gu; Jack H. Lutz; Elvira Mayordomo; Philippe Moser (Ann. Pure Appl. Log., 2014)

Mutual Dimension. - Adam Case; Jack H. Lutz (Electron. Colloquium Comput. Complex., 2014)

Lines Missing Every Random Point. - Jack H. Lutz; Neil Lutz (Electron. Colloquium Comput. Complex., 2014)

The frequent paucity of trivial strings. - Jack H. Lutz (Inf. Process. Lett., 2014)

Algorithmic information and plane Kakeya sets. - Jack H. Lutz; Neil Lutz (CoRR, 2015)

Reachability Problems for Continuous Chemical Reaction Networks. - Adam Case; Jack H. Lutz; Donald M. Stull (Electron. Colloquium Comput. Complex., 2015)

Software engineering for molecular programming. - Robyn R. Lutz; Jack H. Lutz (ICSE (Companion Volume), 2016)

Runtime Fault Detection in Programmed Molecular Systems. - Samuel J. Ellis; Titus H. Klinge; James I. Lathrop; Jack H. Lutz; Robyn R. Lutz; Andrew S. Miner (CoRR, 2017)

Writing Requirements for Molecular Programs. - Jack H. Lutz; Robyn R. Lutz (RE, 2018)

Mutual dimension and random sequences. - Adam Case; Jack H. Lutz (Theor. Comput. Sci., 2018)

Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension. - Jack H. Lutz; Neil Lutz (ACM Trans. Comput. Theory, 2018)

Algorithmic Randomness in Continuous-Time Markov Chains. - Xiang Huang 001; Jack H. Lutz; Andrei N. Migunov (Allerton, 2019)

Robustness and games against nature in molecular programming. - Jack H. Lutz; Neil Lutz; Robyn R. Lutz; Matthew R. Riley (ICSE (NIER), 2019)

Quorum Sensing and Verification in Chemical Reaction Networks. - James I. Lathrop; Jack H. Lutz; Robyn R. Lutz; Hugh D. Potter; Matthew R. Riley (CoRR, 2019)

Real-time computability of real numbers by chemical reaction networks. - Xiang Huang 001; Titus H. Klinge; James I. Lathrop; Xiaoyuan Li; Jack H. Lutz (Nat. Comput., 2019)

Runtime Fault Detection in Programmed Molecular Systems. - Samuel J. Ellis; Titus H. Klinge; James I. Lathrop; Jack H. Lutz; Robyn R. Lutz; Andrew S. Miner; Hugh D. Potter (ACM Trans. Softw. Eng. Methodol., 2019)

Who Asked Us? How the Theory of Computing Answers Questions about Analysis. - Jack H. Lutz; Neil Lutz (Complexity and Approximation, 2020)

Nonregularity via Ordinal Extensions. - Jack H. Lutz; Giora Slutzki (CoRR, 2020)

The Dimensions of Hyperspaces. - Jack H. Lutz; Neil Lutz; Elvira Mayordomo (CoRR, 2020)

Algorithmically Optimal Outer Measures. - Jack H. Lutz; Neil Lutz (CoRR, 2020)

Algorithmic Fractal Dimensions in Geometric Measure Theory. - Jack H. Lutz; Elvira Mayordomo (CoRR, 2020)

Robust biomolecular finite automata. - Titus H. Klinge; James I. Lathrop; Jack H. Lutz (Theor. Comput. Sci., 2020)

The Point-to-Set Principle, the Continuum Hypothesis, and the Dimensions of Hamel Bases. - Jack H. Lutz (CoRR, 2021)

A Weyl Criterion for Finite-State Dimension. - Jack H. Lutz; Satyadev Nandakumar; Subin Pulari (CoRR, 2021)

Computing absolutely normal numbers in nearly linear time. - Jack H. Lutz; Elvira Mayordomo (Inf. Comput., 2021)

Asymptotic Divergences and Strong Dichotomy. - Xiang Huang 001; Jack H. Lutz; Elvira Mayordomo; Donald M. Stull (IEEE Trans. Inf. Theory, 2021)

Finite-State Mutual Dimension. - Adam Case; Jack H. Lutz (Allerton, 2022)

A Weyl Criterion for Finite-State Dimension and Applications. - Jack H. Lutz; Satyadev Nandakumar; Subin Pulari (MFCS, 2023)

Dimension and the Structure of Complexity Classes. - Jack H. Lutz; Neil Lutz; Elvira Mayordomo (Theory Comput. Syst., 2023)

Extending the reach of the point-to-set principle. - Jack H. Lutz; Neil Lutz; Elvira Mayordomo (Inf. Comput., 2023)

Algorithmic Dimensions via Learning Functions. - Jack H. Lutz; Andrei N. Migunov (MFCS, 2024)

The Point-to-Set Principle and the dimensions of Hamel bases. - Jack H. Lutz; Renrui Qi; Liang Yu 004 (Comput., 2024)

Population-induced phase transitions and the verification of chemical reaction networks. - James I. Lathrop; Jack H. Lutz; Robyn R. Lutz; Hugh D. Potter; Matthew R. Riley (Nat. Comput., 2024)