Nithin Varma

According to our database, Nithin Varma authored at least 22 papers between 2012 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

EFX Exists for Three Types of Agents.

Vishwa Prakash HV, Pratik Ghosal, Prajakta Nimbhorkar, Nithin Varma

Proceedings of the 26th ACM Conference on Economics and Computation, 2025

Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions.

Martin G. Herold, Danupon Nanongkai, Joachim Spoerhase, Nithin Varma, Zihang Wu

Proceedings of the 41st International Symposium on Computational Geometry, 2025

(Almost Full) EFX for Three (and More) Types of Agents.

Pratik Ghosal, Vishwa Prakash HV, Prajakta Nimbhorkar, Nithin Varma

Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

2024

Strongly Sublinear Algorithms for Testing Pattern Freeness.

Ilan Newman, Nithin Varma

TheoretiCS, 2024

2023

Average Sensitivity of Graph Algorithms.

Nithin Varma, Yuichi Yoshida

SIAM J. Comput., August, 2023

Sublinear-Time Computation in the Presence of Online Erasures.

Iden Kalemaj, Sofya Raskhodnikova, Nithin Varma

Theory Comput., 2023

EFX Exists for Four Agents with Three Types of Valuations.

Pratik Ghosal, Vishwa Prakash HV, Prajakta Nimbhorkar, Nithin Varma

CoRR, 2023

2022

Parameterized Convexity Testing.

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.

Ilan Newman, Nithin Varma

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Bipartite graphs of small readability.

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).

Noga Ron-Zewi, Ronen Shaltiel, Nithin Varma

Electron. Colloquium Comput. Complex., 2020

Erasure-Resilient Sublinear-Time Graph Algorithms.

Amit Levi, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Nithin Varma

Electron. Colloquium Comput. Complex., 2020

New Algorithms and Lower Bounds for LIS Estimation.

Ilan Newman, Nithin Varma

CoRR, 2020

2019

Analyzing massive datasets with missing entries: models and algorithms

Nithin Varma

PhD thesis, 2019

Erasures vs. Errors in Local Decoding and Property Testing.

Sofya Raskhodnikova, Noga Ron-Zewi, Nithin Varma

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

2018

Erasure-Resilient Property Testing.

Kashyap Dixit, Sofya Raskhodnikova, Abhradeep Thakurta, Nithin Varma

SIAM J. Comput., 2018

Erasures versus Errors in Local Decoding and Property Testing.

Sofya Raskhodnikova, Noga Ron-Zewi, Nithin Varma

Electron. Colloquium Comput. Complex., 2018

Brief Announcement: Erasure-Resilience Versus Tolerance to Errors.

Sofya Raskhodnikova, Nithin Varma

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Parameterized Property Testing of Functions.

Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Nithin Varma

Electron. Colloquium Comput. Complex., 2017

2015

Small Stretch Pairwise Spanners and Approximate D-Preservers.

Telikepalli Kavitha, Nithin M. Varma

SIAM J. Discret. Math., 2015

2013

Small Stretch Pairwise Spanners.

Telikepalli Kavitha, Nithin M. Varma

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Rainbow connection number and connected dominating sets.

L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, Nithin M. Varma

J. Graph Theory, 2012