SIGN IN
SIGN UP
Smoothed analysis: an attempt to explain the behavior of algorithms in practice
Full Text:
Html
PDF
Buy this Article
see
source materials
below for
more options
Authors:
Daniel A. Spielman
Yale University, New Haven, CT
Shang-Hua Teng
Boston University and Akamai Technologies, Inc.
Published in:
· Magazine
Communications of the ACM - A View of Parallel Computing
CACM Homepage
archive
Volume 52 Issue 10, October 2009
Pages 76-84
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1562764.1562785
2009 Article
Popular
Refereed
Bibliometrics
· Downloads (6 Weeks): 14
· Downloads (12 Months): 141
· Downloads (cumulative): 1,222
· Citation Count: 12
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
combinatorics
graph theory
nonnumerical algorithms and problems
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder