| One sketch to rule them all: Rethinking network flow monitoring with univmon Z Liu, A Manousis, G Vorsanger, V Sekar, V Braverman Proceedings of the 2016 ACM SIGCOMM Conference, 101-114, 2016 | 623 | 2016 |
| Fetchsgd: Communication-efficient federated learning with sketching D Rothchild, A Panda, E Ullah, N Ivkin, I Stoica, V Braverman, J Gonzalez, ... International Conference on Machine Learning, 8253-8265, 2020 | 401 | 2020 |
| Communication-efficient distributed SGD with sketching N Ivkin, D Rothchild, E Ullah, I Stoica, R Arora Advances in Neural Information Processing Systems 32, 2019 | 219 | 2019 |
| Nitrosketch: Robust and general sketch-based monitoring in software switches Z Liu, R Ben-Basat, G Einziger, Y Kassner, V Braverman, R Friedman, ... Proceedings of the ACM Special Interest Group on Data Communication, 334-350, 2019 | 214 | 2019 |
| Methods for effective processing of time series G Shaked, V Braverman, V Belyaev, G Rubin, M Sadetsky US Patent 9,047,349, 2015 | 209 | 2015 |
| {DistCache}: Provable load balancing for {Large-Scale} storage systems with distributed caching Z Liu, Z Bai, Z Liu, X Li, C Kim, V Braverman, X Jin, I Stoica 17th USENIX Conference on File and Storage Technologies (FAST 19), 143-157, 2019 | 174 | 2019 |
| New frameworks for offline and streaming coreset constructions V Braverman, D Feldman, H Lang, A Statman, S Zhou arXiv preprint arXiv:1612.00889, 2016 | 172 | 2016 |
| Optimal sampling from sliding windows V Braverman, R Ostrovsky, C Zaniolo Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on …, 2009 | 163 | 2009 |
| Jaqen: A {High-Performance}{Switch-Native} approach for detecting and mitigating volumetric {DDoS} attacks with programmable switches Z Liu, H Namkung, G Nikolaidis, J Lee, C Kim, X Jin, V Braverman, M Yu, ... 30th USENIX Security Symposium (USENIX Security 21), 3829-3846, 2021 | 153 | 2021 |
| On the noisy gradient descent that generalizes as sgd J Wu, W Hu, H Xiong, J Huan, V Braverman, Z Zhu International Conference on Machine Learning, 10367-10376, 2020 | 109 | 2020 |
| Streaming k-means on Well-Clusterable Data V Braverman, A Meyerson, R Ostrovsky, A Roytman, M Shindler, B Tagiku Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011 | 105 | 2011 |
| Smooth histograms for sliding windows V Braverman, R Ostrovsky 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 283-293, 2007 | 100 | 2007 |
| {ASAP}: Fast, approximate graph pattern mining at scale AP Iyer, Z Liu, X Jin, S Venkataraman, V Braverman, I Stoica 13th USENIX Symposium on Operating Systems Design and Implementation (OSDI …, 2018 | 95 | 2018 |
| Zero-one frequency laws V Braverman, R Ostrovsky Proceedings of the forty-second ACM symposium on Theory of computing, 281-290, 2010 | 89 | 2010 |
| Programmable packet scheduling with a single queue Z Yu, C Hu, J Wu, X Sun, V Braverman, M Chowdhury, Z Liu, X Jin Proceedings of the 2021 ACM SIGCOMM 2021 Conference, 179-193, 2021 | 85 | 2021 |
| Netlock: Fast, centralized lock management using programmable switches Z Yu, Y Zhang, V Braverman, M Chowdhury, X Jin Proceedings of the Annual conference of the ACM Special Interest Group on …, 2020 | 82 | 2020 |
| BPTree: An ℓ2 Heavy Hitters Algorithm Using Constant Memory V Braverman, SR Chestnut, N Ivkin, J Nelson, Z Wang, DP Woodruff Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2017 | 74 | 2017 |
| How hard is counting triangles in the streaming model? V Braverman, R Ostrovsky, D Vilenchik Automata, Languages, and Programming: 40th International Colloquium, ICALP …, 2013 | 69 | 2013 |
| Data-independent neural pruning via coresets B Mussay, M Osadchy, V Braverman, S Zhou, D Feldman arXiv preprint arXiv:1907.04018, 2019 | 66 | 2019 |
| Benign overfitting of constant-stepsize sgd for linear regression D Zou, J Wu, V Braverman, Q Gu, S Kakade Conference on Learning Theory, 4633-4635, 2021 | 65 | 2021 |
Zaoxing LiuAssistant Professor of Computer Science, University of Maryland在 cs.umd.edu 的电子邮件经过验证
