The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jack H. Lutz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Amy K. Lorentz, Jack H. Lutz
    Genericity and Randomness over Feasible Probability Measures. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:171-187 [Conf]
  2. Jack H. Lutz
    The Dimension of a Point: Computability Meets Fractal Geometry. [Citation Graph (0, 0)][DBLP]
    CiE, 2005, pp:299-299 [Conf]
  3. Ronald V. Book, Jack H. Lutz
    On Languages with Very High Information Content. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:255-259 [Conf]
  4. Jack Jie Dai, Jack H. Lutz
    Query Order and NP-Completeness. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:142-148 [Conf]
  5. Jack H. Lutz
    Dimension in Complexity Classes. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:158-169 [Conf]
  6. Jack H. Lutz
    Almost Everywhere High Nonuniform Complexity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:37-53 [Conf]
  7. Jack H. Lutz
    A Pseudorandom Oracle Characterization of BPP. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:190-195 [Conf]
  8. Jack H. Lutz
    The Quantitative Structure of Exponential Time. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:158-175 [Conf]
  9. Jack H. Lutz
    Weakly Hard Problems. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:146-161 [Conf]
  10. Jack H. Lutz
    A Small Span Theorem for P/Poly-Turing Reductions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:324-330 [Conf]
  11. Jack H. Lutz
    Resource-Bounded Measure. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:236-248 [Conf]
  12. Jack H. Lutz, William J. Schmidt
    Circuit Size Relative to Pseudorandom Oracles. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:268-286 [Conf]
  13. Jack H. Lutz, William J. Schmidt
    Errata for Circuit Size to Pseudorandom Oracles. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:392- [Conf]
  14. Jack H. Lutz, Yong Zhao
    The Density of Weakly Complete Problems under Adaptive Reductions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:111-120 [Conf]
  15. Lance Fortnow, Jack H. Lutz
    Prediction and Dimension. [Citation Graph (0, 0)][DBLP]
    COLT, 2002, pp:380-395 [Conf]
  16. John M. Hitchcock, Jack H. Lutz, Sebastiaan Terwijn
    The Arithmetical Complexity of Dimension and Randomness. [Citation Graph (0, 0)][DBLP]
    CSL, 2003, pp:241-254 [Conf]
  17. David W. Juedes, Jack H. Lutz
    The Complexity and Distribution of Hard Problems (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:177-185 [Conf]
  18. Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo
    Points on Computable Curves. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:469-474 [Conf]
  19. Xiaoyang Gu, Jack H. Lutz, Philippe Moser
    Dimensions of Copeland-Erdös Sequences. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:250-260 [Conf]
  20. Ronald V. Book, Jack H. Lutz, Shouwen Tang
    Additional Queries to Random and Pseudorandom Oracles. [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:283-293 [Conf]
  21. Jack Jie Dai, James I. Lathrop, Jack H. Lutz, Elvira Mayordomo
    Finite-State Dimension. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:1028-1039 [Conf]
  22. David Doty, Jack H. Lutz, Satyadev Nandakumar
    Finite-State Dimension and Real Arithmetic. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:537-547 [Conf]
  23. Stephen A. Fenner, Jack H. Lutz, Elvira Mayordomo
    Weakly Useful Sequences. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:393-404 [Conf]
  24. John M. Hitchcock, Jack H. Lutz
    Why Computational Complexity Requires Stricter Martingales. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:549-560 [Conf]
  25. John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo
    Scaled Dimension and Nonuniform Complexity. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:278-290 [Conf]
  26. David W. Juedes, James I. Lathrop, Jack H. Lutz
    Computational Depth and Reducibility (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:277-288 [Conf]
  27. James I. Lathrop, Jack H. Lutz
    Recursive Computational Depth. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:132-142 [Conf]
  28. Jack H. Lutz
    Gales and the Constructive Dimension of Individual Sequences. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:902-913 [Conf]
  29. Josef M. Breutzmann, David W. Juedes, Jack H. Lutz
    Baire Category and Nowhere Differentiability for Feasible Real Functions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:219-230 [Conf]
  30. Xiaoyang Gu, Jack H. Lutz
    Dimension Characterizations of Complexity Classes. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:471-479 [Conf]
  31. David Doty, Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo, Philippe Moser
    Zeta-Dimension. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:283-294 [Conf]
  32. Krishna B. Athreya, John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo
    Effective Strong Dimension in Algorithmic Information and Computational Complexity. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:632-643 [Conf]
  33. Josef M. Breutzmann, Jack H. Lutz
    Equivalence of Measures of Complexity Classes. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:535-545 [Conf]
  34. Ronald V. Book, Jack H. Lutz, David M. Martin Jr.
    The Global Power of Additional Queries to Random Oracles. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:403-414 [Conf]
  35. Ronald V. Book, Jack H. Lutz, Klaus W. Wagner
    On Complexity Classes and Algorithmically Random Languages (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:319-328 [Conf]
  36. David W. Juedes, Jack H. Lutz
    Completeness and Weak Completeness Under Polynomial-Size Circuits. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:26-37 [Conf]
  37. Jack H. Lutz
    Observations on Measure and Lowness for Delta^P_2. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:87-97 [Conf]
  38. Jack H. Lutz, Elvira Mayordomo
    Measure, Stochasticity, and the Density of Hard Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:38-47 [Conf]
  39. Jack H. Lutz, Elvira Mayordomo
    Cook Versus Karp-Levin: Separating Completeness Notions if NP Is not Small (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:415-426 [Conf]
  40. Jack H. Lutz, Vikram Mhetre, Sridhar Srinivasan
    Hard Instances of Hard Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:324-333 [Conf]
  41. Jack H. Lutz, Martin Strauss
    Bias Invariance of Small Upper Spans. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:74-86 [Conf]
  42. Jack H. Lutz
    Dimension in Complexity Classes [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  43. Jack H. Lutz
    The Dimensions of Individual Strings and Sequences [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  44. Krishna B. Athreya, John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo
    Effective Strong Dimension, Algorithmic Information, and Computational Complexity [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  45. John M. Hitchcock, Jack H. Lutz, Sebastiaan Terwijn
    The Arithmetical Complexity of Dimension and Randomness [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  46. Jack H. Lutz
    Report on the Workshop on Languages, Algorithms and Complexity, Minneapolis, USA, 12 April 1997. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1997, v:62, n:, pp:- [Journal]
  47. Jack H. Lutz, Elvira Mayordomo
    Twelve Problems in Resource-Bounded Measure. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1999, v:68, n:, pp:64-80 [Journal]
  48. John M. Hitchcock, Jack H. Lutz, Sebastiaan Terwijn
    The Arithmetical Complexity of Dimension and Randomness [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:079, pp:- [Journal]
  49. Xiaoyang Gu, Jack H. Lutz, Philippe Moser
    Dimensions of Copeland-Erdös Sequences [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:089, pp:- [Journal]
  50. Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo
    Points on Computable Curves [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:157, pp:- [Journal]
  51. Xiaoyang Gu, Jack H. Lutz
    Dimension Characterizations of Complexity Classes [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:160, pp:- [Journal]
  52. Ronald V. Book, Jack H. Lutz, David M. Martin Jr.
    The Global Power of Additional Queries to Random Oracles [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:120, n:1, pp:49-54 [Journal]
  53. Stephen A. Fenner, Jack H. Lutz, Elvira Mayordomo, Patrick Reardon
    Weakly useful sequences. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:197, n:1-2, pp:41-54 [Journal]
  54. David W. Juedes, Jack H. Lutz
    Completeness and Weak Completeness Under Polynomial-Size Circuits. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:125, n:1, pp:13-31 [Journal]
  55. James I. Lathrop, Jack H. Lutz
    Recursive Computational Depth. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:153, n:1, pp:139-172 [Journal]
  56. Jack H. Lutz
    The dimensions of individual strings and sequences. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:187, n:1, pp:49-79 [Journal]
  57. Jack H. Lutz
    Computability versus exact computability of martingales. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:5, pp:235-237 [Journal]
  58. Lance Fortnow, Jack H. Lutz
    Prediction and dimension. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:70, n:4, pp:570-589 [Journal]
  59. John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo
    Scaled dimension and nonuniform complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:2, pp:97-122 [Journal]
  60. Jack H. Lutz
    Pseudorandom Sources for BPP. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1990, v:41, n:3, pp:307-320 [Journal]
  61. Jack H. Lutz
    Almost Everywhere High Nonuniform Complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1992, v:44, n:2, pp:220-258 [Journal]
  62. Josef M. Breutzmann, David W. Juedes, Jack H. Lutz
    Baire category and nowhere differentiability for feasible real functions. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2004, v:50, n:4-5, pp:460-472 [Journal]
  63. Jack H. Lutz
    Effective fractal dimensions. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2005, v:51, n:1, pp:62-72 [Journal]
  64. Ronald V. Book, Jack H. Lutz, Klaus W. Wagner
    An Observation on Probability Versus Randomness with Applications to Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:3, pp:201-209 [Journal]
  65. John M. Hitchcock, Jack H. Lutz
    Why Computational Complexity Requires Stricter Martingales. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:2, pp:277-296 [Journal]
  66. David W. Juedes, Jack H. Lutz
    Modeling Time-Bounded Prefix Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2000, v:33, n:2, pp:111-123 [Journal]
  67. Jack H. Lutz
    Observations on Measure and Lowness for \Delta^p_2. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1997, v:30, n:4, pp:429-442 [Journal]
  68. Ronald V. Book, Jack H. Lutz
    On Languages With Very High Space-Bounded Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:2, pp:395-402 [Journal]
  69. Josef M. Breutzmann, Jack H. Lutz
    Equivalence of Measures of Complexity Classes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:1, pp:302-326 [Journal]
  70. David W. Juedes, Jack H. Lutz
    The Complexity and Distribution of Hard Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:2, pp:279-295 [Journal]
  71. Jack H. Lutz
    Dimension in Complexity Classes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:5, pp:1236-1259 [Journal]
  72. Jack H. Lutz
    Category and Measure in Complexity Classes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:6, pp:1100-1131 [Journal]
  73. Jack H. Lutz
    A Pseudorandom Oracle Characterization of BPP. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:5, pp:1075-1086 [Journal]
  74. Jack H. Lutz
    Weakly Hard Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:6, pp:1170-1189 [Journal]
  75. Jack H. Lutz, Elvira Mayordomo
    Measure, Stochasticity, and the Density of Hard Languages. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:4, pp:762-779 [Journal]
  76. Jack H. Lutz, Yong Zhao
    The Density of Weakly Complete Problems under Adaptive Reductions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:4, pp:1197-1210 [Journal]
  77. Jack Jie Dai, James I. Lathrop, Jack H. Lutz, Elvira Mayordomo
    Finite-state dimension. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:1-33 [Journal]
  78. David W. Juedes, Jack H. Lutz
    Weak Completeness in E and E_2. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:143, n:1, pp:149-158 [Journal]
  79. David W. Juedes, James I. Lathrop, Jack H. Lutz
    Computational Depth and Reducibility. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:132, n:2, pp:37-70 [Journal]
  80. Amy K. Lorentz, Jack H. Lutz
    Genericity and Randomness over Feasible Probability Measures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:207, n:1, pp:245-259 [Journal]
  81. Jack H. Lutz
    An Upward Measure Separation Theorem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:81, n:1, pp:127-135 [Journal]
  82. Jack H. Lutz
    On Independent Random Oracles. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:92, n:2, pp:301-307 [Journal]
  83. Jack H. Lutz, Elvira Mayordomo
    Cook Versus Karp-Levin: Separating Completeness Notions if NP is not Small. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:164, n:1&2, pp:141-163 [Journal]
  84. Jack H. Lutz, William J. Schmidt
    Circuit Size Relative to Pseudorandom Oracles. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:107, n:1, pp:95-120 [Journal]
  85. Jack H. Lutz, David L. Schweizer
    Feasible Reductions to Kolmogorov-Loveland Stochastic Sequences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:225, n:1-2, pp:185-194 [Journal]
  86. James I. Lathrop, Jack H. Lutz, Scott M. Summers
    Strict Self-assembly of Discrete Sierpinski Triangles. [Citation Graph (0, 0)][DBLP]
    CiE, 2007, pp:455-464 [Conf]
  87. Xiaoyang Gu, Jack H. Lutz
    Dimension and Relative Frequencies [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  88. David Doty, Jack H. Lutz, Satyadev Nandakumar
    Finite-State Dimension and Real Arithmetic [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  89. David Doty, Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo, Philippe Moser
    Zeta-Dimension [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  90. Xiaoyang Gu, Jack H. Lutz, Philippe Moser
    Dimensions of Copeland-Erdös sequences. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2007, v:205, n:9, pp:1317-1333 [Journal]
  91. Krishna B. Athreya, John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo
    Effective Strong Dimension in Algorithmic Information and Computational Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:3, pp:671-705 [Journal]
  92. John M. Hitchcock, Jack H. Lutz, Sebastiaan Terwijn
    The arithmetical complexity of dimension and randomness. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2007, v:8, n:2, pp:- [Journal]

  93. Curves That Must Be Retraced. [Citation Graph (, )][DBLP]


  94. Computability and Complexity in Self-assembly. [Citation Graph (, )][DBLP]


  95. Effective Dimensions and Relative Frequencies. [Citation Graph (, )][DBLP]


  96. A Divergence Formula for Randomness and Dimension. [Citation Graph (, )][DBLP]


  97. Approximate Self-assembly of the Sierpinski Triangle. [Citation Graph (, )][DBLP]


  98. Dimensions of Points in Self-similar Fractals. [Citation Graph (, )][DBLP]


  99. Intrinsic Universality in Self-Assembly. [Citation Graph (, )][DBLP]


  100. Inseparability and Strong Hypotheses for Disjoint NP Pairs. [Citation Graph (, )][DBLP]


  101. Random Number Selection in Self-assembly. [Citation Graph (, )][DBLP]


  102. Dimension Characterizations of Complexity Classes. [Citation Graph (, )][DBLP]


  103. Dimensions of Copeland-Erdos Sequences [Citation Graph (, )][DBLP]


  104. Points on Computable Curves [Citation Graph (, )][DBLP]


  105. A Divergence Formula for Randomness and Dimension [Citation Graph (, )][DBLP]


  106. Inseparability and Strong Hypotheses for Disjoint NP Pairs [Citation Graph (, )][DBLP]


  107. Strict Self-Assembly of Discrete Sierpinski Triangles [Citation Graph (, )][DBLP]


  108. A Divergence Formula for Randomness and Dimension (Short Version) [Citation Graph (, )][DBLP]


  109. Intrinsic Universality in Self-Assembly [Citation Graph (, )][DBLP]


  110. Approximate Self-Assembly of the Sierpinski Triangle [Citation Graph (, )][DBLP]


  111. Computability and Complexity in Self-Assembly. [Citation Graph (, )][DBLP]


  112. A Divergence Formula for Randomness and Dimension. [Citation Graph (, )][DBLP]


  113. Strict Self-Assembly of Discrete Sierpinski Triangles. [Citation Graph (, )][DBLP]


  114. Curves That Must Be Retraced. [Citation Graph (, )][DBLP]


  115. Finite-State Dimension and Real Arithmetic. [Citation Graph (, )][DBLP]


  116. Connectivity Properties of Dimension Level Sets. [Citation Graph (, )][DBLP]


Search in 1.888secs, Finished in 1.896secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002