Sandeep Silwal

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Optimal Algorithms for Augmented Testing of Discrete Distributions	2024	Maryam Aliakbarpour Piotr Indyk Ronitt Rubinfeld Sandeep Silwal
+ PDF Chat	Statistical-Computational Trade-offs for Density Estimation	2024	Anders Aamand Alexandr Andoni Justin Y. Chen Piotr Indyk Shyam Narayanan Sandeep Silwal Haike Xu
+ PDF Chat	Differentially Private Gomory-Hu Trees	2024	Anders Aamand Justin Y. Chen Mina Dalirrooyfard Slobodan Mitrović Yuriy Nevmyvaka Sandeep Silwal Yinzhan Xu
+ PDF Chat	A Bi-metric Framework for Fast Similarity Search	2024	Haike Xu Sandeep Silwal Piotr Indyk
+ PDF Chat	Efficiently Computing Similarities to Private Datasets	2024	Artūrs Bačkurs Zinan Lin Sepideh Mahabadi Sandeep Silwal Jakub Tarnawski
+ PDF Chat	Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time	2023	Yeshwanth Cherapanamjeri Sandeep Silwal David P. Woodruff Samson Zhou
+	Improved Space Bounds for Learning with Experts	2023	Anders Aamand Justin Y. Chen Huy L. Nguyễn Sandeep Silwal
+	Robust Algorithms on Adaptive Inputs from Bounded Adversaries	2023	Yeshwanth Cherapanamjeri Sandeep Silwal David P. Woodruff Fred Zhang Qiuyi Zhang Samson Zhou
+	Learned Interpolation for Better Streaming Quantile Approximation with Worst-Case Guarantees	2023	Nicholas Schiefer Justin Y. Chen Piotr Indyk Shyam Narayanan Sandeep Silwal Tal Wagner
+ PDF Chat	Learned Interpolation for Better Streaming Quantile Approximation with Worst-Case Guarantees	2023	Nicholas Schiefer Justin Y. Chen Piotr Indyk Shyam Narayanan Sandeep Silwal Tal Wagner
+	Data Structures for Density Estimation	2023	Anders Aamand Alexandr Andoni Justin Y. Chen Piotr Indyk Shyam Narayanan Sandeep Silwal
+	A Near-Linear Time Algorithm for the Chamfer Distance	2023	Ainesh Bakshi Piotr Indyk Rajesh Jayaram Sandeep Silwal Erik Waingarten
+	Constant Approximation for Individual Preference Stable Clustering	2023	Anders Aamand Justin Y. Chen Allen Liu Sandeep Silwal Pattara Sukprasert Ali Vakilian Fred Zhang
+	Improved Frequency Estimation Algorithms with and without Predictions	2023	Anders Aamand Justin Y. Chen Huy L. Nguyễn Sandeep Silwal Ali Vakilian
+	Motif Cut Sparsifiers	2022	Michael Kapralov Mikhail Makarov Sandeep Silwal Christian Sohler Jakab Tardos
+	The White-Box Adversarial Data Stream Model	2022	Miklós Ajtai Vladimir Braverman T.S. Jayram Sandeep Silwal Alec Sun David P. Woodruff Samson Zhou
+ PDF Chat	A concentration inequality for the facility location problem	2022	Sandeep Silwal
+	Faster Fundamental Graph Algorithms via Learned Predictions	2022	Justin Y. Chen Sandeep Silwal Ali Vakilian Fred Zhang
+	Triangle and Four Cycle Counting with Predictions in Graph Streams	2022	Justin Y. Chen Talya Eden Piotr Indyk Honghao Lin Shyam Narayanan Ronitt Rubinfeld Sandeep Silwal Tal Wagner David P. Woodruff Michael Zhang
+	Hardness and Algorithms for Robust and Sparse Optimization	2022	Eric Price Sandeep Silwal Samson Zhou
+	The White-Box Adversarial Data Stream Model	2022	Miklós Ajtai Vladimir Braverman T. S. Jayram Sandeep Silwal Alec Sun David P. Woodruff Samson Zhou
+	Motif Cut Sparsifiers	2022	Michael Kapralov М. И. Макаров Sandeep Silwal Christian Sohler Jakab Tardos
+	Learning-Augmented Algorithms for Online Linear and Semidefinite Programming	2022	Elena Grigorescu Young‐San Lin Sandeep Silwal Maoyuan Song Samson Zhou
+	Faster Linear Algebra for Distance Matrices	2022	Piotr Indyk Sandeep Silwal
+	Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks	2022	Anders Aamand Justin Y. Chen Piotr Indyk Shyam Narayanan Ronitt Rubinfeld Nicholas Schiefer Sandeep Silwal Tal Wagner
+	Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time	2022	Yeshwanth Cherapanamjeri Sandeep Silwal David P. Woodruff Samson Zhou
+	Sub-quadratic Algorithms for Kernel Matrices via Kernel Density Estimation	2022	Ainesh Bakshi Piotr Indyk Praneeth Kacham Sandeep Silwal Samson Zhou
+	Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering	2021	Shyam Narayanan Sandeep Silwal Piotr Indyk Or Zamir
+ PDF Chat	Adversarial Robustness of Streaming Algorithms through Importance Sampling	2021	Vladimir Braverman Avinatan Hasidim Yossi Matias Mariano Schain Sandeep Silwal Samson Zhou
+	Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering	2021	Shyam Narayanan Sandeep Silwal Piotr Indyk Or Zamir
+	Learning-based Support Estimation in Sublinear Time	2021	Talya Eden Piotr Indyk Shyam Narayanan Ronitt Rubinfeld Sandeep Silwal Tal Wagner
+	Adversarial Robustness of Streaming Algorithms through Importance Sampling	2021	Vladimir Braverman Avinatan Hassidim Yossi Matias Mariano Schain Sandeep Silwal Samson Zhou
+	A note on the universality of ESDs of inhomogeneous random matrices	2021	Vishesh Jain Sandeep Silwal
+	Smoothed Analysis of the Condition Number Under Low-Rank Perturbations.	2021	Rikhav Shah Sandeep Silwal
+	Dimensionality Reduction for Wasserstein Barycenter	2021	Zachary Izzo Sandeep Silwal Samson Zhou
+	Learning-Augmented $k$-means Clustering	2021	Jon Ergun Zhili Feng Sandeep Silwal David P. Woodruff Samson Zhou
+	Smoothed analysis of the condition number under low-rank perturbations.	2020	Rikhav Shah Sandeep Silwal
+	A note on the universality of ESDs of inhomogeneous random matrices	2020	Vishesh Jain Sandeep Silwal
+	A Concentration Inequality for the Facility Location Problem	2020	Sandeep Silwal
+	Smoothed analysis of the condition number under low-rank perturbations	2020	Rikhav Shah Sandeep Silwal
+	A note on the universality of ESDs of inhomogeneous random matrices	2020	Vishesh Jain Sandeep Silwal
+ PDF Chat	Directed random geometric graphs	2019	Jesse Michel Sushruth Reddy Rikhav Shah Sandeep Silwal Ramis Movassagh
+	Testing Properties of Multiple Distributions with Few Samples	2019	Maryam Aliakbarpour Sandeep Silwal
+	Property Testing of LP-Type Problems	2019	Rogers Epstein Sandeep Silwal
+	Using Dimensionality Reduction to Optimize t-SNE	2019	Rikhav Shah Sandeep Silwal
+	Infinitely Many Primes Using Generating Functions	2018	Sandeep Silwal
+	Spectral methods for testing cluster structure of graphs	2018	Sandeep Silwal Jonathan Tidor
+	Infinitely Many Primes Using Generating Functions	2018	Sandeep Silwal

Common Coauthors

Coauthor	Papers Together
Piotr Indyk	14
Samson Zhou	12
Shyam Narayanan	9
David P. Woodruff	7
Anders Aamand	7
Justin Y. Chen	6
Tal Wagner	5
Ronitt Rubinfeld	4
Rikhav Shah	4
Nicholas Schiefer	3
Fred Zhang	3
Vladimir Braverman	3
Ali Vakilian	3
Justin Y. Chen	3
Yeshwanth Cherapanamjeri	3
Yossi Matias	2
Jakab Tardos	2
Alec Sun	2
Ainesh Bakshi	2
Or Zamir	2
Justin Y. Chen	2
Huy L. Nguyên	2
Vishesh Jain	2
Miklós Ajtai	2
Mariano Schain	2
Maryam Aliakbarpour	2
Talya Eden	2
Michael Kapralov	2
Alexandr Andoni	2
Christian Sohler	2
Elena Grigorescu	1
Erik Waingarten	1
Qiuyi Zhang	1
Michael Zhang	1
Haike Xu	1
Zinan Lin	1
Allen Liu	1
М. И. Макаров	1
Honghao Lin	1
Vishesh Jain	1
Yinzhan Xu	1
Mina Dalirrooyfard	1
Maoyuan Song	1
Jesse Michel	1
Young‐San Lin	1
Slobodan Mitrović	1
Jon Ergun	1
Praneeth Kacham	1
Mikhail Makarov	1
T.S. Jayram	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	The Case for Learned Index Structures	2018	Tim Kraska Alex Beutel Ed H. Jay B. Dean Neoklis Polyzotis	3
+ PDF Chat	The Adversarial Robustness of Sampling	2020	Omri Ben‐Eliezer Eylon Yogev	2
+ PDF Chat	Improving Online Algorithms via ML Predictions	2024	Manish Purohit Zoya Svitkina Ravi Kumar	2
+	Smooth analysis of the condition number and the least singular value	2010	Terence Tao Van Vu	2
+ PDF Chat	Dimensionality Reduction for k-Means Clustering and Low Rank Approximation	2015	Michael B. Cohen Sam Elder Cameron Musco Christopher Musco Madalina Persu	2
+ PDF Chat	Eigenvalues and Condition Numbers of Random Matrices	1988	Alan Edelman	2
+ PDF Chat	A deep learning approach to structured signal recovery	2015	Ali Mousavi Ankit Patel Richard G. Baraniuk	2
+	Introduction to Core-sets: an Updated Survey	2020	Dan Feldman	2
+ PDF Chat	Spreading vectors for similarity search	2019	Alexandre Sablayrolles Matthijs Douze Cordelia Schmid Hervé Jeǵou	2
+ PDF Chat	Adversarially Robust Submodular Maximization under Knapsack Constraints	2019	Dmitrii Avdiukhin Slobodan Mitrović Grigory Yaroslavtsev Samson Zhou	2
+ PDF Chat	Graph Sparsification in the Semi-streaming Model	2009	Kook Jin Ahn Sudipto Guha	2
+	Optimal Algorithms for Testing Closeness of Discrete Distributions	2013	Siu-On Chan Ilias Diakonikolas Gregory Valiant Paul Valiant	2
+ PDF Chat	Learning to Hash for Indexing Big Data—A Survey	2015	Jun Wang Wei Liu Sanjiv Kumar Shih‐Fu Chang	2
+ PDF Chat	Adversarial laws of large numbers and optimal regret in online classification	2021	Noga Alon Omri Ben‐Eliezer Yuval Dagan Shay Moran Moni Naor Eylon Yogev	2
+ PDF Chat	On Testing Expansion in Bounded-Degree Graphs	2011	Oded Goldreich Dana Ron	2
+	Learning Combinatorial Optimization Algorithms over Graphs	2017	Hanjun Dai Elias B. Khalil Yuyu Zhang Bistra Dilkina Le Song	2
+ PDF Chat	Performance of Johnson-Lindenstrauss transform for <i>k</i> -means and <i>k</i> -medians clustering	2019	Konstantin Makarychev Yury Makarychev Ilya Razenshteyn	2
+	A Classical Introduction to Modern Number Theory	1982	Kenneth Ireland Michael Rosen	1
+	An Expansion Tester for Bounded Degree Graphs	2008	Satyen Kale C. Seshadhri	1
+	Probabilistic Symmetries and Invariance Principles	2005	Olav Kallenberg	1
+	Parameter estimation for reduced-rank multivariate linear regressions in the presence of correlated noise	2004	Karl Werner Magnus Jansson	1
+ PDF Chat	Random geometric graphs	2002	Jesper Dall Michael Christensen	1
+ PDF Chat	Sketching Cuts in Graphs and Hypergraphs	2015	Dmitry Kogan Robert Krauthgamer	1
+ PDF Chat	Testing Probability Distributions Underlying Aggregated Data	2014	Clément L. Canonne Ronitt Rubinfeld	1
+	Random minimal spanning tree and percolation on theN-cube	1998	Mathew D. Penrose	1
+	A unified framework for approximating and clustering data	2011	Dan Feldman Michael Langberg	1
+	Smoothed analysis	2009	Daniel A. Spielman Shang‐Hua Teng	1
+ PDF Chat	How robust are linear sketches to adaptive inputs?	2013	Moritz Hardt David P. Woodruff	1
+	Newman's Short Proof of the Prime Number Theorem	1997	Don Zagier	1
+ PDF Chat	The condition number of a randomly perturbed matrix	2007	Van H. Vu Terence Tao	1
+	Graph Sparsification via Refinement Sampling	2010	Ashish Goel Michael Kapralov Sanjeev Khanna	1
+	How Fast Is k-Means?	2003	Sanjoy Dasgupta	1
+	On the value of a random minimum spanning tree problem	1985	Alan Frieze	1
+ PDF Chat	Das asymptotische Verteilungsgesetz der Eigenwerte linearer partieller Differentialgleichungen (mit einer Anwendung auf die Theorie der Hohlraumstrahlung)	1912	Hermann Weyl	1
+	Probability Theory and Combinatorial Optimization	1997	John Steele	1
+	On Sharp Thresholds in Random Geometric Graphs	2013	Milan Bradonjić Will Perkins	1
+	Euclidean matching problems and the metropolis algorithm	1986	M. Weber Th. M. Liebling	1
+	Smoothed analysis of algorithms	2004	Daniel A. Spielman Shang‐Hua Teng	1
+ PDF Chat	Testing Closeness of Discrete Distributions	2013	Tuğkan Batu Lance Fortnow Ronitt Rubinfeld Warren D. Smith Patrick White	1
+	Power laws of the in-degree and out-degree distributions of complex networks	2009	Shinji Tanimoto	1
+ PDF Chat	RANDOM MATRICES: THE CIRCULAR LAW	2008	Terence Tao Van Vu	1
+ PDF Chat	Matrix Completion With Noise	2010	Emmanuel J. Candès Yaniv Plan	1
+	On Multiplicative $\lambda$-Approximations and Some Geometric Applications	2013	Ilan Newman Yuri Rabinovich	1
+	On random minimum length spanning trees	1989	Alan Frieze Colin McDiarmid	1
+	Theory of Approximation of Functions of a Real Variable	1963	A.F. TIMAN	1
+ PDF Chat	Single Pass Spectral Sparsification in Dynamic Streams	2014	Michael Kapralov Yin Tat Lee Cameron Musco Christopher Musco Aaron Sidford	1
+ PDF Chat	Clustering in complex directed networks	2007	Giorgio Fagiolo	1
+ PDF Chat	Random matrices: Universality of ESDs and the circular law	2010	Terence Tao Van Vu Manjunath Krishnapur	1
+	Proofs from THE BOOK	1998	Martin Aigner Gnter M. Ziegler	1
+	Smoothed analysis of the perceptron algorithm for linear programming	2002	Avrim Blum John Dunagan	1