Follow
Nithin Varma
Nithin Varma
Researcher, Max Planck Institute for Informatics
Verified email at cmi.ac.in - Homepage
Title
Cited by
Cited by
Year
Rainbow Connection Number and Connected Dominating Sets
L Sunil Chandran, A Das, D Rajendraprasad, NM Varma
Journal of Graph Theory 71 (2), 206-218, 2012
117*2012
Small Stretch Pairwise Spanners and Approximate -Preservers
T Kavitha, NM Varma
SIAM Journal on Discrete Mathematics 29 (4), 2239-2254, 2015
40*2015
Average sensitivity of graph algorithms
N Varma, Y Yoshida
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
292021
Parameterized Property Testing of Functions
RKS Pallavoor, S Raskhodnikova, N Varma
ACM Transactions on Computation Theory (TOCT) 9 (4), 17, 2018
282018
Erasure-Resilient Property Testing
K Dixit, S Raskhodnikova, A Thakurta, N Varma
SIAM Journal on Computing 47 (2), 295-329, 2018
202018
New Sublinear Algorithms and Lower Bounds for LIS Estimation
I Newman, N Varma
arXiv preprint arXiv:2010.05805, 2020
16*2020
Erasures versus errors in local decoding and property testing
S Raskhodnikova, N Ron‐Zewi, N Varma
Random Structures & Algorithms 59 (4), 640-670, 2021
14*2021
Erasure-resilient sublinear-time graph algorithms
A Levi, RKS Pallavoor, S Raskhodnikova, N Varma
ACM Transactions on Computation Theory (TOCT) 14 (1), 1-22, 2021
62021
Sublinear-Time Computation in the Presence of Online Erasures
I Kalemaj, S Raskhodnikova, N Varma
arXiv preprint arXiv:2109.08745, 2021
32021
Brief Announcement: Erasure-Resilience Versus Tolerance to Errors
S Raskhodnikova, N Varma
45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018
32018
Query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate and huge lists)
N Ron-Zewi, R Shaltiel, N Varma
12th Innovations in Theoretical Computer Science Conference (ITCS 2021), 2021
22021
Parameterized Convexity Testing∗
A Lahiri, I Newman, N Varma
Symposium on Simplicity in Algorithms (SOSA), 174-181, 2022
12022
Analyzing Massive Datasets with Missing Entries: Models and Algorithms
N Varma
Boston University, 2019
12019
Strongly sublinear algorithms for testing pattern freeness
I Newman, N Varma
TheoretiCS 3, 2024
2024
Average Sensitivity of Graph Algorithms
N Varma, Y Yoshida
SIAM Journal on Computing 52 (4), 1039-1081, 2023
2023
Bipartite Graphs of Small Readability
R Chikhi, V Jovičić, S Kratsch, P Medvedev, M Milanič, S Raskhodnikova, ...
Theoretical Computer Science, 2019
2019
Small Stretch Pairwise Spanners and D-spanners
N Varma
Tata Institute of Fundamental Research, 2014
2014
The system can't perform the operation now. Try again later.
Articles 1–17