![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Satyen Kale Sanjeev Arora , Elad Hazan , Satyen Kale: Fast Algorithms for Approximate Semide.nite Programming using the Multiplicative Weights Update Method. FOCS 2005 : 339-348 Satyen Kale, Elad Hazan , Fengyun Cao , Jaswinder Pal Singh : Analysis and Algorithms for Content-Based Event Matching. ICDCS Workshops 2005 : 363-369 Sanjeev Arora , Elad Hazan , Satyen Kale: 0(sqrt (log n)) Approximation to SPARSEST CUT in Õ(n 2 ) Time. FOCS 2004 : 238-247 1 [ 1 ] [ 3 ] 2 [ 2 ] 3 [ 1 ] [ 2 ] [ 3 ] 4 [ 2 ] ![]() ©2006 Association for Computing Machinery |