Fast and Efficient Circuit Topologies forFinding the Maximum of n k-Bit Numbers
From MaRDI portal
Publication:5268090
DOI10.1109/TC.2014.2315634zbMath1364.94821MaRDI QIDQ5268090
Bilgiday Yuce, Günhan Dündar, Sezer Gören, H. Fatih Uğurdağ
Publication date: 20 June 2017
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Applications of graph theory to circuits and networks (94C15) Numerical algorithms for specific classes of architectures (65Y10)
This page was built for publication: Fast and Efficient Circuit Topologies forFinding the Maximum of n k-Bit Numbers