Ngo, Hung Q.Du, Ding-Zhu2020-09-022020-09-022000-09-15https://hdl.handle.net/11299/215432Let m(n) be the minimum positive integer k so that the Shuffle-Exchange network with k stages, N = 2n inputs and N outputs is rearrangeable. Beneš conjectured that m(n)=2n-1 . The best bounds known so far are 2n-1 <= m(n) <= 3n-4 . In this paper, we verify Beneš conjecture for n=4 , and use this result to show that m(n) <= 3n-5 .en-USReport