Nithin Varma

Orcid: 0000-0002-1211-2566

Affiliations:
  • University of Cologne, Germany
  • Max Planck Institute for Informatics, Saarbrücken, Germany (former)
  • Chennai Mathematical Institute, Chennai, Tamil Nadu, India (former)
  • University of Haifa, Israel (2019 - 2021)
  • Boston University, MA, USA (PhD 2019)


According to our database1, Nithin Varma authored at least 25 papers between 2011 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Testing forbidden order-pattern properties on hypergrids.
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

Pseudodeterministic Algorithms for Minimum Cut Problems.
Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

2025
EFX Exists for Three Types of Agents.
Proceedings of the 26th ACM Conference on Economics and Computation, 2025

Towards Better-than-2 Approximation for Constrained Correlation Clustering.
Proceedings of the Forty-second International Conference on Machine Learning, 2025

Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions.
Proceedings of the 41st International Symposium on Computational Geometry, 2025

(Almost Full) EFX for Three (and More) Types of Agents.
Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence, 2025

2023
EFX Exists for Four Agents with Three Types of Valuations.
CoRR, 2023

2022
Parameterized Convexity Testing.
Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

Sublinear-Time Computation in the Presence of Online Erasures.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Strongly Sublinear Algorithms for Testing Pattern Freeness.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
Average Sensitivity of Graph Algorithms.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Query Complexity Lower Bounds for Local List-Decoding and Hard-Core Predicates (Even for Small Rate and Huge Lists).
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Erasure-Resilient Sublinear-Time Graph Algorithms.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

New Sublinear Algorithms and Lower Bounds for LIS Estimation.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
New Algorithms and Lower Bounds for LIS Estimation.
CoRR, 2020

2019
Analyzing massive datasets with missing entries: models and algorithms
PhD thesis, 2019

Erasures vs. Errors in Local Decoding and Property Testing.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

2018
Erasures versus Errors in Local Decoding and Property Testing.
Electron. Colloquium Comput. Complex., 2018

Brief Announcement: Erasure-Resilience Versus Tolerance to Errors.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Bipartite Graphs of Small Readability.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017
Parameterized Property Testing of Functions.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016
Erasure-Resilient Property Testing.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Small Stretch Pairwise Spanners and Approximate D-Preservers.
SIAM J. Discret. Math., 2015

2013
Small Stretch Pairwise Spanners.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2011
Rainbow Connection Number and Connected Dominating Sets.
Electron. Notes Discret. Math., 2011


  Loading...