Relativized worlds with an infinite hierarchyFORTNOW, L.Information processing letters. 1999, Vol 69, Num 6, pp 309-313, issn 0020-0190Article

PP is closed under truth-table reductionsFORTNOW, L; REINGOLD, N.Information and computation (Print). 1996, Vol 124, Num 1, pp 1-6, issn 0890-5401Article

On the power of two-local random reductions = Sur la pouvoir de la double réduction locale aléatoireFORTNOW, L; SZEGEDY, M.Information processing letters. 1992, Vol 44, Num 6, pp 303-306, issn 0020-0190Article

Circuit lower bounds à la KolmogorovFORTNOW, L; LAPLANTE, S.Information and computation (Print). 1995, Vol 123, Num 1, pp 121-126, issn 0890-5401Article

Random-self-reducibility of complete setsFEIGENBAUM, J; FORTNOW, L.SIAM journal on computing (Print). 1993, Vol 22, Num 5, pp 994-1005, issn 0097-5397Article

The isomorphism conjectuve holds relative to an oracleFENNER, S; FORTNOW, L; KURTZ, S. A et al.SIAM journal on computing (Print). 1996, Vol 25, Num 1, pp 193-206, issn 0097-5397Article

Algebraic methods for interactive proof systemsLUND, C; FORTNOW, L; KARLOFF, H et al.Journal of the Association for Computing Machinery. 1992, Vol 39, Num 4, pp 859-868, issn 0004-5411Article

Optimal proof systems and sparse setsBUHRMAN, H; FENNER, S; FORTNOW, L et al.Lecture notes in computer science. 2000, pp 407-418, issn 0302-9743, isbn 3-540-67141-2Conference Paper

Results on resource-bounded measureBUHRMAN, H; FENNER, S; FORTNOW, L et al.Lecture notes in computer science. 1997, pp 188-194, issn 0302-9743, isbn 3-540-63165-8Conference Paper

Distributionally-hard languagesFORTNOW, L; PAVAN, A; SELMAN, A. L et al.Lecture notes in computer science. 1999, pp 184-193, issn 0302-9743, isbn 3-540-66200-6Conference Paper

Nearly optimal language compression using extractorsFORTNOW, L; LAPLANTE, S.Lecture notes in computer science. 1998, pp 84-93, issn 0302-9743, isbn 3-540-64230-7Conference Paper

L-printable setsFORTNOW, L; GOLDSMITH, J; LEVY, M. A et al.SIAM journal on computing (Print). 1999, Vol 28, Num 1, pp 137-151, issn 0097-5397Article

Intreractive proof systems and alternating time-space complexityFORTNOW, L; LUND, C.Theoretical computer science. 1993, Vol 113, Num 1, pp 55-73, issn 0304-3975Conference Paper