Samson Zhou
Samson Zhou
Carnegie Mellon University
Verified email at - Homepage
Cited by
Cited by
On the Economics of Offline Password Cracking
J Blocki, B Harsha, S Zhou
IEEE Security and Privacy 2018, 2018
Nearly Optimal Sparse Group Testing
V Gandikota, E Grigorescu, S Jaggi, S Zhou
Communication, Control, and Computing (Allerton), 2016 54th Annual Allerton†…, 2016
On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i
J Blocki, S Zhou
Theory of Cryptography Conference (TCC) 2017, 445-465, 2017
Data-independent neural pruning via coresets
B Mussay, M Osadchy, V Braverman, S Zhou, D Feldman
International Conference on Learning Representations (ICLR) 2020, 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
Nearly optimal distinct elements and heavy hitters on sliding windows
V Braverman, E Grigorescu, H Lang, DP Woodruff, S Zhou
APPROX 2018, 2018
Bandwidth-hard functions: Reductions and lower bounds
J Blocki, L Ren, S Zhou
Conference on Computer and Communications Security (CCS) 2018, 1820-1836, 2018
Tight Bounds for Adversarially Robust Streams and Sliding Windows via Difference Estimators
DP Woodruff, S Zhou
arXiv preprint arXiv:2011.07471, 2020
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
Structural results on matching estimation with applications to streaming
M Bury, E Grigorescu, A McGregor, M Monemizadeh, C Schwiegelshohn, ...
Algorithmica 81 (1), 367-392, 2019
Relaxed locally correctable codes in computationally bounded channels
J Blocki, V Gandikota, E Grigorescu, S Zhou
ISIT 2019, ICALP 2018 (Brief Announcement), 2018
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
Streaming Periodicity with Mismatches
F ErgŁn, E Grigorescu, ES Azer, S Zhou
RANDOM 2017, 2017
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
On the computational complexity of minimal cumulative cost graph pebbling
J Blocki, S Zhou
Financial Cryptography and Data Security (FC) 2018, 2016
Non-Adaptive Adaptive Sampling on Turnstile Streams
S Mahabadi, I Razenshteyn, DP Woodruff, S Zhou
Symposium on Theory of Computing (STOC) 2020, 2020
Streaming for Aibohphobes: Longest Palindrome with Mismatches
E Grigorescu, ES Azer, S Zhou
FSTTCS 2017, 2017
Estimating Weighted Matchings in Space
E Grigorescu, M Monemizadeh, S Zhou
arXiv preprint arXiv:1604.07467, 2016
Adversarial robustness of streaming algorithms through importance sampling
V Braverman, A Hassidim, Y Matias, M Schain, S Silwal, S Zhou
arXiv preprint arXiv:2106.14952, 2021
Periodicity in data streams with wildcards
F ErgŁn, E Grigorescu, ES Azer, S Zhou
Theory of Computing Systems 64 (1), 177-197, 2020
The system can't perform the operation now. Try again later.
Articles 1–20