External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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.

Authors

Peter Bro Miltersen

This author has not been identified. Look up 'Peter Bro Miltersen' in Google

Mike Paterson

This author has not been identified. Look up 'Mike Paterson' in Google

Jun Tarui

This author has not been identified. Look up 'Jun Tarui' in Google
runs on