Fortnow, Lance - Department of Electrical and Computer Engineering, Northwestern University

• Linear Advice for Randomized Logarithmic Lance Fortnow1
• Proving SAT does not have Small Circuits with an Application to the Two Queries Problem
• Testing random variables for independence and identity Tugkan Batu
• ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUMy AND LANCE FORTNOWz
• Computational Depth: Concept and Applications
• The Internal and External Algebraic Structure of Complexity Classes
• Hierarchies for Semantic Classes [Extended Abstract]
• A Short History of Computational Complexity Lance Fortnow
• Gap-De nable Counting Classes Stephen A. Fenner
• Membership Comparable and p-selective Sets Richard Beigel
• Distributionally-Hard Languages Lance Fortnow A. Pavan Alan L. Selman
• On the Power of Two-Local Random Reductions Lance Fortnow
• Retraction of Probabilistic Computation and Linear Time
• INTERACTIVE PROOF SYSTEMS AND ALTERNATING TIME-SPACE
• The Complexity of Perfect Zero-Knowledge Lance Fortnow
• Circuit Lower Bounds a la Kolmogorov Lance Fortnow1
• Relativized Worlds with an In nite Hierarchy Lance Fortnowy
• A Computational Theory of Awareness and Decision Making Nikhil R Devanur
• Checking Computations in Polylogarithmic Time Laszlo Babai 1
• Fixed-Polynomial Size Circuit Bounds Lance Fortnow
• Complexity Limitations on Quantum Computation Lance Fortnow
• ON THE COMPLEXITY OF SUCCINCT ZERO-SUM GAMES
• NP with Small Advice Lance Fortnow
• BPP HAS SUBEXPONENTIAL TIME SIMULATIONS
• Very Sparse Leaf Languages Lance Fortnow
• Computational Identification of Operons in Microbial Genomes
• Worst-Case Running Times for Average-Case Luis Antunes
• Inverting Onto Functions Stephen A. Fenner1
• One Bit of Advice Harry Buhrman1
• Two Queries Harry Buhrman
• Complexity Classes of Equivalence Problems Revisited Lance Fortnow and Joshua A. Grochow
• Derandomizing from Random Strings Harry Buhrman
• Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
• Bounding Rationality by Discounting Time Lance Fortnow1
• Inseparability and Strong Hypotheses for Disjoint NP Pairs
• Sophistication Revisited Luis Antunes
• Program Equilibria and Discounted Computation Time Lance Fortnow
• THEORY OF COMPUTING, Volume 5 (2009), pp. 135140 www.theoryofcomputing.org
• Time for Computer Science to Grow Up Lance Fortnow
• Enumerations of the Kolmogorov Function Richard Beigela
• Infinitely-Often Autoreducible Sets Richard Beigel
• Tolerant Versus Intolerant Testing for Boolean Properties Eldar Fischer
• Kolmogorov Complexity with Error Lance Fortnow1
• Increasing Kolmogorov Complexity Harry Buhrman
• Some Results on Derandomization Harry Buhrman
• Sublinear-Time Approximation of Euclidean Minimum Spanning Tree Artur Czumaj
• Computation in a Distributed Information Market Joan Feigenbaum
• Beyond NP: The Work and Legacy of Larry Stockmeyer Lance Fortnow
• Time-Space Lower Bounds for Satisfiability Lance Fortnow
• Are Cook and Karp Ever the Same? Richard Beigel
• An Oracle Builder's Toolkit Stephen Fenner
• Theory of Quantum Computing and Communication
• Time-Space Tradeoffs for Satisfiability Lance Fortnow
• One-sided Versus Two-sided Error in Probabilistic Computation
• Comput. complex. 7 (1998), 174 { 191 1016-3328/97/040174{18 $ 1.50+0.20/0
• On the Relative Sizes of Learnable Sets
• Generic Separations Lance Fortnowy
• My Favorite Ten Complexity Theorems of the Past Decade
• The Role of Relativization in Complexity Theory Lance Fortnow
• Optimality and Domination in Repeated Games with Bounded Players
• The In nite Version of an Open Communication Complexity Problem is Independent of the Axioms of Set Theory
• On the Power of Multi-Prover Interactive Protocols Lance Fortnow
• Algebraic Methods for Interactive Proof Systems Carsten Lund
• ARITHMETIZATION: A NEW METHOD IN STRUCTURAL
• Complexity-Theoretic Aspects of Interactive Proof Systems Lance Jeremy Fortnow
• Probabilistic Computation and Linear Time Lance Fortnow
• http://www.econometricsociety.org/ Econometrica, Vol. 77, No. 1 (January, 2009), 93105
• Testing Closeness of Discrete Distributions TUGKAN BATU
• Kolmogorov Complexity and Computational Complexity Lance Fortnow
• Uniformly Hard Languages Victoria University
• Nonrelativizing Separations Harry Buhrman Lance Fortnowy
• A Nearly Tight Lower Bound for Restricted Private Information Retrieval Protocols
• Six Hypotheses in Search of a Theorem Harry Buhrman Lance Fortnowy
• LOW-DEPTH WITNESSES ARE EASY TO FIND
• THE POWER OF ADAPTIVENESS AND ADDITIONAL QUERIES IN
• Quantum Property Testing Harry Buhrman
• On Resource-Bounded Instance Complexity Lance Fortnowy
• Ubiquity, an ACM publication December, 2010
• Betting Boolean-Style: A Framework for Trading in Securities Based on Logical
• The Isomorphism Conjecture Holds Relative to an Oracle Stephen Fenner Lance Fortnowy
• Extremes in the Degrees of Inferability Lance Fortnow
• Unconditional Lower Bounds Against Advice Harry Buhrman
• Are There Interactive Protocols for Co-NP Languages? Lance Fortnow
• One Complexity Theorist's View of Quantum Computing Lance Fortnow
• Infeasibility of Instance Compression and Succinct PCPs for NP
• SIGACT News Complexity Theory Column 52 Lane A. Hemaspaandra
• Prediction and Dimension Lance Fortnow
• Complexity of Combinatorial Market Makers Yiling Chen
• The Status of the P versus NP Problem Lance Fortnow
• NP Might Not Be As Easy As Detecting Unique Solutions Richard Beigel
• arXiv:1102.1096v1[cs.GT]5Feb2011 Repeated Matching Pennies
• Kolmogorov Complexity Lance Fortnow
• Gap-De nability as a Closure Property Stephen Fenner
• Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws
• Efficient Learning Algorithms Yield Circuit Lower Bounds Lance Fortnow
• L-Printable Sets Lance Fortnow
• Robust Simulations and Significant Separations Lance Fortnow1
• This is page 1 Printer: Opaque this
• Betting on Permutations Yiling Chen
• PP is Closed Under Truth-Table Reductions Lance Fortnow Nick Reingoldy
• NON-DETERMINISTIC EXPONENTIAL TIME HAS
• Beating A Finite Automaton in the Big Match Lance Fortnow
• Results on Resource-Bounded Measure Harry Buhrman?1
• Multi-outcome and Multidimensional Market Scoring Rules (Manuscript)