Jack Lutz | Academic Influence

Jack Lutz's AcademicInfluence.com Rankings

Jack Lutz

Computer Science

#5609

World Rank

#5925

Historical Rank

#1578

USA Rank

Theoretical Computer Science

#139

World Rank

#139

Historical Rank

#35

USA Rank

Database

#8312

World Rank

#8692

Historical Rank

#1093

USA Rank

computer-science Degrees

Download Badge

Computer Science

Jack Lutz's Degrees

Masters Computer Science Stanford University
Bachelors Computer Science University of California, Berkeley

Similar Degrees You Can Earn

Why Is Jack Lutz Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Jack Lutz is an American theoretical computer scientist best known for developing the concepts of resource bounded measure and effective dimension; he has also published research on DNA computing and self-assembly. He is a professor of computer science and mathematics at Iowa State University.

(See a Problem?)

Jack Lutz's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Almost everywhere high nonuniform complexity (1989) (288)
The dimensions of individual strings and sequences (2002) (222)
Dimension in complexity classes (2000) (171)
The quantitative structure of exponential time (1993) (153)
Effective Strong Dimension in Algorithmic Information and Computational Complexity (2002) (132)
Category and Measure in Complexity Classes (1990) (130)
The Tile Assembly Model is Intrinsically Universal (2011) (104)
Strict self-assembly of discrete Sierpinski triangles (2007) (104)
The complexity and distribution of hard problems (1993) (96)
Cook Versus Karp-Levin: Separating Completeness Notions if NP is not Small (1996) (92)
Gales and the Constructive Dimension of Individual Sequences (2000) (91)
Finite-state dimension (2001) (88)
Measure, Stochasticity, and the Density of Hard Languages (1993) (77)
Computability and Complexity in Self-assembly (2008) (65)
Computational Depth and Reducibility (1994) (60)
Weakly hard problems (1994) (46)
Weak Completeness in E and E_2 (1995) (46)
Dimensions of Points in Self-Similar Fractals (2008) (45)
Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension (2015) (44)
Effective fractal dimensions (2005) (43)
Weak completeness in E and E 2 (1995) (41)
Resource-bounded measure (1998) (39)
Circuit size relative to pseudorandom oracles (1990) (34)
Effective fractal dimension: foundations and applications (2003) (34)
Scaled dimension and nonuniform complexity (2003) (34)
Twelve Problems in Resource-Bounded Measure (2001) (33)
Recursive Computational Depth (1997) (33)
On Complexity Classes and Algorithmically Random Languages (Extended Abstract) (1992) (33)
Prediction and dimension (2002) (30)
Approximate Self-Assembly of the Sierpinski Triangle (2010) (24)
Zeta-Dimension (2005) (23)
Pseudorandom sources for BPP (1988) (21)
A pseudorandom oracle characterization of BPP (1991) (21)
Equivalence of Measures of Complexity Classes (1997) (20)
An Upward Measure Separation Theorem (1991) (20)
Finite-state dimension and real arithmetic (2006) (19)
Connectivity properties of dimension level sets (2008) (18)
Mutual Dimension (2014) (18)
Translating the Cantor set by a random real (2014) (17)
Requirements analysis for a product family of DNA nanodevices (2012) (17)
Completeness and Weak Completeness Under Polynomial-Size Circuits (1995) (16)
Lines missing every random point (2014) (16)
Points on Computable Curves (2005) (16)
Dimension spectra of random subfractals of self-similar fractals (2014) (16)
Why Computational Complexity Requires Stricter Martingales (2002) (16)
Random Number Selection in Self-assembly (2009) (15)
Automated requirements analysis for a molecular watchdog timer (2014) (15)
Curves that must be retraced (2008) (14)
Resource bounded baire category and small circuits in exponential space (1987) (13)
The arithmetical complexity of dimension and randomness (2003) (12)
On Languages With Very High Space-Bounded Kolmogorov Complexity (1993) (11)
The Global Power of Additional Queries to Random Oracles (1994) (11)
Engineering and verifying requirements for programmable self-assembling nanomachines (2012) (10)
Runtime Fault Detection in Programmed Molecular Systems (2017) (10)
Kolmogorov Complexity, Complexity Cores, and the Distribution of Hardness (1992) (10)
A small span theorem for P/Poly-Turing reductions (1995) (10)
Computing Absolutely Normal Numbers in Nearly Linear Time (2016) (9)
An observation on probability versus randomness with applications to complexity classes (1994) (9)
Mutual Dimension and Random Sequences (2015) (9)
A divergence formula for randomness and dimension (2008) (9)
Observations on measure and lowness for Δ2P (1997) (8)
Baire category and nowhere differentiability for feasible real functions (2004) (8)
Cook Versus Karp-Levin: Separating Completeness Notions if NP Is not Small (Extended Abstract) (1994) (8)
The density of weakly complete problems under adaptive reductions (1997) (8)
Dimension Characterizations of Complexity Classes (2006) (7)
Reachability problems for continuous chemical reaction networks (2015) (7)
On Independent Random Oracles (1992) (7)
Resource-bounded category and measure in exponential complexity classes (1987) (7)
Population-Induced Phase Transitions and the Verification of Chemical Reaction Networks (2020) (7)
Who Asked Us? How the Theory of Computing Answers Questions about Analysis (2019) (7)
Dimensions of Copeland-Erdös sequences (2005) (7)
Robust Biomolecular Finite Automata (2015) (6)
Weakly useful sequences (1995) (6)
On languages with very high information content (1992) (5)
Modeling Time-Bounded Prefix Kolmogorov Complexity (2000) (5)
Genericity and Randomness over Feasible Probability Measures (1998) (5)
Observations on Measure and Lowness for Delta^P_2 (1996) (5)
Inseparability and Strong Hypotheses for Disjoint NP Pairs (2009) (5)
Query order and NP-completeness (1999) (4)
Real-time computability of real numbers by chemical reaction networks (2017) (4)
Extending the Reach of the Point-To-Set Principle (2020) (4)
Algorithmic Fractal Dimensions in Geometric Measure Theory (2020) (4)
One-Way Functions and Balanced NP (1992) (4)
Computability versus exact computability of martingales (2004) (3)
Feasible Reductions to Kolmogorov-Loveland Stochastic Sequences (1999) (3)
The frequent paucity of trivial strings (2013) (2)
Hard Instances of Hard Problems (2000) (2)
Additional Queries to Random and Pseudorandom Oracles (1990) (2)
The Point-to-Set Principle, the Continuum Hypothesis, and the Dimensions of Hamel Bases (2021) (2)
Effective dimensions and relative frequencies (2008) (2)
Multi-Resolution Cellular Automata for Real Computation (2011) (2)
Algorithmically Optimal Outer Measures (2020) (1)
A Divergence Formula for Randomness and Dimension (Short Version) (2009) (1)
Asymptotic Divergences and Strong Dichotomy (2019) (1)
Reachability problems for continuous chemical reaction networks (2017) (1)
Translating the Cantor set by a random (2012) (1)
Axiomatizing Resource Bounds for Measure (2011) (1)
SIGACT News Complexity Theory Column 48 (2014) (1)
Robustness and Games against Nature in Molecular Programming (2019) (1)
Universality in algorithmic self-assembly (2010) (1)
Some results in probability and theoretical computer science (2001) (1)
The Dimensions of Hyperspaces (2020) (1)
A PSEUDORANDOM ORACLE CHARACTERIZATION OF BPP JACK H. LUTZ (1993) (1)
Computability and Complexity in Analysis – CCA 2012 (2012) (0)
Proceedings Twenty-Second Annual IEEE Conference on Computational Complexity: Preface (2007) (0)
The Complexity and Distribution of Hard Problems (Extended Abstract) (1993) (0)
Bias Invariance of Small Upper Spans1 (2007) (0)
Observations on Measure and Lowness for \Delta^p_2 (1997) (0)
The complexity of parameters for probabilistic and quantum computation (1996) (0)
Zeta-Dimension ( Preliminary Version ) (2005) (0)
Algorithmic Randomness in Continuous-Time Markov Chains (2019) (0)
Feasible Reductions to Kolmogorov{loveland Stochastic Sequences 1 (1999) (0)
A Weyl Criterion for Finite-State Dimension and Applications (2021) (0)
One-way Functions and Balanced Np Extended Abstract (1997) (0)
Measure , Stochasticity , and theDensity of Hard Languages ( Preliminary Version ) (1992) (0)
Isaac Newton Institute, Cambridge, UK July 2–6, 2012 (2013) (0)
Dimension and Relative Frequencies (2007) (0)
A Weyl Criterion for Finite-State Dimension (2021) (0)
Kolmagorov Complexity , Complexity Cores , and the Distribution of Hardness TR 92-12 (1992) (0)
The Computer Science of DNA Nanotechnology (2012) (0)
Real-time computability of real numbers by chemical reaction networks (2018) (0)
A Pseudorandum Oracle Characterization of BBP (1990) (0)
Writing Requirements for Molecular Programs (2018) (0)
Errata for Circuit Size to Pseudorandom Oracles. (1991) (0)
Approximate Self-Assembly of the Sierpinski Triangle (2011) (0)
Reasoning As Though (2012) (0)
I T ] 3 0 O ct 2 01 9 Asymptotic Divergences and Strong Dichotomy ∗ † (2019) (0)
Query Order and NP-Completeness 1 (2007) (0)
The Dimension of a Point: Computability Meets Fractal Geometry (2005) (0)
Quorum Sensing and Verification in Chemical Reaction Networks (2019) (0)
Report on the Workshop on Languages, Algorithms and Complexity, Minneapolis, USA, 12 April 1997 (1997) (0)
Tight Bounds on Approximate Self-Assembly of the Sierpinski Triangle ∗ (2009) (0)
Points on Computable Curves ( Extended Abstract ) (0)
Errata for circuit size relative to pseudorandom oracles (1991) (0)
Complexes of on-line self assembly (2008) (0)
C C ] 2 7 M ar 2 01 8 Real-Time Computability of Real Numbers by Chemical Reaction Networks ∗ (2018) (0)
Nonregularity via Ordinal Extensions (2020) (0)
Inseparability and Strong Hypotheses for Disjoint NP Pairs (2011) (0)
I T ] 3 0 O ct 2 01 9 Algorithmic Randomness in Continuous-Time Markov Chains ∗ (2019) (0)
The Computer Science of Molecular Programming (2011) (0)
Bias Invariance of Small Upper Spans (2000) (0)
Equivalence of Measures of ComplexityClasses (2007) (0)
Finite-State Mutual Dimension (2021) (0)
Effective Strong Dimension with Applications to Information and Complexity (2002) (0)
Dimension and the Structure of Complexity Classes (2021) (0)
Computational Depth and Reducibility (Extended Abstract) (1993) (0)
Software Engineering for Molecular Programming (2016) (0)
Algorithmic information and plane Kakeya sets (2015) (0)

This paper list is powered by the following services:

Other Resources About Jack Lutz

en.wikipedia.org

What Schools Are Affiliated With Jack Lutz?

Jack Lutz is affiliated with the following schools: