cp's OEIS Frontend

A067782 Minimal delay time for an n-element sorting network.

%I A067782 #25 Nov 20 2020 21:45:58
%S A067782 0,1,3,3,5,5,6,6,7,7,8,8,9,9,9,9,10
%N A067782 Minimal delay time for an n-element sorting network.
%C A067782 Or, minimal depth of a sorting network on n channels.
%D A067782 S. W. A.-H. Baddar, K. E. Batcher, Designing Sorting Networks: A New Paradigm, Springer (2011)
%D A067782 D. Bundala, J. Závodný, Optimal sorting networks, LATA 2014, LNCS, vol. 8370, Springer (2014), pp. 236-247
%D A067782 Thorsten Ehlers, Merging almost sorted sequences yields a 24-sorter, Information Processing Letters, Volume 118, February 2017, Pages 17-20
%D A067782 D. E. Knuth, Art of Computer Programming, Vol. 3, Sect. 5.3.4.
%H A067782 D. Bundala, M. Codish, L. Cruz-Filipe et al., <a href="http://arxiv.org/abs/1412.5302">Optimal-Depth Sorting Networks</a>, arXiv preprint arXiv:1412.5302 [cs.DS], 2014. (Determines a(11)-a(16).)
%H A067782 T. Ehlers, M. Müller, <a href="http://arxiv.org/abs/1410.2736">Faster sorting networks for 17, 19 and 20 inputs</a>, arXiv:1410.2736 [cs.DS], 2014.
%H A067782 Mariana Nagy, Vlad-Florin Drăgoi, Valeriu Beiu, <a href="https://doi.org/10.1109/NANO47656.2020.9183395">Employing Sorting Nets for Designing Reliable Computing Nets</a>, IEEE 20th International Conference on Nanotechnology (IEEE-NANO 2020) 370-375.
%H A067782 I. Parberry, <a href="https://larc.unt.edu/ian/pubs/9-input.pdf">A Computer Assisted Optimal Depth Lower Bound for Nine-Input Sorting Networks</a>, Mathematical Systems Theory, Vol. 24, pp. 101-116, 1991. (Determines a(9) and a(10).)
%H A067782 <a href="/index/So#sorting">Index entries for sequences related to sorting</a>
%Y A067782 Cf. A003075.
%K A067782 hard,nonn,nice,more
%O A067782 1,3
%A A067782 Ron Zeno (rzeno(AT)hotmail.com), Feb 06 2002
%E A067782 a(17) = 10 is mentioned in Ehlers (2017). - _N. J. A. Sloane_, Aug 21 2017