`Travelled to:`

1 × Greece

1 × Hungary

1 × Switzerland

1 × The Netherlands

2 × Canada

2 × Italy

6 × USA

`Collaborated with:`

R.Santhanam H.Buhrman ∅ M.Sipser L.Antunes D.Whang L.Trevisan R.Beigel S.A.Fenner L.Babai L.A.Levin M.Szegedy J.M.Hitchcock A.Pavan N.V.Vinodchandran F.Wang R.Freivalds W.I.Gasarch M.Kummer S.A.Kurtz C.H.Smith F.Stephan

`Talks about:`

comput (3) bound (3) time (3) probabilist (2) complex (2) measur (2) linear (2) zero (2) polylogarithm (1) kolmogorov (1)

## Person: Lance Fortnow

### DBLP: Fortnow:Lance

### Facilitated 1 volumes:

### Contributed to:

### Wrote 15 papers:

- ICALP-v1-2011-FortnowS #robust #simulation
- Robust Simulations and Significant Separations (LF, RS), pp. 569–580.
- ICALP-v1-2009-BuhrmanFS #bound
- Unconditional Lower Bounds against Advice (HB, LF, RS), pp. 195–209.
- STOC-2008-FortnowS
- Infeasibility of instance compression and succinct PCPs for NP (LF, RS), pp. 133–142.
- ICALP-v1-2006-FortnowHPVW #complexity
- Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws (LF, JMH, AP, NVV, FW), pp. 335–345.
- STOC-2005-Fortnow #legacy
- Beyond NP: the work and legacy of Larry Stockmeyer (LF), pp. 120–127.
- STOC-2005-FortnowST #semantics
- Hierarchies for semantic classes (LF, RS, LT), pp. 348–355.
- ICALP-2003-AntunesF #revisited
- Sophistication Revisited (LA, LF), pp. 267–277.
- STOC-1998-BeigelBF #detection
- NP Might Not Be As Easy As Detecting Unique Solutions (RB, HB, LF), pp. 203–208.
- ICALP-1997-BuhrmanFF #bound
- Results on Resource-Bounded Measure (HB, SAF, LF), pp. 188–194.
- STOC-1997-FortnowS #linear #probability
- Retraction of Probabilistic Computation and Linear Time (LF, MS), p. 750.
- ICALP-1995-FortnowFGKKSS #learning
- Measure, Category and Learning Theory (LF, RF, WIG, MK, SAK, CHS, FS), pp. 558–569.
- STOC-1994-FortnowW #bound #game studies
- Optimality and domination in repeated games with bounded players (LF, DW), pp. 741–749.
- STOC-1991-BabaiFLS
- Checking Computations in Polylogarithmic Time (LB, LF, LAL, MS), pp. 21–31.
- STOC-1989-FortnowS #linear #probability
- Probabilistic Computation and Linear Time (LF, MS), pp. 148–156.
- STOC-1987-Fortnow #complexity
- The Complexity of Perfect Zero-Knowledge (LF), pp. 204–209.