( en | de | ru )

 

Disambiguation of "Zhou, Samson"

Author of the publication

copydeleteadd this publication to your clipboard
Near-Optimal k-Clustering in the Sliding Window Model.

, , and . CoRR, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Zhou Zhou

Zhou Zhou

Franz Samson

Samson Sauerbier

Gerhard Samson

 

Other publications of authors with the same name

Approximating Cumulative Pebbling Cost Is Unique Games Hard., , and . ITCS, volume 151 of LIPIcs, page 13:1-13:27. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Periodicity in Data Streams with Wildcards., , , and . Theory Comput. Syst., 64 (1): 177-197 (2020)On Locally Decodable Codes in Resource Bounded Channels., , and . CoRR, (2019)Sub-quadratic Algorithms for Kernel Matrices via Kernel Density Estimation., , , , and . CoRR, (2022)Provable Data Subset Selection For Efficient Neural Network Training., , , , , and . CoRR, (2023)On the Economics of Offline Password Cracking., , and . CoRR, (2020)Tight Bounds for Adversarially Robust Streams and Sliding Windows via Difference Estimators., and . CoRR, (2020)Memory-Efficient Performance Monitoring on Programmable Switches with Lean Algorithms., , , , and . APOCS, page 31-44. SIAM, (2020)Noisy Boolean Hidden Matching with Applications., , , , and . ITCS, volume 215 of LIPIcs, page 91:1-91:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Sensitivity Analysis of the Maximum Matching Problem., and . ITCS, volume 185 of LIPIcs, page 58:1-58:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)