Department of Computer Science
University of Haifa
My webpage has moved. If you were not automatically redirected, please click here.
I am a postdoctoral researcher working with with Dr.
Ilan Newman at the Department
of Computer Science, University of Haifa, Israel. I am broadly
interested in research in Algorithms, with a focus on sublinear algorithms
and graph algorithms.
I recently obtained by Ph.D. advised by Dr.
Sofya Raskhodnikova in the Algorithms
and Theory Group at the Department
of Computer Science, College of Arts and Sciences, Boston
University. The first three years of my PhD (2014 - 2017) were done at the
Department of Computer Science and Engineering in the Pennsylvania
State University, advised by Dr. Sofya Raskhodnikova.
Before joining the doctoral program, I completed my Master's degree (2011
- 2014) from the School of
Technology and Computer Science at Tata Institute of Fundamental
Research, India, where I worked with Dr.
Kavitha Telikepalli. I obtained by B.Tech. degree (2007 - 2011) from
the Department of Computer
Science and Engineering, National Institute of Technology, Calicut.
My most recent CV (last updated on Sep 25, 2019) can be found here.
(As per the convention in theoretical computer science, all publications
have authors listed in the alphabetical order of last names.)
- Analyzing Massive Datasets with
Missing Entries: Models and Algorithms (PhD Thesis).
Advisor: Dr. Sofya Raskhodnikova
Boston University. [Defense
Sensitivity of Graph Algorithms.
Nithin Varma, Yuichi Yoshida.
Graphs of Small Readability. [Slides]
Rayan Chikhi, Vladan Jovicic, Stefan Kratsch, Paul Medvedev, Martin
Milanic, Sofya Raskhodnikova, Nithin Varma.
Theoretical Computer Science (2019).
version appeared in the Proceedings of COCOON 2018, 467-479.
vs. Errors in Local Decoding and Property Testing.
Sofya Raskhodnikova, Noga Ron-Zewi, Nithin Varma.
ITCS 2019, 63:1-63:21.
A full version is
available on ECCC.
Announcement: Erasure-Resilience versus Tolerance to Errors.
Sofya Raskhodnikova, Nithin Varma.
ICALP 2018, 111:1-111:3.
- Separating Errors and Erasures in Property Testing using Local
Talk at (*) CS Theory Seminar, John Hopkins Univ., (*) CS Algo.
and Theory Seminar, Boston University, (*) CS Seminar, UC Santa Cruz,
(*) CS Theory Seminar, Dartmouth College, (*) ITCS 2019 (Slides)
- Brief Announcement: Erasure-Resilience versus Tolerance to
Talk at ICALP 2018. (Slides)
- Bipartite Graphs of Small Readability.
Talk at (*) COCOON 2018. (Slides)
- Erasure-Resilient Graph Property Testing.
Talk at (*) WoLA 2018.
- Erasure-Resilient Property Testing.
Talks at (*) MIT, (*) Northeastern University, (*) Univ. Michigan, Ann
Arbor, (*) IIT Madras, India, (*) IBM Research, TJ Watson, (*) Microsoft
Research, Bangalore, (*) Indian Institute of Science, Bangalore, (*)
ICALP 2016, (*) HALG 2016. (Slides)
- Fast and Fault-Resilient Sublinear Algorithms.
November 2017 @ Boston University. (Slides)
- Small Stretch Pairwise Spanners and D-spanners.
Talks at (*) CSE Theory Seminar, Penn State, (*) TIFR, Mumbai, (*) ICALP
- Email : nvarma "at" bu "dot" edu