About the Authors
Ruiwen Chen
rwchenmail[ta]gmail[td]com
rwchenmail[ta]gmail[td]com
Ruiwen Chen graduated with a Ph.D. in Computer Science
from Simon Fraser University
in 2014, advised by Valentine Kabanets, and then worked as a
postdoc with Rahul Santhanam until 2017.
Rahul Santhanam
Department of Computer Science
University of Oxford
Oxford, U.K.
rahul.santhanam[ta]cs[td]ox[td]ac[td]uk
Department of Computer Science
University of Oxford
Oxford, U.K.
rahul.santhanam[ta]cs[td]ox[td]ac[td]uk
Rahul Santhanam
got his Ph.D. in Computer Science
from the University of Chicago in 2005,
advised by Lance Fortnow and Janos Simon. After stints at Simon Fraser
University, the University of Toronto and the University of Edinburgh,
he is now a Professor of Computer Science at the University of Oxford. His
main research interest is in complexity lower bounds.
Srikanth Srinivasan
Department of Mathematics
IIT Bombay, Mumbai, India
srikanth[ta]math[td]iitb[td]ac[td]in
Department of Mathematics
IIT Bombay, Mumbai, India
srikanth[ta]math[td]iitb[td]ac[td]in
Srikanth Srinivasan
got his undergraduate degree from the
Indian Institute of Technology Madras.
He received his Ph.D. from
The Institute of Mathematical Sciences
in Chennai, India in 2011, where his advisor was
V. Arvind.
His research interests include circuit complexity, derandomization, and
related areas of mathematics.