Back to Results
First PageMeta Content
Computational learning theory / Daniel Spielman / International Colloquium on Automata /  Languages and Programming / Symposium on Foundations of Computer Science / Smoothed analysis / Symposium on Parallelism in Algorithms and Architectures / Michael Luby / ACM SIGACT / Theoretical computer science / Applied mathematics / Computer science


Daniel A. Spielman Department of Computer Science Yale University New Haven, CT[removed]Academic
Add to Reading List

Document Date: 2014-03-17 15:49:17


Open Document

File Size: 133,57 KB

Share Result on Facebook

City

Monterey / Efficient Graph / Krakow / Luebeck / Hyderabad / Warwick / Halifax / Sampling / Perturbation / Berlin / Haifa / Vancouver / Beijing / Copenhagen / Providence / /

Company

MIT Laboratory / IBM / AT&T / Laplacian Systems / Solving Linear Systems / Dominant Linear Systems / Toyota / SIAM Journal / IEEE Transactions / Israel Journal / /

Country

Germany / Poland / United States / Canada / United Kingdom / China / Israel / India / Denmark / /

/

EntertainmentAwardEvent

Science and Engineering Association Award / 1995 Association for Computing Machinery Doctoral Dissertation Award / /

Facility

University of Illinios / Massachusetts Institute of Technology Ph.D. June / Stanford University / New York University / Duke University / Brown University / Facility Location / Rutgers University / University of Toronto / University of Massachusetts / University of Michigan / Yale University / University of Wisconsin-Madison / /

IndustryTerm

multicast communications / computing / /

MusicGroup

Ph.D. / M.I. / Math / /

Organization

University of Massachusetts / Division of Computer Science N.S.F. Mathematical Sciences Postdoc Education / Prize Committee / New York University / University of Michigan / Ann Arbor / National Science Foundation / Association for Computing Machinery Doctoral Dissertation / Brown University / Rutgers University / Department of Mathematics / Program Committee / Committee for the ICM-2014 Travel Grants / Massachusetts Institute of Technology / Daniel A. Spielman Department of Computer Science Yale University New Haven / Yale University / Association for Computing Machinery / University of Illinios / Duke University / Organizing Committee for the SIAM / Member Connecticut Academy of Science and Engineering / Editorial Board / International Congress / International Linear Algebra Society / Stanford University / Yale Science and Engineering Association / University of Toronto / University of Wisconsin / /

Person

Lee / Mohammad Mahdian / Joseph D. Kanapka / Rajeev Motwani / John Lafferty / Samuel I. Daitch / Min-Max Boundary Domian / Adam Klivans / Amit Deshpande / Ming Cao / Max Boundary / Daniel A. Spielman / Hua Teng / Samuel Daitch / Jonathan A. Kelner / Sanjoy Mitter / Garry Miller / Rolf Nevanlinna / Edmund Yeh / Jonathan Kelner / Nikhil Srivastava / Gilles Lecturer / Satish Rao / Arvind Sankar / /

/

Position

Professor of Applied Mathematics July / Program Chair / Speaker / Professor of Applied Mathematics / Selected Talks Plenary Speaker / Plenary speaker / Invited speaker / Major / Associate Editor / Tutorial speaker / Professor of Computer Science / adviser / Associate Professor / /

ProvinceOrState

Wisconsin / Connecticut / Michigan / Rhode Island / California / Massachusetts / /

PublishedMedium

Journal of the ACM / the Theory of Computing / the International Journal / Machine Learning / SIAM Journal on Computing / IEEE Transactions on Information Theory / Theoretical Computer Science / Communications of the ACM / Journal of Machine Learning Research / Theory of Computing / Lecture Notes in Computer Science / /

SportsLeague

Stanford University / /

Technology

Nearly-Linear Time Algorithms / Simplex Algorithm / Machine Learning / Gossip Algorithms / 05 Massachusetts Institute of Technology / Sampling-Based Algorithms / 96 Massachusetts Institute of Technology / Approximation Algorithms / Graph-Based Algorithms / Algebraic Graph Algorithms / /

URL

http /

SocialTag