Research on Algorithms

• related to scientific computation (solving linear systems, and Delaunay refinement)

• on algorithms for graph partitioning, and

• on other algorithms (graph isomorphism, identity testing)

Papers related to scientific computation

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

Available at http://arxiv.org/abs/cs.DS/0310051. 2003

With Shang-Hua Teng

Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time O (m^{1.31})

Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 416-427. 2003

With Shang-Hua Teng

Parallel Delaunay Refinement

Proceedings of the 11th International Meshing Roundtable. Submitted for publication.. 2002

With Shang-Hua Teng and Alper Ungor

Papers on graph partitioning

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

Available at http://arxiv.org/abs/cs.DS/0310051. 2003

With Shang-Hua Teng

Min-Max-Boundary Domain Decomposition

Special issue of Theoretical Computer Science for COCOON'98, volume 261, issue 2, pp. 253-266. 2001

With Marcos Kiwi and Shang-Hua Teng

Spectral Partitioning Works: Planar graphs and finite element meshes

Proceedings of the 37th Annual IEEE Conference on Foundations of Computer Science. 1996

With Shang-Hua Teng

Other Algorithms Papers

Randomness Efficient Identity Testing

Proceedings of the 33rd Symposium on Theory of Computing. 2001

With Adam R. Klivans

Faster Isomorphism Testing of Strongly Regular Graphs

28th Annual ACM Symposium on Theory of Computing, pages 576-584. 1996