Author of the publication

A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents.

, , and . STOC, page 644-652. ACM, (1998)

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

Operator Scaling: Theory, Applications and Connections. (2017)Super-Logarithmic Depth Lower Bounds Via the Direct Sum in Communication Complexity., , and . Comput. Complex., 5 (3/4): 191-204 (1995)Superpolynomial Lower Bounds for Monotone Span Programs., , and . Comb., 19 (3): 301-319 (1999)Symmetric LDPC Codes and Local Testing., and . Property Testing, volume 6390 of Lecture Notes in Computer Science, Springer, (2010)Composition of the Universal Relation., and . Advances In Computational Complexity Theory, volume 13 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 119-134. DIMACS/AMS, (1990)Expander codes over reals, Euclidean sections, and compressed sensing., , and . Allerton, page 1231-1234. IEEE, (2009)An Optimal "It Ain't Over Till It's Over" Theorem., , and . STOC, page 853-866. ACM, (2023)On Read-Once Threshold Formulae and Their Randomized Decision Tree Complexity., , and . SCT, page 78-87. IEEE Computer Society, (1990)On data structures and asymmetric communication complexity., , , and . STOC, page 103-111. ACM, (1995)Self-Testing/Correcting for Polynomials and for Approximate Functions, , , , and . STOC, page 32-42. ACM, (1991)