I agree that this site is using cookies. You can find further informations here.
X
Merkliste 
 1 Ergebnisse 
 
1

Optimal Round and Sample-Size Complexity for Partitioning i..:

, In: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures,
Yang, Wentao ; Harsh, Vipul ; Solomonik, Edgar - p. 467-478 , 2023
Link: https://dl.acm.org/doi/10.1145/3558481.3591076