Optimal VLSI Circuits for Sorting (Classic Reprint)

Optimal VLSI Circuits for Sorting (Classic Reprint)

Hardback (06 Mar 2018)

Not available for sale

Includes delivery to the United States

Out of stock

This service is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Publisher's Synopsis

Excerpt from Optimal Vlsi Circuits for Sorting

This work describes a large number of constructions for sorting N numbers in the range [0, m] for the standard vlsi bit model. Among other results, we attain: O vlsi sorter constructions that are within a constant factor of optimal size for almost all number ranges M (including M N), and running times T.

About the Publisher

Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com

This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.

Book information

ISBN: 9780484631211
Publisher: Fb&c Ltd
Imprint: Forgotten Books
Pub date:
Number of pages: 48
Weight: 222g
Height: 229mm
Width: 152mm
Spine width: 6mm