default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Nithin Varma 0001
aka: Nithin M. Varma
Max Planck Institute for Informatics, Saarbrücken, Germany - Nithin Varma 0002
MREC Hyderabad, Hyderabad, India
Likely matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 47 matches
- 2024
- Ilan Newman, Nithin Varma:
Strongly Sublinear Algorithms for Testing Pattern Freeness. TheoretiCS 3 (2024) - Rahul Kumar, Surender Kumar Soni, Shweta Singh, Nithin Varma:
New statistics on FTR fading over dynamic scenario and energy detector performance. Wirel. Networks 30(3): 1277-1284 (2024) - Danil Akhtiamov, David Bosch, Reza Ghane, K. Nithin Varma, Babak Hassibi:
A Novel Gaussian Min-Max Theorem and its Applications. CoRR abs/2402.07356 (2024) - 2023
- Nithin Varma, Yuichi Yoshida:
Average Sensitivity of Graph Algorithms. SIAM J. Comput. 52(4): 1039-1081 (2023) - K. Nithin Varma, Sahin Lale, Babak Hassibi:
The Asymptotic Distribution of the Stochastic Mirror Descent Iterates in Linear Models. ISIT 2023: 346-351 - K. Nithin Varma, Krishna P. Jagannathan:
An Erasure Queue-Channel with Feedback: Optimal Transmission Control to Maximize Capacity. ITW 2023: 24-29 - 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
- 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) - Ilan Newman, Nithin Varma:
Strongly Sublinear Algorithms for Testing Pattern Freeness. ICALP 2022: 98:1-98:20 - Iden Kalemaj, Sofya Raskhodnikova, Nithin Varma:
Sublinear-Time Computation in the Presence of Online Erasures. ITCS 2022: 90:1-90:25 - Abhiruk Lahiri, Ilan Newman, Nithin Varma:
Parameterized Convexity Testing. SOSA 2022: 174-181 - 2021
- Nithin Varma Malathkar, Surender Kumar Soni:
High compression efficiency image compression algorithm based on subsampling for capsule endoscopy. Multim. Tools Appl. 80(14): 22163-22175 (2021) - Sofya Raskhodnikova, Noga Ron-Zewi, Nithin Varma:
Erasures versus errors in local decoding and property testing. Random Struct. Algorithms 59(4): 640-670 (2021) - Ilan Newman, Nithin Varma:
New Sublinear Algorithms and Lower Bounds for LIS Estimation. ICALP 2021: 100:1-100:20 - Amit Levi, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Nithin Varma:
Erasure-Resilient Sublinear-Time Graph Algorithms. ITCS 2021: 80:1-80:20 - 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 - Nithin Varma, Yuichi Yoshida:
Average Sensitivity of Graph Algorithms. SODA 2021: 684-703 - Ilan Newman, Nithin Varma:
Strongly Sublinear Algorithms for Testing Pattern Freeness. CoRR abs/2106.04856 (2021) - Iden Kalemaj, Sofya Raskhodnikova, Nithin Varma:
Sublinear-Time Computation in the Presence of Online Erasures. CoRR abs/2109.08745 (2021) - Abhiruk Lahiri, Ilan Newman, Nithin Varma:
Parameterized Convexity Testing. CoRR abs/2110.13012 (2021) - 2020
- Nithin Varma Malathkar, Surender Kumar Soni:
Low cost image compression algorithm with colour reproduction algorithm for transmitting video frame of capsule endoscopy using low power. Biomed. Signal Process. Control. 60: 101995 (2020) - Nithin Varma Malathkar, Surender Kumar Soni:
A near lossless and low complexity image compression algorithm based on fixed threshold DPCM for capsule endoscopy. Multim. Tools Appl. 79(11-12): 8145-8160 (2020) - 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) - Ilan Newman, Nithin Varma:
New Algorithms and Lower Bounds for LIS Estimation. CoRR abs/2010.05805 (2020) - Amit Levi, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Nithin Varma:
Erasure-Resilient Sublinear-Time Graph Algorithms. CoRR abs/2011.14291 (2020) - Amit Levi, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Nithin Varma:
Erasure-Resilient Sublinear-Time Graph Algorithms. Electron. Colloquium Comput. Complex. TR20 (2020) - 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) - 2019
- Nithin Varma:
Analyzing massive datasets with missing entries: models and algorithms. Boston University, USA, 2019 - Nithin Varma Malathkar, Surender Kumar Soni:
Low complexity image compression algorithm based on hybrid DPCM for wireless capsule endoscopy. Biomed. Signal Process. Control. 48: 197-204 (2019) - Sofya Raskhodnikova, Noga Ron-Zewi, Nithin Varma:
Erasures vs. Errors in Local Decoding and Property Testing. ITCS 2019: 63:1-63:21
skipping 17 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-09-17 20:11 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint