Fast and Efficient Circuit Topologies forFinding the Maximum of n k-Bit Numbers

DOI10.1109/TC.2014.2315634zbMATH Open1364.94821MaRDI QIDQ5268090FDOQ5268090

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)

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15) Numerical algorithms for specific classes of architectures (65Y10)

Cited In (2)

• EFFICIENT HARDWARE ALGORITHMS FOR N CHOOSE K COUNTERS USING THE BITONIC MERGER
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• Arithmetic Circuit Lower Bounds via MaxRank 👍 👎
• EFFICIENT HARDWARE ALGORITHMS FOR N CHOOSE K COUNTERS USING THE BITONIC MERGER 👍 👎
• Design and Analysis of Efficient Maximum/Minimum Circuits for Stochastic Computing 👍 👎
• Title not available (Why is that?) 👍 👎
• On Optimal Depth Threshold Circuits for Multiplication and Related Problems 👍 👎
• Efficiently enumerating all maximal cliques with bit-parallelism 👍 👎
• Faster optimal parallel prefix circuits: new algorithmic construction 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Fast and Efficient Circuit Topologies forFinding the Maximum of n k-Bit Numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5268090)