Harsha Vardhan Simhadri

Orcid: 0000-0002-9323-2227

Affiliations:
  • Microsoft Research, India
  • Lawrence Berkeley National Lab, Berkeley, CA, USA
  • Carnegie Mellon University, Pittsburgh, USA


According to our database1, Harsha Vardhan Simhadri authored at least 31 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Results of the Big ANN: NeurIPS'23 competition.
CoRR, 2024

BANG: Billion-Scale Approximate Nearest Neighbor Search using a Single GPU.
CoRR, 2024


ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms.
Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2024

2023
Scaling Graph-Based ANNS Algorithms to Billion-Size Datasets: A Comparative Analysis.
CoRR, 2023

Filtered-DiskANN: Graph Algorithms for Approximate Nearest Neighbor Search with Filters.
Proceedings of the ACM Web Conference 2023, 2023

2022
OOD-DiskANN: Efficient and Scalable Graph ANNS for Out-of-Distribution Queries.
CoRR, 2022

2021
FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search.
CoRR, 2021

Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search.
Proceedings of the NeurIPS 2021 Competitions and Demonstrations Track, 2021

2020
RNNPool: Efficient Non-linear Pooling for RAM Constrained Inference.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

DROCC: Deep Robust One-Class Classification.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
GesturePod: Enabling On-device Gesture-based Interaction for White Cane Users.
Proceedings of the 32nd Annual ACM Symposium on User Interface Software and Technology, 2019

BLAS-on-flash: An Efficient Alternative for Large Scale ML Training and Inference?
Proceedings of the 16th USENIX Symposium on Networked Systems Design and Implementation, 2019

Rand-NSG: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Shallow RNN: Accurate Time-series Classification on Resource Constrained Devices.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Word2Sense: Sparse Interpretable Word Embeddings.
Proceedings of the 57th Conference of the Association for Computational Linguistics, 2019

2018
Multiple Instance Learning for Efficient Sequential Data Classification on Resource-constrained Devices.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
ProtoNN: Compressed and Accurate kNN for Resource-scarce Devices.
Proceedings of the 34th International Conference on Machine Learning, 2017

Provably Efficient Scheduling of Dynamically Allocating Programs on Parallel Cache Hierarchies.
Proceedings of the 24th IEEE International Conference on High Performance Computing, 2017

2016
Experimental Analysis of Space-Bounded Schedulers.
ACM Trans. Parallel Comput., 2016

Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Write-Avoiding Algorithms.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

2015
Using Symmetry to Schedule Classical Matrix Multiplication.
CoRR, 2015

2013
Program-centric cost models for locality.
Proceedings of the ACM SIGPLAN Workshop on Memory Systems Performance and Correctness, 2013

2012
Brief announcement: the problem based benchmark suite.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Parallel and I/O efficient set covering algorithms.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

2011
Scheduling irregular parallel computations on hierarchical caches.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

2010
Low depth cache-oblivious algorithms.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

2009
Brief announcement: low depth cache-oblivious sorting.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

2008
Combinable memory-block transactions.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

2007
Towards Optimal and Efficient Perfectly Secure Message Transmission.
Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007


  Loading...