Back to Results
First PageMeta Content
Daniel Spielman / Smoothed analysis / Linear programming / Graph theory / Algorithm / Maximum flow problem / Combinatorics / Shortest path problem / Fulkerson Prize / Mathematics / Theoretical computer science / Applied mathematics


The Mathematical Work of Daniel Spielman Michel X. Goemans and Jonathan A. Kelner The Notices solicited the following article describing the work of Daniel Spielman, recipient of the 2010 Nevanlinna Prize. The Internatio
Add to Reading List

Document Date: 2011-08-30 14:11:30


Open Document

File Size: 466,32 KB

Share Result on Facebook

Company

LG / Laplacian Linear Systems / Artificial Intelligence Laboratory / /

/

Facility

Massachusetts Institute of Technology / /

IndustryTerm

simplex algorithm / randomized polynomial-time simplex algorithm / faster algorithms / faster algorithm / polynomial-time algorithms / industrial applications / interior-point algorithms / important mathematical tools / ellipsoid algorithm / polynomial-time algorithm / local clustering algorithm / algorithmic tools / computing / graph algorithms / linear systems / scientific computing / /

Organization

International Mathematical Union / International Congress / MIT Computer Science / Massachusetts Institute of Technology / /

Person

Michael G. Luby / Daniel Spielman / N. Srivastava / Michel X. Goemans / Michael Sipser / Andrew M. Odlyzko / Joshua Batson / Dennis A. Hejhal / Shang-Hua Teng / M. Amin Shokrollahi / Daniel A. Spielman / Aleksander Madry / George Dantzig / Hua Teng / Michael Mitzenmacher / Jonathan A. Kelner / Martin C. Gutzwiller / Joel Friedman / Paul Christiano / Daniel Spielman Michel / /

Position

advisor / Kokusai Denshin Denwa Assistant / president / Professor of Applied Mathematics / second author / /

Product

SpielmanTeng / /

ProvinceOrState

Massachusetts / /

PublishedMedium

Journal of the ACM / IEEE Transactions on Information Theory / Theory of Computing / /

Technology

graph algorithms / faster algorithm / 9 algorithms / ellipsoid algorithm / interior-point algorithms / Nearly-linear time algorithms / polynomial-time algorithms / local clustering algorithm / polynomial-time algorithm / simplex algorithm / ten algorithms / randomized polynomial-time simplex algorithm / /

URL

http /

SocialTag