Author:
Raghunandan ,Aishwarya B.,Ashwath Rao B.,Aithal Prakash K.,Kini Gopalakrishna N.
Publisher
Springer Nature Singapore
Reference16 articles.
1. Kirkpatrick D, Reisch S (1983) Upper bounds for sorting integers on random access machines. Theoret Comput Sci 28(3):263–276
2. Coreman TH, Leiserson CE, Rivest RL (2009) Introduction to algorithms, 3rd edn. MIT Press
3. Kim J-Y, Yoo H-J (2007) Bitwise competition logic for compact digital comparator. In IEEE Asian solid-state circuits conference, Jeju. Korea (South), pp 59–62. https://doi.org/10.1109/ASSCC.2007.4425682
4. Anthony Vinay Kumar S, Arti A (1892) Fastbit–radix sort optimized version of radix sort. In 2016 11th international conference on computer engineering and systems J. Clerk Maxwell, A treatise on electricity and magnetism, 3rd edn, vol 2, Oxford: Clarendon, pp 68–73
5. Gropp W, Lusk E, Skjellum A (2014) Using MPI. The MIT Press, Cambridge, MA