BibTeX record journals/ipl/BroderDFRU95

download as .bib file

@article{DBLP:journals/ipl/BroderDFRU95,
  author       = {Andrei Z. Broder and
                  Martin E. Dyer and
                  Alan M. Frieze and
                  Prabhakar Raghavan and
                  Eli Upfal},
  title        = {The Worst-Case Running Time of the Random Simplex Algorithm is Exponential
                  in the Height},
  journal      = {Inf. Process. Lett.},
  volume       = {56},
  number       = {2},
  pages        = {79--81},
  year         = {1995},
  url          = {https://doi.org/10.1016/0020-0190(95)00101-H},
  doi          = {10.1016/0020-0190(95)00101-H},
  timestamp    = {Mon, 16 Sep 2019 14:52:24 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/BroderDFRU95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.