Author

Daniel A. Spielman

Created by ACM worker at 2019-04-10 11:09:05.0.

Simplified Graph of Associations

Word Cloud

Could you solve a captcha to retrieve Carlos Alberto Meier Basso's Lattes?

Cole aqui o código fonte do lattes da pessoa:

Sim, eu sei, isso é feio, é horrível. Mas o Lattes mudou para o recaptcha, e agora não sei mais como contornar.

Yes

Why?

Publications

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

Smoothed analysis

Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs

Faster approximate lossy generalized flow via interior point algorithms

Graph Sparsification by Effective Resistances

Spectral Graph Theory and its Applications

Published At

Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS’07)

Communications of the ACM

Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC ’04

SIAM Journal on Computing

Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC ’11

Co-Authors

Referenced By

The Paulsen problem, continuous operator scaling, and smoothed analysis

Toward a Unified Theory of Sparse Dimensionality Reduction in Euclidean Space

Uncovering the Small Community Structure in Large Networks

Inverse conjecture for the gowers norm is false

A new approach to computing maximum flows using electrical flows