Job Candidates

Radoslav Fulek

Candidate Bio:

I did my B.Sc. in CS at Comenius University, Bratislava, Slovakia, graduating in 2005; M.Sc. in CS at Simon Fraser University, Burnaby, BC, Canada, with Gábor Tardos, graduating in 2008; and PhD in Mathematics with János Pach at EPFL, Lausanne, Switzerland, graduating in 2012. I held postdoctoral research positions at EPFL (2012-13), Charles University, Prague, Czechia (2013), Columbia University, NYC (2013-2015), and IST Austria, Klosterneuburg, Austria (2015-2019). I joined University of Arizona as a postdoctoral research associate in September 2019.

Keywords: computational geometry

View Candidate

---

Yun Kuen Cheung

Candidate Bio:

I have held postdoctoral positions in University of Vienna and Max Planck Institute (MPI) for Informatics, and currently in Singapore University of Technology and Design. Trained as a Theoretical Computer Science (TCS) researcher and having knowledge of Dynamical Systems (DS), I enjoy the interdisciplinary research at the intersection of Computer Science and Economics, where I have applied concepts and techniques in TCS and DS to analyze (in)stability of machine learning algorithm, asynchronous optimization and market dynamics. I also like thinking about problems in Combinatorics, particularly those arising from Graph Sparsification and Partitioning.

Keywords: Computational Economics

View Candidate

---

Ján Pich

Candidate Bio:

I completed my PhD in the area of Proof Complexity under supervision of Jan Krajíček. Afterwards, I held a postdoctoral position at the University of Toronto hosted by Stephen Cook, Toniann Pitassi and Alasdair Urquhart, a postdoctoral position at the University of Leeds hosted by Olaf Beyersdorff, and then relocated to the University of Vienna where I worked with Moritz Muller on an FWF project “Complexity Theory in Feasible Mathematics”. Later I continued my research at the University of Oxford hosted by Rahul Santhanam. Since September 2019 I am back in Prague at the Czech Academy of Sciences.

Keywords: proof complexity

View Candidate

---

Alexander Knop

Candidate Bio:

"I have a master degree in mathematics from St Petersburg State University with a specialty in algebra in 2013. Afterward, I have studied at Steklov Institute at St Petersburg as a Ph. D. student in mathematical logic under the supervision of Edward A. Hirsch. Last three years, I am an SEW Assistant Professor at the University of California, San Diego.

During my Ph. D. studies, in addition to the research, I taught algebra, algorithms, discrete mathematics, and complexity theory at Academic University at St Petersburg and in the centers of extracurricular education."

Keywords: computational complexity

View Candidate

---

Kyle Luh

Candidate Bio:

I am an NSF postdoctoral fellow at Harvard University with joint appointments in the School of Engineering and Applied Sciences and the Center for Mathematical Sciences and Applications. I graduated from Yale University in 2017 under the supervision of Van Vu. Before that, I received my undergraduate degree from Harvey Mudd College.

Keywords: Random matrices

View Candidate

---

Alexander Golovnev

Candidate Bio:

I am a Rabin postdoc at Harvard University. Prior to this, I was a research scientist at Columbia University and Yahoo Research. In 2017 I received my PhD from NYU advised by Oded Regev and Yevgeniy Dodis.

Keywords: computational complexity

View Candidate

---

Venkata Gandikota

Candidate Bio:

I am a postdoctoral researcher in the College of Information and Computer Sciences at the University of Massachusetts at Amherst, working with Prof. Arya Mazumdar. Before this, I was a postdoctoral fellow at Johns Hopkins University, working with Prof. Xin Li on error-correcting codes. I received my Ph.D. in Computer Science from Purdue University under the supervision of Prof. Elena Grigorescu. I am interested in the foundations of data science and machine learning. In the past, I have thoroughly enjoyed working on lattices and error-correcting codes.

Keywords: coding theory

View Candidate

---

Sagnik Mukhopadhyay

Candidate Bio:

Ph.D. from TIFR, India in 2017. Currently a post-doc with Danupon Nanongkai at KTH Sweden working on distributed graph algorithms. Interested in communication complexity and various applications of it.

Keywords: Communication complexity

View Candidate

---

Noah Stephens-Davidowitz

Candidate Bio:

"I am a postdoctoral researcher at MIT's computer science department, supervised by Professor Vinod Vaikunthanathan. My research to date has focused mostly on lattices and computational problems on lattices, but I am also interested in theoretical computer science and cryptography more broadly.

I received my PhD from NYU’s Courant Institute, advised by Professors Oded Regev and Yevgeniy Dodis. Before MIT, I was a postdoc at Princeton’s computer science department and a visiting researcher at the Institute for Advanced Study’s math department---both as part of the Simons Collaboration on Algorithms and Geometry."

Keywords: cryptography

View Candidate

---

Visu Makam

Candidate Bio:

My name is Visu Makam. I am a postdoctoral researcher at the Institute for Advanced Study at Princeton, where my mentor is Avi Wigderson. I received my Ph.D. in mathematics at the University of Michigan in April 2018 under the direction of Harm Derksen.

Keywords: polynomial identity testing

View Candidate

---