Result 1 to 20 from 99 total
Algorithms, graph theory, and the solution of Laplacian linear equations. (English)
Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Warwick, UK, July 9‒13, 2012. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-31584-8/pbk). Lecture Notes in Computer Science 7392, 24-26 (2012).
1
Graph sparsification by effective resistances. (English)
SIAM J. Comput. 40, No. 6, 1913-1926 (2011).
2
Algorithms, graph theory, and linear equations in Laplacian matrices. (English)
Bhatia, Rajendra (ed.) et al., Proceedings of the international congress of mathematicians (ICM 2010), Hyderabad, India, August 19‒27, 2010. Vol. IV: Invited lectures. Hackensack, NJ: World Scientific; New Delhi: Hindustan Book Agency (ISBN 978-981-4324-34-2/hbk; 978-81-85931-08-3/hbk; 978-981-4324-31-1/set; 978-981-4324-35-9/ebook). 2698-2722 (2011).
3
Spectral sparsification of graphs. (English)
SIAM J. Comput. 40, No. 4, 981-1025 (2011).
4
Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs (English)
STOC, 273-282 (2011).
5
A note on preconditioning by low-stretch spanning trees. (English)
Comput. Res. Repos. 2009, Article No. 0903.2816 (2009).
6
Smoothed analysis: an attempt to explain the behavior of algorithms in practice. (English)
Commun. ACM 52, No. 10, 76-84 (2009).
7
Technical perspective - the beauty of error-correcting codes. (English)
Commun. ACM 52, No. 3, 86 (2009).
8
Lower-stretch spanning trees. (English)
SIAM J. Comput. 38, No. 2, 608-628 (2008).
9
The minimum distance of turbo-like codes (English)
IEEE Transactions on Information Theory 55, No. 1, 6-15 (2009).
10
Fitting a graph to vector data (English)
ICML, 26 (2009).
11
Twice-Ramanujan sparsifiers (English)
STOC, 255-262 (2009).
12
A local clustering algorithm for massive graphs and its application to nearly-linear time graph partitioning. (English)
Comput. Res. Repos. 2008, Article No. 0809.3232 (2008).
13
Spectral sparsification of graphs. (English)
Comput. Res. Repos. 2008, Article No. 0808.4134 (2008).
14
Twice-ramanujan sparsifiers. (English)
Comput. Res. Repos. 2008, Article No. 0808.0163 (2008).
15
Graph sparsification by effective resistances. (English)
STOC’08. Proceedings of the 40th annual ACM symposium on theory of computing 2008, Victoria, Canada, May 17‒20, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-047-0). 563-568 (2008).
16
Faster approximate lossy generalized flow via interior point algorithms. (English)
STOC’08. Proceedings of the 40th annual ACM symposium on theory of computing 2008, Victoria, Canada, May 17‒20, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-047-0). 451-460 (2008).
17
Faster approximate lossy generalized flow via interior point algorithms. (English)
Comput. Res. Repos. 2008, Article No. 0803.0988 (2008).
18
Graph sparsification by effective resistances. (English)
Comput. Res. Repos. 2008, Article No. 0803.0929 (2008).
19
Faster approximate lossy generalized flow via interior point algorithms (English)
STOC, 451-460 (2008).
20
Result 1 to 20 from 99 total
Start
Contact
Print
General Help
