EFFICIENT HARDWARE ALGORITHMS FOR N CHOOSE K COUNTERS USING THE BITONIC MERGER

DOI10.1142/S0129054107004814zbMath1117.68094OpenAlexW2070917116MaRDI QIDQ3444843

Yasuaki Ito, Koji Nakano, Youhei Yamagishi

Publication date: 5 June 2007

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054107004814

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Cites Work

• Unnamed Item
• Unnamed Item
• Digital halftones by dot diffusion
• Bounds to Complexities of Networks for Sorting and for Switching

This page was built for publication: EFFICIENT HARDWARE ALGORITHMS FOR N CHOOSE K COUNTERS USING THE BITONIC MERGER