Följ
Samson Zhou
Samson Zhou
Texas A&M University
Verifierad e-postadress på alum.mit.edu - Startsida
Titel
Citeras av
Citeras av
År
Efficient Coreset Constructions via Sensitivity Sampling
V Braverman, D Feldman, H Lang, A Statman, S Zhou
Asian Conference on Machine Learning (ACML) 2021, 948-963, 2021
184*2021
On the Economics of Offline Password Cracking
J Blocki, B Harsha, S Zhou
IEEE Security and Privacy (Oakland S&P) 2018, 2018
1142018
Data-independent neural pruning via coresets
B Mussay, M Osadchy, V Braverman, S Zhou, D Feldman
International Conference on Learning Representations (ICLR) 2020, 2020
91*2020
Near Optimal Linear Algebra in the Online and Sliding Window Models
V Braverman, P Drineas, C Musco, C Musco, J Upadhyay, DP Woodruff, ...
Symposium on Foundations of Computer Science (FOCS) 2020, 2020
672020
Tight Bounds for Adversarially Robust Streams and Sliding Windows via Difference Estimators
DP Woodruff, S Zhou
Symposium on Foundations of Computer Science (FOCS) 2021, 2021
602021
Nearly Optimal Sparse Group Testing
V Gandikota, E Grigorescu, S Jaggi, S Zhou
Communication, Control, and Computing (Allerton), 2016 54th Annual Allerton …, 2016
472016
Adversarial Robustness of Streaming Algorithms through Importance Sampling
V Braverman, A Hassidim, Y Matias, M Schain, S Silwal, S Zhou
Advances in Neural Information Processing Systems 34, 2021
432021
Learning-Augmented -means Clustering
JC Ergun, Z Feng, S Silwal, DP Woodruff, S Zhou
10th International Conference on Learning Representations (ICLR) 2022, 2021
382021
On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i
J Blocki, S Zhou
Theory of Cryptography Conference (TCC) 2017, 445-465, 2017
362017
Adversarially Robust Submodular Maximization under Knapsack Constraints
D Avdiukhin, S Mitrović, G Yaroslavtsev, S Zhou
Conference on Knowledge Discovery and Data Mining (KDD) 2019, 2019
352019
Memory-Efficient Performance Monitoring on Programmable Switches with Lean Algorithms
Z Liu, S Zhou, O Rottenstreich, V Braverman, J Rexford
Symposium on Algorithmic Principles of Computer Systems (APoCS) 2020, 2020
332020
Nearly optimal distinct elements and heavy hitters on sliding windows
V Braverman, E Grigorescu, H Lang, DP Woodruff, S Zhou
APPROX 2018, 2018
322018
Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions
J Blocki, B Harsha, S Kang, S Lee, L Xing, S Zhou
CRYPTO 2019, 2019
292019
“Bring Your Own Greedy”+ Max: Near-Optimal 1/2-Approximations for Submodular Knapsack
G Yaroslavtsev, S Zhou, D Avdiukhin
International Conference on Artificial Intelligence and Statistics (AISTATS …, 2020
262020
Non-Adaptive Adaptive Sampling on Turnstile Streams
S Mahabadi, I Razenshteyn, DP Woodruff, S Zhou
Symposium on Theory of Computing (STOC) 2020, 2020
262020
Memory bounds for the experts problem
V Srinivas, DP Woodruff, Z Xu, S Zhou
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
252022
Bandwidth-hard functions: Reductions and lower bounds
J Blocki, L Ren, S Zhou
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications …, 2018
252018
Relaxed locally correctable codes in computationally bounded channels
J Blocki, V Gandikota, E Grigorescu, S Zhou
ISIT 2019, ICALP 2018 (Brief Announcement), 2018
252018
New coresets for projective clustering and applications
M Tukan, X Wu, S Zhou, V Braverman, D Feldman
International Conference on Artificial Intelligence and Statistics, 5391-5415, 2022
222022
The white-box adversarial data stream model
M Ajtai, V Braverman, TS Jayram, S Silwal, A Sun, DP Woodruff, S Zhou
Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2022
212022
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20