Abstract
We consider the problem of merging two sorted sequences on constant degree networks using comparators only. The classical solution to the problem are the networks based on Batcher's Odd-Even Merge and Bitonic Merge running in log(2n) time. Due to the obvious log n lower bound for the runtime, this is time-optimal.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
