Author of the publication

On the Complexity of Approximating k-Dimensional Matching.

, , and . RANDOM-APPROX, volume 2764 of Lecture Notes in Computer Science, page 83-97. Springer, (2003)

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.

 

Other publications of authors with the same name

Colorful Strips., , , , , , , , and . LATIN, volume 6034 of Lecture Notes in Computer Science, page 2-13. Springer, (2010)Revisiting the I/O-Complexity of Fast Matrix Multiplication with Recomputations., and . IPDPS, page 482-490. IEEE, (2019)Communication-Optimal Parallel Recursive Rectangular Matrix Multiplication., , , , , , and . IPDPS, page 261-272. IEEE Computer Society, (2013)Network Partitioning and Avoidable Contention., and . SPAA, page 563-565. ACM, (2020)On the Complexity of Approximating TSP with Neighborhoods and Related Problems., and . ESA, volume 2832 of Lecture Notes in Computer Science, page 446-458. Springer, (2003)On the Complexity of Approximating k-Dimensional Matching., , and . RANDOM-APPROX, volume 2764 of Lecture Notes in Computer Science, page 83-97. Springer, (2003)Stragglers in Distributed Matrix Multiplication., and . JSSPP, volume 14283 of Lecture Notes in Computer Science, page 74-96. Springer, (2023)Expansion and approximability. Tel Aviv University, Israel, (2007)Tel Aviv University Library.Fault-Tolerant Parallel Integer Multiplication., , and . SPAA, page 207-218. ACM, (2024)Matrix Multiplication, a Little Faster., and . SPAA, page 101-110. ACM, (2017)