Author of the publication

Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems.

, and . STOC, page 81-90. ACM, (2004)

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

Parallel Delaunay Refinement: Algorithms And Analyses., , and . IMR, page 205-217. (2002)Sublinear Time Algorithm for PageRank Computations and Related Applications, , , and . CoRR, (2012)Dynamic Parallel Complexity of Computational Circuits, and . STOC, page 254-263. ACM, (1987)A Delaunay based numerical method for three dimensions: generation, formulation, and partition., , , and . STOC, page 683-692. ACM, (1995)Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems., and . STOC, page 81-90. ACM, (2004)Parallel Profile Matching for Large Scale Webcasting., , and . IRREGULAR, volume 1457 of Lecture Notes in Computer Science, page 17-28. Springer, (1998)Game and Market Equilibria: Computation, Approximation, and Smoothed Analysis.. AAIM, volume 4508 of Lecture Notes in Computer Science, page 424. Springer, (2007)Generating Local Address and Communication Sets for Data-Parallel Programs., , , , and . J. Parallel Distributed Comput., 26 (1): 72-84 (1995)Functional Inversion and Communication Complexity.. CRYPTO, volume 576 of Lecture Notes in Computer Science, page 232-241. Springer, (1991)Approximating center points with iterative Radon points., , , , and . Int. J. Comput. Geom. Appl., 6 (3): 357-377 (1996)