Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Spielman and Teng are very famous, and have received even a Godel prize for their work in smoothed analysis. Currently they're doing some very interesting things with efficient algorithms on graphs laplacians and linear systems, you can see Spielman's talk at last FOCS, it's very enlightening: http://weyond.com/www/focs/2010/downloads/1335.f4v


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: