We stand with Ukraine  

Nithin Varma

Orcid: 0000-0002-1211-2566

Affiliations:
  • Max Planck Institute for Informatics, Saarbrücken, Germany
  • Chennai Mathematical Institute, Chennai, Tamil Nadu, India
  • University of Haifa, Israel (former)


According to our database1, Nithin Varma authored at least 20 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Strongly Sublinear Algorithms for Testing Pattern Freeness.
[BibTeX]
[DOI]
Ilan Newman
,
Nithin Varma
TheoretiCS, 2024

EFX Exists for Three Types of Agents.
[BibTeX]
[DOI]
Vishwa Prakash HV
,
Pratik Ghosal
,
Prajakta Nimbhorkar
,
Nithin Varma
CoRR, 2024

2023
Average Sensitivity of Graph Algorithms.
[BibTeX]
[DOI]
Nithin Varma
,
Yuichi Yoshida
SIAM J. Comput., August, 2023

Sublinear-Time Computation in the Presence of Online Erasures.
[BibTeX]
[DOI]
Iden Kalemaj
,
Sofya Raskhodnikova
,
Nithin Varma
Theory Comput., 2023

EFX Exists for Four Agents with Three Types of Valuations.
[BibTeX]
[DOI]
Pratik Ghosal
,
Vishwa Prakash HV
,
Prajakta Nimbhorkar
,
Nithin Varma
CoRR, 2023

2022
Parameterized Convexity Testing.
[BibTeX]
[DOI]
Abhiruk Lahiri
,
Ilan Newman
,
Nithin Varma
Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

2021
New Sublinear Algorithms and Lower Bounds for LIS Estimation.
[BibTeX]
[DOI]
Ilan Newman
,
Nithin Varma
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Bipartite graphs of small readability.
[BibTeX]
[DOI]
Rayan Chikhi
,
Vladan Jovicic
,
Stefan Kratsch
,
Paul Medvedev
,
Martin Milanic
,
Sofya Raskhodnikova
,
Nithin Varma
Theor. Comput. Sci., 2020

Query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate and huge lists).
[BibTeX]
[DOI]
Noga Ron-Zewi
,
Ronen Shaltiel
,
Nithin Varma
Electron. Colloquium Comput. Complex., 2020

Erasure-Resilient Sublinear-Time Graph Algorithms.
[BibTeX]
[DOI]
Amit Levi
,
Ramesh Krishnan S. Pallavoor
,
Sofya Raskhodnikova
,
Nithin Varma
Electron. Colloquium Comput. Complex., 2020

New Algorithms and Lower Bounds for LIS Estimation.
[BibTeX]
[DOI]
Ilan Newman
,
Nithin Varma
CoRR, 2020

2019
Analyzing massive datasets with missing entries: models and algorithms
[BibTeX]
[DOI]
Nithin Varma
PhD thesis, 2019

Erasures vs. Errors in Local Decoding and Property Testing.
[BibTeX]
[DOI]
Sofya Raskhodnikova
,
Noga Ron-Zewi
,
Nithin Varma
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

2018
Erasure-Resilient Property Testing.
[BibTeX]
[DOI]
Kashyap Dixit
,
Sofya Raskhodnikova
,
Abhradeep Thakurta
,
Nithin Varma
SIAM J. Comput., 2018

Erasures versus Errors in Local Decoding and Property Testing.
[BibTeX]
[DOI]
Sofya Raskhodnikova
,
Noga Ron-Zewi
,
Nithin Varma
Electron. Colloquium Comput. Complex., 2018

Brief Announcement: Erasure-Resilience Versus Tolerance to Errors.
[BibTeX]
[DOI]
Sofya Raskhodnikova
,
Nithin Varma
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Parameterized Property Testing of Functions.
[BibTeX]
[DOI]
Ramesh Krishnan S. Pallavoor
,
Sofya Raskhodnikova
,
Nithin Varma
Electron. Colloquium Comput. Complex., 2017

2015
Small Stretch Pairwise Spanners and Approximate D-Preservers.
[BibTeX]
[DOI]
Telikepalli Kavitha
,
Nithin M. Varma
SIAM J. Discret. Math., 2015

2013
Small Stretch Pairwise Spanners.
[BibTeX]
[DOI]
Telikepalli Kavitha
,
Nithin M. Varma
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
Rainbow connection number and connected dominating sets.
[BibTeX]
[DOI]
L. Sunil Chandran
,
Anita Das
,
Deepak Rajendraprasad
,
Nithin M. Varma
J. Graph Theory, 2012


  Loading...