BibTeX record conf/dimacs/Pippenger97

download as .bib file

@inproceedings{DBLP:conf/dimacs/Pippenger97,
  author       = {Nicholas Pippenger},
  editor       = {Ding{-}Zhu Du and
                  Frank K. Hwang},
  title        = {Average-case bounds for the complexity of path-search},
  booktitle    = {Advances in Switching Networks, Proceedings of a {DIMACS} Workshop,Princeton,
                  New Jersey, USA, July 7-9, 1997},
  series       = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
  volume       = {42},
  pages        = {1--13},
  publisher    = {{DIMACS/AMS}},
  year         = {1997},
  url          = {https://doi.org/10.1090/dimacs/042/01},
  doi          = {10.1090/DIMACS/042/01},
  timestamp    = {Mon, 22 May 2023 16:07:35 +0200},
  biburl       = {https://dblp.org/rec/conf/dimacs/Pippenger97.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.