default search action
Harsha Vardhan Simhadri
Person information
- affiliation: Microsoft Research, India
- affiliation: Lawrence Berkeley National Lab, Berkeley, CA, USA
- affiliation: Carnegie Mellon University, Pittsburgh, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c25]Magdalen Dobson Manohar
, Zheqi Shen
ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms. PPoPP 2024: 270-285 - [c24]Qi Chen
MS MARCO Web Search: A Large-scale Information-rich Web Dataset with Millions of Real Click Labels. WWW (Companion Volume) 2024: 292-301 - [i11]Karthik V., Saim Khan, Somesh Singh
BANG: Billion-Scale Approximate Nearest Neighbor Search using a Single GPU. CoRR abs/2401.11324 (2024) - [i10]Qi Chen, Xiubo Geng, Corby Rosset, Carolyn Buractaon, Jingwen Lu, Tao Shen, Kun Zhou, Chenyan Xiong, Yeyun Gong, Paul N. Bennett, Nick Craswell, Xing Xie, Fan Yang, Bryan Tower, Nikhil Rao, Anlei Dong, Wenqi Jiang, Zheng Liu, Mingqin Li, Chuanjie Liu, Zengzhong Li, Rangan Majumder, Jennifer Neville, Andy Oakley, Knut Magne Risvik, Harsha Vardhan Simhadri, Manik Varma, Yujing Wang, Linjun Yang, Mao Yang, Ce Zhang:
MS MARCO Web Search: a Large-scale Information-rich Web Dataset with Millions of Real Click Labels. CoRR abs/2405.07526 (2024) - [i9]Harsha Vardhan Simhadri, Martin Aumüller, Amir Ingber, Matthijs Douze, George Williams, Magdalen Dobson Manohar, Dmitry Baranchuk, Edo Liberty, Frank Liu, Benjamin Landrum, Mazin Karjikar, Laxman Dhulipala, Meng Chen, Yue Chen, Rui Ma, Kai Zhang, Yuzheng Cai, Jiayang Shi, Yizhuo Chen, Weiguo Zheng, Zihao Wan, Jie Yin, Ben Huang:
Results of the Big ANN: NeurIPS'23 competition. CoRR abs/2409.17424 (2024) - 2023
- [c23]Siddharth Gollapudi
Filtered-DiskANN: Graph Algorithms for Approximate Nearest Neighbor Search with Filters. WWW 2023: 3406-3416 - [i8]Magdalen Dobson, Zheqi Shen, Guy E. Blelloch, Laxman Dhulipala, Yan Gu, Harsha Vardhan Simhadri, Yihan Sun:
Scaling Graph-Based ANNS Algorithms to Billion-Size Datasets: A Comparative Analysis. CoRR abs/2305.04359 (2023) - 2022
- [i7]Harsha Vardhan Simhadri, George Williams, Martin Aumüller, Matthijs Douze, Artem Babenko, Dmitry Baranchuk, Qi Chen, Lucas Hosseini, Ravishankar Krishnaswamy, Gopal Srinivasa, Suhas Jayaram Subramanya, Jingdong Wang:
Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search. CoRR abs/2205.03763 (2022) - [i6]Shikhar Jaiswal, Ravishankar Krishnaswamy, Ankit Garg, Harsha Vardhan Simhadri, Sheshansh Agrawal:
OOD-DiskANN: Efficient and Scalable Graph ANNS for Out-of-Distribution Queries. CoRR abs/2211.12850 (2022) - 2021
- [c22]Harsha Vardhan Simhadri, George Williams, Martin Aumüller, Matthijs Douze, Artem Babenko, Dmitry Baranchuk, Qi Chen, Lucas Hosseini, Ravishankar Krishnaswamy, Gopal Srinivasa, Suhas Jayaram Subramanya, Jingdong Wang:
Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search. NeurIPS (Competition and Demos) 2021: 177-189 - [i5]Aditi Singh, Suhas Jayaram Subramanya, Ravishankar Krishnaswamy, Harsha Vardhan Simhadri:
FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search. CoRR abs/2105.09613 (2021) - 2020
- [c21]Sachin Goyal, Aditi Raghunathan, Moksh Jain, Harsha Vardhan Simhadri, Prateek Jain:
DROCC: Deep Robust One-Class Classification. ICML 2020: 3711-3721 - [c20]Oindrila Saha, Aditya Kusupati, Harsha Vardhan Simhadri, Manik Varma, Prateek Jain:
RNNPool: Efficient Non-linear Pooling for RAM Constrained Inference. NeurIPS 2020 - [i4]Oindrila Saha, Aditya Kusupati, Harsha Vardhan Simhadri, Manik Varma, Prateek Jain:
RNNPool: Efficient Non-linear Pooling for RAM Constrained Inference. CoRR abs/2002.11921 (2020) - [i3]Sachin Goyal, Aditi Raghunathan, Moksh Jain, Harsha Vardhan Simhadri, Prateek Jain:
DROCC: Deep Robust One-Class Classification. CoRR abs/2002.12718 (2020)
2010 – 2019
- 2019
- [c19]Abhishek Panigrahi, Harsha Vardhan Simhadri, Chiranjib Bhattacharyya:
Word2Sense: Sparse Interpretable Word Embeddings. ACL (1) 2019: 5692-5705 - [c18]Don Kurian Dennis, Durmus Alp Emre Acar, Vikram Mandikal, Vinu Sankar Sadasivan, Venkatesh Saligrama, Harsha Vardhan Simhadri, Prateek Jain:
Shallow RNN: Accurate Time-series Classification on Resource Constrained Devices. NeurIPS 2019: 12896-12906 - [c17]Suhas Jayaram Subramanya, Devvrit, Harsha Vardhan Simhadri, Ravishankar Krishnaswamy, Rohan Kadekodi:
Rand-NSG: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node. NeurIPS 2019: 13748-13758 - [c16]Suhas Jayaram Subramanya, Harsha Vardhan Simhadri, Srajan Garg, Anil Kag, Venkatesh Balasubramanian:
BLAS-on-flash: An Efficient Alternative for Large Scale ML Training and Inference? NSDI 2019: 469-484 - [c15]Shishir G. Patil, Don Kurian Dennis, Chirag Pabbaraju, Nadeem Shaheer, Harsha Vardhan Simhadri, Vivek Seshadri, Manik Varma, Prateek Jain:
GesturePod: Enabling On-device Gesture-based Interaction for White Cane Users. UIST 2019: 403-415 - 2018
- [c14]Don Kurian Dennis, Chirag Pabbaraju, Harsha Vardhan Simhadri, Prateek Jain:
Multiple Instance Learning for Efficient Sequential Data Classification on Resource-constrained Devices. NeurIPS 2018: 10976-10987 - 2017
- [c13]Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri:
Provably Efficient Scheduling of Dynamically Allocating Programs on Parallel Cache Hierarchies. HiPC 2017: 124-133 - [c12]Chirag Gupta, Arun Sai Suggala, Ankit Goyal, Harsha Vardhan Simhadri, Bhargavi Paranjape, Ashish Kumar, Saurabh Goyal, Raghavendra Udupa, Manik Varma, Prateek Jain:
ProtoNN: Compressed and Accurate kNN for Resource-scarce Devices. ICML 2017: 1331-1340 - 2016
- [j1]Harsha Vardhan Simhadri, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Aapo Kyrola:
Experimental Analysis of Space-Bounded Schedulers. ACM Trans. Parallel Comput. 3(1): 8:1-8:27 (2016) - [c11]Erin C. Carson
Write-Avoiding Algorithms. IPDPS 2016: 648-658 - [c10]David Dinh, Harsha Vardhan Simhadri, Yuan Tang:
Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers. SPAA 2016: 49-60 - [i2]David Dinh, Harsha Vardhan Simhadri, Yuan Tang:
Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers. CoRR abs/1602.04552 (2016) - 2015
- [i1]Harsha Vardhan Simhadri:
Using Symmetry to Schedule Classical Matrix Multiplication. CoRR abs/1512.02737 (2015) - 2014
- [c9]Harsha Vardhan Simhadri, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Aapo Kyrola:
Experimental analysis of space-bounded schedulers. SPAA 2014: 30-41 - 2013
- [c8]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Harsha Vardhan Simhadri:
Program-centric cost models for locality. MSPC@PLDI 2013: 6:1-6:2 - 2012
- [c7]Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Aapo Kyrola, Harsha Vardhan Simhadri, Kanat Tangwongsan:
Brief announcement: the problem based benchmark suite. SPAA 2012: 68-70 - [c6]Guy E. Blelloch, Harsha Vardhan Simhadri, Kanat Tangwongsan:
Parallel and I/O efficient set covering algorithms. SPAA 2012: 82-90 - 2011
- [c5]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Harsha Vardhan Simhadri:
Scheduling irregular parallel computations on hierarchical caches. SPAA 2011: 355-366 - 2010
- [c4]Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri:
Low depth cache-oblivious algorithms. SPAA 2010: 189-199
2000 – 2009
- 2009
- [c3]Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri:
Brief announcement: low depth cache-oblivious sorting. SPAA 2009: 121-123 - 2008
- [c2]Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri:
Combinable memory-block transactions. SPAA 2008: 23-34 - 2007
- [c1]Matthias Fitzi, Matthew K. Franklin, Juan A. Garay, Harsha Vardhan Simhadri:
Towards Optimal and Efficient Perfectly Secure Message Transmission. TCC 2007: 311-322
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 2024-10-23 21:21 CEST 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: