Back to Results
First PageMeta Content
Carsten Lund / Computational learning theory / Sparse language / IP / ACM SIGACT / Computer science / International Colloquium on Automata /  Languages and Programming / Interactive proof system / Probabilistically checkable proof / Theoretical computer science / Applied mathematics / Computational complexity theory


Lance Jeremy Fortnow Georgia Institute of Technology School of Computer Science 266 Ferst Drive Atlanta, GA 30332
Add to Reading List

Document Date: 2014-06-05 11:48:59


Open Document

File Size: 200,67 KB

Share Result on Facebook

City

Porto / Buffalo / Madras / Montreal / Elmsford / Oxford / Kyoto / Lecture / Amsterdam / Milan / Baltimore / New York / Meeting / Canberra / Berlin / Computational Intractability / Prague / IEEE / Aarhus / Beijing / Chicago / Dagstuhl / South Bend / /

Company

Kellogg / Interactive Proof Systems / Twitter / Princeton University Press / JAI Press / Hanson / Wellman / NSF Focused Research Group / Tsinghua University Press / Marion / Peer Review / Oracle / SIAM Journal / Ro SIAM Journal / Decision Support Systems / The Chicago Journal / /

Country

Netherlands / United Kingdom / India / Denmark / Germany / Italy / Russia / United States / /

/

Facility

Toyota Technological Institute / NEC Research Institute / Education Massachusetts Institute of Technology Doctor / Georgia Institute / Williams College / Lance Jeremy Fortnow Georgia Institute of Technology School / University of Alberta / /

IndustryTerm

e - commerce / Internet And Network / average-case algorithms / market maker / proof systems / learning algorithms / /

Organization

Association of Symbolic Logic / Princeton University / Europe European Association for Computer Science Logic Plenary Lecture / Texas A& M / Massachusetts Institute of Technology / University of Alberta / Cornell University / Service CRA Board / University of Chicago / European Association for Theoretical Computer Science / School of Management / Center for Research / Tsinghua University / National Science Foundation / Northwestern University / Asian Association for Algorithms and Computation Annual / Executive Committee / Williams College / Scientific Board / Academic Advisory Committee / Graduate School / Georgia Institute of Technology / Georgia Institute of Technology School of Computer Science / Toyota Technological Institute / Institute of Technology Doctor of Philosophy / Steering Committee / NEC Research Institute / Computational Complexity Steering Committee / /

Person

Algorithmic Randomness / Larry Stockmeyer / Carsten Lund / Joshua Grochow / Rahul Santhanam / Luis Antunes / Michael Sipser / Jason Teutsch / Paul Vitanyi / Lance Jeremy Fortnow / Dieter van Melkebeek / John Rogers / Sophie Laplante / ACM SIGACT / Stephen Fenner / /

/

Position

Advisor / Stony Brook University Computer Science Distinguished Lecturer / Engineering Distinguished Speaker / Workshops Chair / General / Senior Research Scientist / Vice-Chair / Professor / Associate Professor / editor / Professor of Electrical Engineering / Thesis Advisor / Editor-in-Chief / Keynote Speaker / co-Chair / Assistant Professor / Chair / Professor of Managerial Economics and Decision Sciences / Electronic Commerce General Chair / Distinguished Lecturer / /

ProvinceOrState

New Brunswick / Indiana / New York / Georgia / Alberta / /

PublishedMedium

Journal of the ACM / the Theory of Computing / The Chicago Journal / SIAM Journal on Computing / Peer Review / Genome Research / Theoretical Computer Science / Theory of Computing / Lecture Notes in Computer Science / /

Technology

Software Technology / restricted PIR protocols / average-case algorithms / 1997 Education Massachusetts Institute of Technology / /

URL

http /

SocialTag