The Asymptotic Complexity of Merging Networks

Peter Bro Miltersen, Mike Paterson, Jun Tarui. The Asymptotic Complexity of Merging Networks. In 33rd Annual Symposium on Foundations of Computer Science, 24-27 October 1992, Pittsburgh, Pennsylvania, USA. pages 236-246, IEEE, 1992.

@inproceedings{MiltersenPT92,
  title = {The Asymptotic Complexity of Merging Networks},
  author = {Peter Bro Miltersen and Mike Paterson and Jun Tarui},
  year = {1992},
  researchr = {https://researchr.org/publication/MiltersenPT92},
  cites = {0},
  citedby = {0},
  pages = {236-246},
  booktitle = {33rd Annual Symposium on Foundations of Computer Science, 24-27 October 1992, Pittsburgh, Pennsylvania, USA},
  publisher = {IEEE},
}