The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Lance Fortnow: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lance Fortnow, Mario Szegedy
    On the Power of Two-Local Random Reductions. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1991, pp:346-351 [Conf]
  2. Richard Beigel, Lance Fortnow
    Are Cook and Karp Ever the Same? [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:333-336 [Conf]
  3. Luis Antunes, Lance Fortnow, Dieter van Melkebeek
    Computational Depth. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:266-273 [Conf]
  4. Harry Buhrman, Lance Fortnow
    Two Queries. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:13-0 [Conf]
  5. Harry Buhrman, Lance Fortnow, Leen Torenvliet
    Six Hypotheses in Search of a Theorem. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:2-12 [Conf]
  6. Harry Buhrman, Lance Fortnow, Thomas Thierauf
    Nonrelativizing Separations. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:8-12 [Conf]
  7. Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz
    Gap-Definable Counting Classes. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:30-42 [Conf]
  8. Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz, Lide Li
    An Oarcle Builder's Toolkit. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:120-131 [Conf]
  9. Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers
    Inverting Onto Functions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:213-222 [Conf]
  10. Joan Feigenbaum, Lance Fortnow
    On the Random-Self-Reducibility of Complete Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:124-132 [Conf]
  11. Eldar Fischer, Lance Fortnow
    Tolerant Versus Intolerant Testing for Boolean Properties. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:135-140 [Conf]
  12. Lance Fortnow
    Comparing Notions of Full Derandomization. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:28-34 [Conf]
  13. Lance Fortnow
    The History of Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:61- [Conf]
  14. Lance Fortnow
    Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for Satisfiability. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:52-60 [Conf]
  15. Lance Fortnow, Judy Goldsmith, Stephen R. Mahaney
    L-Printable Sets. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:97-106 [Conf]
  16. Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans
    On the Complexity of Succinct Zero-Sum Games. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:323-332 [Conf]
  17. Lance Fortnow, Adam R. Klivans
    NP with Small Advice. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:228-234 [Conf]
  18. Lance Fortnow, Dieter van Melkebeek
    Time-Space Tradeoffs for Nondeterministic Computation. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:2-13 [Conf]
  19. Lance Fortnow, Aduri Pavan, Samik Sengupta
    Proving SAT does not have Small Circuits with an Application to the Two. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:347-0 [Conf]
  20. Lance Fortnow, Nick Reingold
    PP is Closed Under Truth-Table Reductions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:13-15 [Conf]
  21. Lance Fortnow, John D. Rogers
    Complexity Limitations on Quantum Computation. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:202-209 [Conf]
  22. Lance Fortnow, John Rompel, Michael Sipser
    Errata for On the Power of Multi-Prover Interactive Protocols. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:318-319 [Conf]
  23. Lance Fortnow, Tomoyuki Yamakami
    Generic Separations. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:139-145 [Conf]
  24. Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik
    On Coherence, Random-self-reducibility, and Self-correction. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:59-67 [Conf]
  25. Joan Feigenbaum, Lance Fortnow, Carsten Lund, Daniel A. Spielman
    The Power of Adaptiveness and Additional Queries in Random-Self-Reductions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:338-346 [Conf]
  26. Rodney G. Downey, Lance Fortnow
    Uniformly Hard Languages. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:228-0 [Conf]
  27. Lance Fortnow, Aduri Pavan, Alan L. Selman
    Distributionally-Hard Languages. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:184-193 [Conf]
  28. Peter Cholak, Efim B. Kinber, Rodney G. Downey, Martin Kummer, Lance Fortnow, Stuart A. Kurtz, William I. Gasarch, Theodore A. Slaman
    Degrees of Inferability. [Citation Graph (0, 0)][DBLP]
    COLT, 1992, pp:180-192 [Conf]
  29. Lance Fortnow, Adam R. Klivans
    Efficient Learning Algorithms Yield Circuit Lower Bounds. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:350-363 [Conf]
  30. Lance Fortnow, Jack H. Lutz
    Prediction and Dimension. [Citation Graph (0, 0)][DBLP]
    COLT, 2002, pp:380-395 [Conf]
  31. Harry Buhrman, Lance Fortnow, Thomas Thierauf
    04421 Abstracts Collection - Algebraic Methods in Computational Complexity. [Citation Graph (0, 0)][DBLP]
    Algebraic Methods in Computational Complexity, 2004, pp:- [Conf]
  32. Luis Antunes, Lance Fortnow, N. V. Vinodchandran
    Using Depth to Capture Average-Case Complexity. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:303-310 [Conf]
  33. László Babai, Lance Fortnow
    A Characterization of \sharp P Arithmetic Straight Line Programs [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:26-34 [Conf]
  34. László Babai, Lance Fortnow, Carsten Lund
    Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:16-25 [Conf]
  35. Tugkan Batu, Lance Fortnow, Eldar Fischer, Ravi Kumar, Ronitt Rubinfeld, Patrick White
    Testing Random Variables for Independence and Identity. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:442-451 [Conf]
  36. Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White
    Testing that distributions are close. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:259-269 [Conf]
  37. Harry Buhrman, Lance Fortnow, Leen Torenvliet
    Using Autoreducibility to Separate Complexity Classes. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:520-527 [Conf]
  38. Lance Fortnow, Rahul Santhanam
    Hierarchy Theorems for Probabilistic Polynomial Time. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:316-324 [Conf]
  39. Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz
    The Isomorphism Conjecture Holds Relative to an Oracle [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:30-39 [Conf]
  40. Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan
    Algebraic Methods for Interactive Proof Systems [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:2-10 [Conf]
  41. Lance Fortnow
    My Favorite Ten Complexity Theorems of the Past Decade. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1994, pp:256-275 [Conf]
  42. Luis Antunes, Lance Fortnow
    Sophistication Revisited. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:267-277 [Conf]
  43. Harry Buhrman, Stephen A. Fenner, Lance Fortnow
    Results on Resource-Bounded Measure. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:188-194 [Conf]
  44. Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan
    Measure, Category and Learning Theory. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:558-569 [Conf]
  45. Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang
    Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:335-345 [Conf]
  46. Richard Beigel, Lance Fortnow, Frank Stephan
    Infinitely-Often Autoreducible Sets. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:98-107 [Conf]
  47. Lance Fortnow, John D. Rogers
    Separability and One-Way Functions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:396-404 [Conf]
  48. Lance Fortnow, Mitsunori Ogihara
    Very Sparse Leaf Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:375-386 [Conf]
  49. Richard Beigel, Noga Alon, Simon Kasif, Mehmet Serkan Apaydin, Lance Fortnow
    An optimal procedure for gap closing in whole genome shotgun sequencing. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2001, pp:22-30 [Conf]
  50. Joan Feigenbaum, Lance Fortnow, David M. Pennock, Rahul Sami
    Computation in a distributed information market. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2003, pp:156-165 [Conf]
  51. Lance Fortnow, Joe Kilian, David M. Pennock, Michael P. Wellman
    Betting boolean-style: a framework for trading in securities based on logical formulas. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2003, pp:144-155 [Conf]
  52. Harry Buhrman, Lance Fortnow, Ilan Newman, Hein Röhrig
    Quantum property testing. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:480-488 [Conf]
  53. Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler
    Sublinear-time approximation of Euclidean minimum spanning tree. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:813-822 [Conf]
  54. Harry Buhrman, Richard Chang, Lance Fortnow
    One Bit of Advice. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:547-558 [Conf]
  55. Harry Buhrman, Lance Fortnow
    Resource-Bounded Kolmogorov Complexity Revisited. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:105-116 [Conf]
  56. Harry Buhrman, Lance Fortnow
    One-sided Versus Two-sided Error in Probabilistic Computation. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:100-109 [Conf]
  57. Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Dieter van Melkebeek
    Optimal Proof Systems and Sparse Sets. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:407-418 [Conf]
  58. Harry Buhrman, Lance Fortnow, Ilan Newman, Nikolai K. Vereshchagin
    Increasing Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:412-421 [Conf]
  59. Harry Buhrman, Lance Fortnow, Aduri Pavan
    Some Results on Derandomization. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:212-222 [Conf]
  60. Stephen A. Fenner, Lance Fortnow
    Beyond P^(NP) - NEXP. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:619-627 [Conf]
  61. Stephen A. Fenner, Lance Fortnow, Lide Li
    Gap-Definability as a Closure Property. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:484-493 [Conf]
  62. Lance Fortnow, Adam R. Klivans
    Linear Advice for Randomized Logarithmic Space. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:469-476 [Conf]
  63. Lance Fortnow, Martin Kummer
    Resource-Bounded Instance Complexity (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:597-608 [Conf]
  64. Lance Fortnow, Carsten Lund
    Interactive Proof Systems and Alternating Time-Space Complexity. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:263-274 [Conf]
  65. Lance Fortnow, Sophie Laplante
    Nearly Optimal Language Compression Using Extractors. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:84-93 [Conf]
  66. Lance Fortnow, Troy Lee, Nikolai K. Vereshchagin
    Kolmogorov Complexity with Error. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:137-148 [Conf]
  67. László Babai, Lance Fortnow, Leonid A. Levin, Mario Szegedy
    Checking Computations in Polylogarithmic Time [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:21-31 [Conf]
  68. Richard Beigel, Harry Buhrman, Lance Fortnow
    NP Might Not Be As Easy As Detecting Unique Solutions. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:203-208 [Conf]
  69. Lance Fortnow
    Beyond NP: the work and legacy of Larry Stockmeyer. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:120-127 [Conf]
  70. Lance Fortnow
    The Complexity of Perfect Zero-Knowledge (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:204-209 [Conf]
  71. Lance Fortnow, Michael Sipser
    Probabilistic Computation and Linear Time [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:148-156 [Conf]
  72. Lance Fortnow, Michael Sipser
    Retraction of Probabilistic Computation and Linear Time. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:750- [Conf]
  73. Lance Fortnow, Rahul Santhanam, Luca Trevisan
    Hierarchies for semantic classes. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:348-355 [Conf]
  74. Lance Fortnow, Duke Whang
    Optimality and domination in repeated games with bounded players. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:741-749 [Conf]
  75. Lance Fortnow, Peter G. Kimmel
    Beating a Finite Automaton in the Big Match. [Citation Graph (0, 0)][DBLP]
    TARK, 1998, pp:225-234 [Conf]
  76. Lance Fortnow, William I. Gasarch, Sanjay Jain, Efim B. Kinber, Martin Kummer, Stuart A. Kurtz, Mark Pleszkovich, Theodore A. Slaman, Robert Solovay, Frank Stephan
    Extremes in the Degrees of Inferability. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1994, v:66, n:3, pp:231-276 [Journal]
  77. Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik
    On Coherence, Random-Self-Reducibility, and Self-Correction. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1998, v:7, n:2, pp:174-191 [Journal]
  78. László Babai, Lance Fortnow
    Arithmetization: A New Method in Structural Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1991, v:1, n:, pp:41-66 [Journal]
  79. Joan Feigenbaum, Lance Fortnow, Carsten Lund, Daniel A. Spielman
    The Power of Adaptiveness and Additional Queries in Random-Self-Reductions. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:158-174 [Journal]
  80. László Babai, Lance Fortnow, Carsten Lund
    Non-Deterministic Exponential Time has Two-Prover Interactive Protocols. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1991, v:1, n:, pp:3-40 [Journal]
  81. László Babai, Lance Fortnow, Carsten Lund
    Addendum to Non-Deterministic Exponential Time has Two-Prover Interactive Protocols. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1992, v:2, n:, pp:374- [Journal]
  82. Lance Fortnow, John D. Rogers
    Separability and one-way functions. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2002, v:11, n:3-4, pp:137-157 [Journal]
  83. László Babai, Lance Fortnow, Noam Nisan, Avi Wigderson
    BPP Has Subexponential Time Simulations Unless EXPTIME has Publishable Proofs. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1993, v:3, n:, pp:307-318 [Journal]
  84. Richard Beigel, Lance Fortnow, William I. Gasarch
    A tight lower bound for restricted pir protocols. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2006, v:15, n:1, pp:82-91 [Journal]
  85. Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Leen Torenvliet
    Two oracles that force a big crunch. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:2, pp:93-116 [Journal]
  86. Lance Fortnow, John D. Rogers
    Complexity limitations on quantum computation [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  87. Lance Fortnow
    One Complexity Theorist's View of Quantum Computing [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  88. Lance Fortnow, Joe Kilian, David M. Pennock, Michael P. Wellman
    Betting Boolean-style: a framework for trading in securities based on logical formulas. [Citation Graph (0, 0)][DBLP]
    Decision Support Systems, 2005, v:39, n:1, pp:87-104 [Journal]
  89. Lance Fortnow
    Diagonalization. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2000, v:71, n:, pp:102-113 [Journal]
  90. Lance Fortnow
    The Role of Relativization in Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1994, v:52, n:, pp:229-243 [Journal]
  91. Lance Fortnow, Steve Homer
    A Short History of Computational Complexity. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2003, v:80, n:, pp:95-133 [Journal]
  92. Lance Fortnow, Dieter van Melkebeek
    Time-Space Tradeoffs for Nondeterministic Computation [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:28, pp:- [Journal]
  93. Richard Beigel, Lance Fortnow, William I. Gasarch
    A Nearly Tight Bound for Private Information Retrieval Protocols [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:087, pp:- [Journal]
  94. Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans
    On the complexity of succinct zero-sum games [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:001, pp:- [Journal]
  95. Richard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrei A. Muchnik, Frank Stephan, Leen Torenvliet
    Enumerations of the Kolmogorov Function [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:015, pp:- [Journal]
  96. Lance Fortnow, Troy Lee, Nikolai K. Vereshchagin
    Kolmogorov Complexity with Error [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:080, pp:- [Journal]
  97. Harry Buhrman, Lance Fortnow, Ilan Newman, Nikolai K. Vereshchagin
    Increasing Kolmogorov Complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:081, pp:- [Journal]
  98. Lance Fortnow, Rahul Santhanam, Luca Trevisan
    Promise Hierarchies [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:098, pp:- [Journal]
  99. Lance Fortnow, Adam R. Klivans
    NP with Small Advice [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:103, pp:- [Journal]
  100. Eldar Fischer, Lance Fortnow
    Tolerant Versus Intolerant Testing for Boolean Properties [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:105, pp:- [Journal]
  101. Lance Fortnow, Adam R. Klivans
    Linear Advice for Randomized Logarithmic Space [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:042, pp:- [Journal]
  102. Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang
    Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:105, pp:- [Journal]
  103. Lance Fortnow, Luis Antunes
    Time-Bounded Universal Distributions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:144, pp:- [Journal]
  104. Lance Fortnow
    My Favorite Ten Complexity Theorems of the Past Decade [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:21, pp:- [Journal]
  105. Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz, Lide Li
    An oracle builder's toolkit. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:182, n:2, pp:95-136 [Journal]
  106. Stephen A. Fenner, Lance Fortnow, Lide Li
    Gap-Definability as a Closure Property. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:130, n:1, pp:1-17 [Journal]
  107. Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers
    Inverting onto functions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:186, n:1, pp:90-103 [Journal]
  108. Lance Fortnow, Sophie Laplante
    Circuit Lower Bounds à la Kolmogorov. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:123, n:1, pp:121-126 [Journal]
  109. Lance Fortnow, Nick Reingold
    PP is Closed Under Truth-Table Reductions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:124, n:1, pp:1-6 [Journal]
  110. Lance Fortnow
    Relativized Worlds with an Infinite Hierarchy. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:69, n:6, pp:309-313 [Journal]
  111. Lance Fortnow, Michael Sipser
    Are There Interactive Protocols for CO-NP Languages? [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:28, n:5, pp:249-251 [Journal]
  112. Lance Fortnow, Mario Szegedy
    On the Power of Two-Local Random Reductions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:6, pp:303-306 [Journal]
  113. Lance Fortnow, Richard J. Lipton, Dieter van Melkebeek, Anastasios Viglas
    Time-space lower bounds for satisfiability. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:6, pp:835-865 [Journal]
  114. Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan
    Algebraic Methods for Interactive Proof Systems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:4, pp:859-868 [Journal]
  115. Harry Buhrman, Lance Fortnow
    Two Queries. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:59, n:2, pp:182-194 [Journal]
  116. Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz
    Gap-Definable Counting Classes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:48, n:1, pp:116-148 [Journal]
  117. Lance Fortnow
    Time-Space Tradeoffs for Satisfiability. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:60, n:2, pp:337-353 [Journal]
  118. Lance Fortnow
    Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:2, pp:215- [Journal]
  119. 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]
  120. Lance Fortnow, John D. Rogers
    Complexity Limitations on Quantum Computation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:59, n:2, pp:240-252 [Journal]
  121. Lance Fortnow, Tomoyuki Yamakami
    Generic Separations. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:52, n:1, pp:191-197 [Journal]
  122. Harry Buhrman, Lance Fortnow, Aduri Pavan
    Some Results on Derandomization. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2005, v:38, n:2, pp:211-227 [Journal]
  123. Lance Fortnow, Aduri Pavan, Alan L. Selman
    Distributionally Hard Languages. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2001, v:34, n:3, pp:245-261 [Journal]
  124. Harry Buhrman, Lance Fortnow, Sophie Laplante
    Resource-Bounded Kolmogorov Complexity Revisited. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:3, pp:887-905 [Journal]
  125. Harry Buhrman, Lance Fortnow, Dieter van Melkebeek, Leen Torenvliet
    Separating Complexity Classes Using Autoreducibility. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:5, pp:1497-1520 [Journal]
  126. Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler
    Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:1, pp:91-109 [Journal]
  127. Joan Feigenbaum, Lance Fortnow
    Random-Self-Reducibility of Complete Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:5, pp:994-1005 [Journal]
  128. Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz
    The Isomorphism Conjecture Holds Relative to an Oracle. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:1, pp:193-206 [Journal]
  129. Lance Fortnow, Judy Goldsmith, Matthew A. Levy, Stephen R. Mahaney
    L-Printable Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:137-151 [Journal]
  130. Richard Beigel, Lance Fortnow, Frank Stephan
    Infinitely-Often Autoreducible Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:3, pp:595-608 [Journal]
  131. Luis Antunes, Lance Fortnow, Dieter van Melkebeek, N. V. Vinodchandran
    Computational depth: Concept and applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:354, n:3, pp:391-404 [Journal]
  132. Rodney G. Downey, Lance Fortnow
    Uniformly hard languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:2, n:298, pp:303-315 [Journal]
  133. Joan Feigenbaum, Lance Fortnow, David M. Pennock, Rahul Sami
    Computation in a distributed information market. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:343, n:1-2, pp:114-132 [Journal]
  134. Lance Fortnow
    One complexity theorist's view of quantum computing. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:31, n:, pp:- [Journal]
  135. Lance Fortnow
    One complexity theorist's view of quantum computing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:3, pp:597-610 [Journal]
  136. Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan
    On the Relative Sizes of Learnable Sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:197, n:1-2, pp:139-156 [Journal]
  137. Lance Fortnow, Martin Kummer
    On Resource-Bounded Instance Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:161, n:1&2, pp:123-140 [Journal]
  138. Lance Fortnow, Carsten Lund
    Interactive Proof Systems and Alternating Time-Space Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:113, n:1, pp:55-73 [Journal]
  139. Lance Fortnow, John Rompel, Michael Sipser
    On the Power of Multi-Prover Interactive Protocols. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:134, n:2, pp:545-557 [Journal]
  140. Luis Antunes, Lance Fortnow, Alexandre Pinto, Andre Souto
    Low-Depth Witnesses are Easy to Find. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:46-51 [Conf]
  141. Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin
    Inverting Onto Functions and Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:92-103 [Conf]
  142. Yiling Chen, Lance Fortnow, Evdokia Nikolova, David M. Pennock
    Betting on permutations. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2007, pp:326-335 [Conf]

  143. Worst-Case Running Times for Average-Case Algorithms. [Citation Graph (, )][DBLP]


  144. Fixed-Polynomial Size Circuit Bounds. [Citation Graph (, )][DBLP]


  145. Derandomizing from Random Strings. [Citation Graph (, )][DBLP]


  146. 07411 Executive Summary -- Algebraic Methods in Computational Complexity. [Citation Graph (, )][DBLP]


  147. 07411 Abstracts Collection -- Algebraic Methods in Computational Complexity. [Citation Graph (, )][DBLP]


  148. Unconditional Lower Bounds against Advice. [Citation Graph (, )][DBLP]


  149. The complexity of forecast testing: abstract. [Citation Graph (, )][DBLP]


  150. Complexity of combinatorial market makers. [Citation Graph (, )][DBLP]


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


  152. Infeasibility of instance compression and succinct PCPs for NP. [Citation Graph (, )][DBLP]


  153. Program equilibria and discounted computation time. [Citation Graph (, )][DBLP]


  154. A computational theory of awareness and decision making. [Citation Graph (, )][DBLP]


  155. Bluffing and Strategic Reticence in Prediction Markets. [Citation Graph (, )][DBLP]


  156. Bounding Rationality by Discounting Time. [Citation Graph (, )][DBLP]


  157. The status of the P versus NP problem. [Citation Graph (, )][DBLP]


  158. Viewpoint - Time for computer science to grow up. [Citation Graph (, )][DBLP]


  159. On the Complexity of Succinct Zero-Sum Games. [Citation Graph (, )][DBLP]


  160. Complexity of Combinatorial Market Makers [Citation Graph (, )][DBLP]


  161. Complexity Classes of Equivalence Problems Revisited [Citation Graph (, )][DBLP]


  162. Bounding Rationality by Discounting Time [Citation Graph (, )][DBLP]


  163. Derandomizing from Random Strings [Citation Graph (, )][DBLP]


  164. A Computational Theory of Awareness and Decision Making. [Citation Graph (, )][DBLP]


  165. Time Hierarchies: A Survey. [Citation Graph (, )][DBLP]


  166. Infeasibility of Instance Compression and Succinct PCPs for NP. [Citation Graph (, )][DBLP]


  167. Low-Depth Witnesses are Easy to Find. [Citation Graph (, )][DBLP]


  168. The Complexity of Forecast Testing. [Citation Graph (, )][DBLP]


  169. Fixed-Polynomial Size Circuit Bounds. [Citation Graph (, )][DBLP]


  170. Inverting onto functions might not be hard. [Citation Graph (, )][DBLP]


Search in 0.011secs, Finished in 0.019secs
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