BibTeX record conf/focs/MiltersenPT92

download as .bib file

@inproceedings{DBLP:conf/focs/MiltersenPT92,
  author       = {Peter Bro Miltersen and
                  Mike Paterson and
                  Jun Tarui},
  title        = {The Asymptotic Complexity of Merging Networks},
  booktitle    = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
                  Pennsylvania, USA, 24-27 October 1992},
  pages        = {236--246},
  publisher    = {{IEEE} Computer Society},
  year         = {1992},
  url          = {https://doi.org/10.1109/SFCS.1992.267768},
  doi          = {10.1109/SFCS.1992.267768},
  timestamp    = {Thu, 23 Mar 2023 23:57:53 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/MiltersenPT92.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.