Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Some minimum merging networks

From MaRDI portal
Publication:706629
Jump to:navigation, search

DOI10.1016/J.TCS.2004.09.003zbMath1086.68040OpenAlexW2092439361MaRDI QIDQ706629

Shigeki Iwata, Gembu Morohashi

Publication date: 9 February 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.09.003


zbMATH Keywords

Lower boundComparatorMerging networkOdd-even mergeSorting network


Mathematics Subject Classification ID

Searching and sorting (68P10) Network design and communication in computer systems (68M10)





Cites Work

  • Unnamed Item
  • Lower bounds for merging networks
  • Bounds on the size of merging networks
  • Lower Bounds on Merging Networks
  • The asymptotic complexity of merging networks
  • Mathematical Foundations of Computer Science 2003




This page was built for publication: Some minimum merging networks

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:706629&oldid=12616229"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 09:57.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki