Search for persons
X
?
Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures ,
2
Massively Parallel Algorithms for b-Matching:
, In:
?
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing ,
3
Deterministic (1+𝜀)-approximate maximum matching with poly(..:
, In:
?
Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures ,
4
Massively Parallel Algorithms for Distance Approximation an..:
, In:
?
Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms ,
6
Space efficient approximation to maximum matching size from..:
, In:
?
Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms ,
7
Improved local computation algorithm for set cover via spar..:
, In:
?
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing ,
8
Walking randomly, massively, and efficiently:
, In:
?
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining ,
9
Adversarially Robust Submodular Maximization under Knapsack..:
, In:
?
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing ,
11
Weighted Matchings via Unweighted Augmentations:
, In:
?
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing ,
14
Round compression for parallel matching algorithms:
, In:
?
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing ,
15