About the Authors
Eldar Fischer
Faculty of Computer Science
Technion -- Israel Institute of Technology
Technion City, Haifa 32000, Israel
eldar[ta]cs[td]technion[td]ac[td]il
http://www.cs.technion.ac.il/users/eldar
Faculty of Computer Science
Technion -- Israel Institute of Technology
Technion City, Haifa 32000, Israel
eldar[ta]cs[td]technion[td]ac[td]il
http://www.cs.technion.ac.il/users/eldar
Eldar Fischer completed
his Ph. D. in 1999
at Tel-Aviv University under the supervision of
Noga Alon
and has been a member of
the Faculty of Computer Science at the Israel Institute of Technology
(the Technion) since 2001.
His main interests lie in the analysis of algorithms, especially
sublinear ones,
but he is also known to dabble in Formal Logic and to investigate the odd
combinatorial graph-theoretic question.
His main extra-curricular interest centers on board and card games, especially
the less well known ones.
Lance Fortnow
Department of Computer Science
University of Chicago
1100 E 58th St., Chicago, IL 60637, USA
fortnow[ta]cs[td]uchicago[td]edu
http://people.cs.uchicago.edu/~fortnow
Department of Computer Science
University of Chicago
1100 E 58th St., Chicago, IL 60637, USA
fortnow[ta]cs[td]uchicago[td]edu
http://people.cs.uchicago.edu/~fortnow
Lance Fortnow
received his Ph.D. under Michael Sipser
in Applied Mathematics at MIT in 1989. He has spent his academic career
at the University of Chicago with the exception of a senior research
scientist postion at the NEC Research Institute from 1999 to 2003. In
1992 he received the NSF Presidential Faculty Fellowship and was a
Fulbright Scholar visiting CWI in Amsterdam 1996-97. Fortnow studies
computational complexity and its applications to electronic commerce,
quantum computation, bioinformatics, learning theory and
cryptography. His early work on interactive proofs precipitated the
development of probabilistically checkable proofs and
inapproximability theory. Fortnow writes the popular scientific and
academic weblog Computational
Complexity.