Search for persons
X
?
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures ,
1
Brief Announcement: Upper and Lower Bounds for Edit Distanc..:
, In:
?
Proceedings of the 56th Annual ACM Symposium on Theory of Computing ,
2
Prize-Collecting Steiner Tree: A 1.79 Approximation:
, In:
?
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures ,
3
Massively Parallel Tree Embeddings for High Dimensional Spa..:
, In:
?
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures ,
4
Brief Announcement: Regular and Dyck Languages in MPC:
, In:
?
Proceedings of the 55th Annual ACM Symposium on Theory of Computing ,
5
Weighted Edit Distance Computation: Strings, Trees, and Dyc:
, In:
?
Proceedings of the 24th ACM Conference on Economics and Computation ,
6
Delegating to Multiple Agents:
, In:
?
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures ,
7
Location-Sensitive String Problems in MPC:
, In:
?
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing ,
8
Brief Announcement: Improved Consensus in Quantum Networks:
, In:
?
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) ,
12
Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance:
, In:
?
Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures ,
14
Adaptive Massively Parallel Algorithms for Cut Problems:
, In:
?
Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures ,
15