default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikhil Sreekumar
Person information
- affiliation: University of Minnesota, Department of Computer Science, Minneapolis, MN, USA
- affiliation (former): Birla Institute of Technology and Science - Pilani, Department of Computer Science and Information Systems, India
Other persons with the same name
- S. Nikhil 0002 — SMR Automotive Systems India Limited, Bangalore, India
- S. Nikhil 0003 — Indian Institute of Technology Guwahati, Department of Computer Science and Engineering, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j1]Jagat Sesh Challa, Navneet Goyal, Amogh Sharma, Nikhil Sreekumar, Sundar Balasubramaniam, Poonam Goyal:
A Survey and Experimental Review on Data Distribution Strategies for Parallel Spatial Clustering Algorithms. J. Comput. Sci. Technol. 39(3): 610-636 (2024)
Conference and Workshop Papers
- 2022
- [c7]Lei Huang
, Zhiying Liang, Nikhil Sreekumar, Sumanth Kaushik, Abhishek Chandra, Jon B. Weissman:
Towards Elasticity in Heterogeneous Edge-dense Environments. ICDCS 2022: 403-413 - [c6]Joel Wolfrath, Nikhil Sreekumar, Dhruv Kumar, Yuanli Wang, Abhishek Chandra:
HACCS: Heterogeneity-Aware Clustered Client Selection for Accelerated Federated Learning. IPDPS 2022: 985-995 - 2021
- [c5]Yuanli Wang, Joel Wolfrath, Nikhil Sreekumar, Dhruv Kumar, Abhishek Chandra:
Accelerated Training via Device Similarity in Federated Learning. EdgeSys@EuroSys 2021: 31-36 - 2020
- [c4]Nikhil Sreekumar, Abhishek Chandra, Jon B. Weissman:
Position Paper: Towards a Robust Edge-Native Storage System. SEC 2020: 285-292 - 2016
- [c3]Nitin Varyani, S. Nikhil, Virendra Singh Shekhawat:
Latency and Routing Efficiency Based Metric for Performance Comparison of DHT Overlay Networks. AINA Workshops 2016: 337-342 - [c2]Jagat Sesh Challa, Poonam Goyal, S. Nikhil, Aditya Mangla, Sundar Balasubramaniam, Navneet Goyal:
DD-Rtree: A dynamic distributed data structure for efficient data distribution among cluster nodes for spatial data mining algorithms. IEEE BigData 2016: 27-36 - 2015
- [c1]Jagat Sesh Challa, Poonam Goyal, S. Nikhil, Sundar Balasubramaniam, Navneet Goyal:
A concurrent k-NN search algorithm for R-tree. COMPUTE 2015: 123-128
Informal and Other Publications
- 2022
- [i2]Nikhil Sreekumar, A. Chandra, Jon B. Weissman:
Evaluation of Locality, Latency and Geospace Aware Data Placement Strategies at the Edge. CoRR abs/2212.01984 (2022) - 2021
- [i1]Lei Huang, Zhiying Liang, Nikhil Sreekumar, Sumanth Kaushik Vishwanath, Cody Perakslis, Abhishek Chandra, Jon B. Weissman:
Armada: A Robust Latency-Sensitive Edge Cloud in Heterogeneous Edge-Dense Environments. CoRR abs/2111.12002 (2021)
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 2025-01-21 00:05 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:
