引用次数
引用: 1,206
H-指数: 20
I10-指数 : 34
出版物: 66
On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling
Jeremiah Blocki , Samson Zhou
arXiv: Cryptography and Security
3
2016
Optimal Parametric Search for Path and Tree Partitioning.
Greg N. Frederickson , Samson Zhou
arXiv: Data Structures and Algorithms
6
2017
Adversarially Robust Submodular Maximization under Knapsack Constraints
Grigory Yaroslavtsev , Samson Zhou , Dmitrii Avdiukhin , Slobodan Mitrović
arXiv: Data Structures and Algorithms
15
2019
Data-Independent Neural Pruning via Coresets
Vladimir Braverman , Margarita Osadchy , Dan Feldman , Samson Zhou
international conference on learning representations
5
2020
Memory-Efficient Performance Monitoring on Programmable Switches with Lean Algorithms.
Vladimir Braverman , Ori Rottenstreich , Jennifer Rexford , Zaoxing Liu
APOCS 31 -44
20
2019
Structural Results on Matching Estimation with Applications to Streaming
Marc Bury , Elena Grigorescu , Andrew McGregor , Morteza Monemizadeh
Algorithmica 81 ( 1) 367 -392
7
2019
Bandwidth-Hard Functions: Reductions and Lower Bounds
Jeremiah Blocki , Ling Ren , Samson Zhou
computer and communications security 1820 -1836
7
2018
On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i
Jeremiah Blocki , Samson Zhou
theory of cryptography conference 445 -465
14
2017
Non-adaptive adaptive sampling on turnstile streams
Sepideh Mahabadi , Ilya Razenshteyn , David P. Woodruff , Samson Zhou
symposium on the theory of computing 1251 -1264
3
2020
Longest alignment with edits in data streams
Elena Grigorescu , Erfan Sadeqi Azer , Samson Zhou
allerton conference on communication, control, and computing 405 -412
2017
Nearly optimal sparse group testing
Venkata Gandikota , Elena Grigorescu , Sidharth Jaggi , Samson Zhou
allerton conference on communication, control, and computing 401 -408
12
2016
Adversarial robustness of streaming algorithms through importance sampling
Vladimir Braverman , Avinatan Hassidim , Yossi Matias , Mariano Schain
Advances in Neural Information Processing Systems 34 3544 -3557
18
2021
Optimal algorithms for linear algebra in the current matrix multiplication time
Yeshwanth Cherapanamjeri , Sandeep Silwal , David P Woodruff , Samson Zhou
Smpte Journal 4026 -4049
1
2023
Learning-augmented algorithms for online linear and semidefinite programming
Elena Grigorescu , Young-San Lin , Sandeep Silwal , Maoyuan Song
Advances in Neural Information Processing Systems 35 38643 -38654
2022
Dimensionality reduction for wasserstein barycenter
Zachary Izzo , Sandeep Silwal , Samson Zhou
Advances in neural information processing systems 34 15582 -15594
10
2021
Hardness and algorithms for robust and sparse optimization
Eric Price , Sandeep Silwal , Samson Zhou
Smpte Journal 17926 -17944
2
2022
Provable data subset selection for efficient neural networks training
Murad Tukan , Samson Zhou , Alaa Maalouf , Daniela Rus
International Conference on Machine Learning 34533 -34555
5
2023
Sub-quadratic algorithms for kernel matrices via kernel density estimation
Ainesh Bakshi , Piotr Indyk , Praneeth Kacham , Sandeep Silwal
International Conference on Learning Representations
5
2023
Learning a latent simplex in input-sparsity time
Ainesh Bakshi , Chiranjib Bhattacharyya , Ravi Kannan , David P Woodruff
arXiv preprint arXiv:2105.08005
10
2021
Differentially Private Aggregation via Imperfect Shuffling
Badih Ghazi , Ravi Kumar , Pasin Manurangsi , Jelani Nelson
arXiv preprint arXiv:2308.14733
2023
David Woodruff Vladimir Braverman Jeremiah Blocki Elena Grigorescu Dan Feldman Sandeep Silwal Grigory Yaroslavtsev Petros Drineas Adiel Statman Dmitrii Avdiukhin Cameron Musco Christopher Musco Venkata Gandikota Erfan Sadeqi Azer Margarita Osadchy Seunghoon Lee Jalaj Upadhyay Sepideh Mahabadi Morad Tukan