BibTeX record conf/stoc/SpielmanT01

• > Home > conf/stoc/SpielmanT01

@inproceedings{DBLP:conf/stoc/SpielmanT01,
  author       = {Daniel A. Spielman and
                  Shang{-}Hua Teng},
  editor       = {Jeffrey Scott Vitter and
                  Paul G. Spirakis and
                  Mihalis Yannakakis},
  title        = {Smoothed analysis of algorithms: why the simplex algorithm usually
                  takes polynomial time},
  booktitle    = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
                  July 6-8, 2001, Heraklion, Crete, Greece},
  pages        = {296--305},
  publisher    = {{ACM}},
  year         = {2001},
  url          = {https://doi.org/10.1145/380752.380813},
  doi          = {10.1145/380752.380813},
  timestamp    = {Wed, 14 Nov 2018 10:51:37 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/SpielmanT01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}