default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNithin Varma 0001
Person information
- affiliation: University of Cologne, Germany
- affiliation (former): Max Planck Institute for Informatics, Saarbrücken, Germany
- affiliation (former): Chennai Mathematical Institute, Chennai, Tamil Nadu, India
- affiliation (2019 - 2021): University of Haifa, Israel
- affiliation (PhD 2019): Boston University, MA, USA
Other persons with the same name
- Nithin Varma 0002 — MREC Hyderabad, Hyderabad, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[c19]Aryan Agarwala, Nithin Varma:
Pseudodeterministic Algorithms for Minimum Cut Problems. ITCS 2026: 4:1-4:15- [c18]Harish Chandramouleeswaran, Ilan Newman, Tomer Pelleg, Nithin Varma:
Testing forbidden order-pattern properties on hypergrids. SODA 2026: 3072-3100 - 2025
- [c17]Pratik Ghosal, Vishwa Prakash HV, Prajakta Nimbhorkar, Nithin Varma:
(Almost Full) EFX for Three (and More) Types of Agents. AAAI 2025: 13889-13896 - [c16]Martin G. Herold, Danupon Nanongkai, Joachim Spoerhase, Nithin Varma, Zihang Wu:
Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions. SoCG 2025: 56:1-56:15 - [c15]Andreas Kalavas, Evangelos Kipouridis, Nithin Varma:
Towards Better-than-2 Approximation for Constrained Correlation Clustering. ICML 2025 - [c14]Vishwa Prakash HV
, Pratik Ghosal, Prajakta Nimbhorkar, Nithin Varma:
EFX Exists for Three Types of Agents. EC 2025: 101-128 - [i19]Martin G. Herold, Danupon Nanongkai, Joachim Spoerhase, Nithin Varma, Zihang Wu:
Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions. CoRR abs/2503.03079 (2025) - [i18]Harish Chandramouleeswaran, Ilan Newman, Tomer Pelleg, Nithin Varma:
Testing forbidden order-pattern properties on hypergrids. CoRR abs/2510.22845 (2025) - [i17]Aryan Agarwala, Nithin Varma:
Pseudodeterministic Algorithms for Minimum Cut Problems. CoRR abs/2512.23468 (2025) - 2024
- [j11]Ilan Newman, Nithin Varma:
Strongly Sublinear Algorithms for Testing Pattern Freeness. TheoretiCS 3 (2024) - [i16]Noga Ron-Zewi, Ronen Shaltiel, Nithin Varma:
Query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate and huge lists). CoRR abs/2409.01708 (2024) - [i15]Vishwa Prakash HV, Pratik Ghosal, Prajakta Nimbhorkar, Nithin Varma:
EFX Exists for Three Types of Agents. CoRR abs/2410.13580 (2024) - 2023
- [j10]Nithin Varma, Yuichi Yoshida:
Average Sensitivity of Graph Algorithms. SIAM J. Comput. 52(4): 1039-1081 (2023) - [j9]Iden Kalemaj, Sofya Raskhodnikova, Nithin Varma:
Sublinear-Time Computation in the Presence of Online Erasures. Theory Comput. 19: 1-48 (2023) - [i14]Pratik Ghosal, Vishwa Prakash HV, Prajakta Nimbhorkar, Nithin Varma:
EFX Exists for Four Agents with Three Types of Valuations. CoRR abs/2301.10632 (2023) - 2022
- [j8]Amit Levi, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Nithin Varma:
Erasure-Resilient Sublinear-Time Graph Algorithms. ACM Trans. Comput. Theory 14(1): 1:1-1:22 (2022) - [c13]Ilan Newman, Nithin Varma:
Strongly Sublinear Algorithms for Testing Pattern Freeness. ICALP 2022: 98:1-98:20 - [c12]Iden Kalemaj, Sofya Raskhodnikova, Nithin Varma:
Sublinear-Time Computation in the Presence of Online Erasures. ITCS 2022: 90:1-90:25 - [c11]Abhiruk Lahiri, Ilan Newman, Nithin Varma:
Parameterized Convexity Testing. SOSA 2022: 174-181 - 2021
- [j7]Sofya Raskhodnikova, Noga Ron-Zewi, Nithin Varma:
Erasures versus errors in local decoding and property testing. Random Struct. Algorithms 59(4): 640-670 (2021) - [c10]Ilan Newman, Nithin Varma:
New Sublinear Algorithms and Lower Bounds for LIS Estimation. ICALP 2021: 100:1-100:20 - [c9]Noga Ron-Zewi, Ronen Shaltiel, Nithin Varma:
Query Complexity Lower Bounds for Local List-Decoding and Hard-Core Predicates (Even for Small Rate and Huge Lists). ITCS 2021: 33:1-33:18 - [c8]Amit Levi, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Nithin Varma:
Erasure-Resilient Sublinear-Time Graph Algorithms. ITCS 2021: 80:1-80:20 - [c7]Nithin Varma, Yuichi Yoshida:
Average Sensitivity of Graph Algorithms. SODA 2021: 684-703 - [i13]Ilan Newman, Nithin Varma:
Strongly Sublinear Algorithms for Testing Pattern Freeness. CoRR abs/2106.04856 (2021) - [i12]Iden Kalemaj, Sofya Raskhodnikova, Nithin Varma:
Sublinear-Time Computation in the Presence of Online Erasures. CoRR abs/2109.08745 (2021) - [i11]Abhiruk Lahiri, Ilan Newman, Nithin Varma:
Parameterized Convexity Testing. CoRR abs/2110.13012 (2021) - 2020
- [j6]Rayan Chikhi, Vladan Jovicic, Stefan Kratsch, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova, Nithin Varma:
Bipartite graphs of small readability. Theor. Comput. Sci. 806: 402-415 (2020) - [i10]Ilan Newman, Nithin Varma:
New Algorithms and Lower Bounds for LIS Estimation. CoRR abs/2010.05805 (2020) - [i9]Amit Levi, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Nithin Varma:
Erasure-Resilient Sublinear-Time Graph Algorithms. CoRR abs/2011.14291 (2020) - [i8]Amit Levi, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Nithin Varma:
Erasure-Resilient Sublinear-Time Graph Algorithms. Electron. Colloquium Comput. Complex. TR20 (2020) - [i7]Noga Ron-Zewi, Ronen Shaltiel, Nithin Varma:
Query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate and huge lists). Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [b1]Nithin Varma:
Analyzing massive datasets with missing entries: models and algorithms. Boston University, USA, 2019 - [c6]Sofya Raskhodnikova, Noga Ron-Zewi, Nithin Varma:
Erasures vs. Errors in Local Decoding and Property Testing. ITCS 2019: 63:1-63:21 - [i6]Nithin Varma, Yuichi Yoshida:
Average Sensitivity of Graph Algorithms. CoRR abs/1904.03248 (2019) - 2018
- [j5]Kashyap Dixit, Sofya Raskhodnikova, Abhradeep Thakurta, Nithin Varma:
Erasure-Resilient Property Testing. SIAM J. Comput. 47(2): 295-329 (2018) - [j4]Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Nithin Varma:
Parameterized Property Testing of Functions. ACM Trans. Comput. Theory 9(4): 17:1-17:19 (2018) - [c5]Rayan Chikhi, Vladan Jovicic, Stefan Kratsch, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova, Nithin Varma:
Bipartite Graphs of Small Readability. COCOON 2018: 467-479 - [c4]Sofya Raskhodnikova, Nithin Varma:
Brief Announcement: Erasure-Resilience Versus Tolerance to Errors. ICALP 2018: 111:1-111:3 - [i5]Rayan Chikhi, Vladan Jovicic, Stefan Kratsch, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova, Nithin Varma:
Bipartite Graphs of Small Readability. CoRR abs/1805.04765 (2018) - [i4]Sofya Raskhodnikova, Noga Ron-Zewi, Nithin Varma:
Erasures versus Errors in Local Decoding and Property Testing. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c3]Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Nithin Varma:
Parameterized Property Testing of Functions. ITCS 2017: 12:1-12:17 - [i3]Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Nithin Varma:
Parameterized Property Testing of Functions. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c2]Kashyap Dixit, Sofya Raskhodnikova, Abhradeep Thakurta, Nithin Varma:
Erasure-Resilient Property Testing. ICALP 2016: 91:1-91:15 - [i2]Kashyap Dixit, Sofya Raskhodnikova, Abhradeep Thakurta, Nithin Varma:
Erasure-Resilient Property Testing. CoRR abs/1607.05786 (2016) - 2015
- [j3]Telikepalli Kavitha, Nithin M. Varma:
Small Stretch Pairwise Spanners and Approximate D-Preservers. SIAM J. Discret. Math. 29(4): 2239-2254 (2015) - 2013
- [c1]Telikepalli Kavitha, Nithin M. Varma:
Small Stretch Pairwise Spanners. ICALP (1) 2013: 601-612 - 2012
- [j2]L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, Nithin M. Varma:
Rainbow connection number and connected dominating sets. J. Graph Theory 71(2): 206-218 (2012) - 2011
- [j1]L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, Nithin M. Varma:
Rainbow Connection Number and Connected Dominating Sets. Electron. Notes Discret. Math. 38: 239-244 (2011) - 2010
- [i1]L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, Nithin M. Varma:
Rainbow Connection Number and Connected Dominating Sets. CoRR abs/1010.2296 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-02-20 22:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
