Ankit Garg



I am a third year PhD student in the Department of Computer Science at Princeton University. I am fortunate to be advised by Mark Braverman. Before coming here, I finished my undergraduate studies in the Department of Computer Science and Engineering at Indian Institute of Technology, Delhi.

I am interested in Theoretical Computer Science, particularly in applications of information theory in communication complexity and complexity theory. I am currently supported by a Simons Graduate Award in TCS.


Contact
Ankit Garg,
Department of Computer Science,
Princeton University,
35, Olden Street,
Princeton, NJ - 08544
 
 

 

Email

lastname AT cs dot princeton dot edu
lastname AT princeton dot edu
Publications

Small value parallel repetition for general games

- with Mark Braverman [ECCC]

Public vs private coin in bounded-round information

- with Mark Braverman
41st International Colloquium on Automata, Languages, and Programming, ICALP 2014. [ECCC]

From information to exact communication

- with Mark Braverman, Denis Pankratov and Omri Weinstein
45th ACM Symposium on the Theory of Computing, STOC 2013. [ECCC]

Information lower bounds via self-reducibility

- with Mark Braverman, Denis Pankratov and Omri Weinstein
8th International Computer Science Symposium, CSR 2013. Best paper award [ECCC]
Undergraduate Research

Constructive extensions of two results on graphic sequences

- with Arpit Goel and Amitabha Tripathi
Discrete Applied Mathematics , 2011. You can find the paper here.

CloudBridge: on integrated hardware-software consolidation

- with Aritra Sen, Akshat Verma and Tapan Nayak
29th International Symposium on Computer Performance, Modeling, Measurement and Evaluation, 2011. Find it here.