ON INFORMATION FLOW AND SORTING: NEW UPPER AND LOWER BOUNDS FOR VLSI CIRCUITS.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This work comprises two parts: lower bounds and upper bounds in VLSI circuits. The upper bounds are for the sorting problem: the authors describe a large number of constructions for sorting N numbers in the range left bracket 0,M right bracket for the standard VLSI bit model. The lower bounds apply to a variety of problems. Two new techniques are presented for establishing lower bounds on the information flow in VLSI circuits.

Original languageEnglish (US)
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherIEEE
Pages208-221
Number of pages14
ISBN (Print)0818606444
StatePublished - 1985

Fingerprint

VLSI circuits
Sorting

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Cole, R., & Siegel, A. (1985). ON INFORMATION FLOW AND SORTING: NEW UPPER AND LOWER BOUNDS FOR VLSI CIRCUITS. In Annual Symposium on Foundations of Computer Science (Proceedings) (pp. 208-221). IEEE.

ON INFORMATION FLOW AND SORTING : NEW UPPER AND LOWER BOUNDS FOR VLSI CIRCUITS. / Cole, Richard; Siegel, Alan.

Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, 1985. p. 208-221.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cole, R & Siegel, A 1985, ON INFORMATION FLOW AND SORTING: NEW UPPER AND LOWER BOUNDS FOR VLSI CIRCUITS. in Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, pp. 208-221.
Cole R, Siegel A. ON INFORMATION FLOW AND SORTING: NEW UPPER AND LOWER BOUNDS FOR VLSI CIRCUITS. In Annual Symposium on Foundations of Computer Science (Proceedings). IEEE. 1985. p. 208-221
Cole, Richard ; Siegel, Alan. / ON INFORMATION FLOW AND SORTING : NEW UPPER AND LOWER BOUNDS FOR VLSI CIRCUITS. Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, 1985. pp. 208-221
@inproceedings{3019436cc3ab40a4b84f7b6611ec314f,
title = "ON INFORMATION FLOW AND SORTING: NEW UPPER AND LOWER BOUNDS FOR VLSI CIRCUITS.",
abstract = "This work comprises two parts: lower bounds and upper bounds in VLSI circuits. The upper bounds are for the sorting problem: the authors describe a large number of constructions for sorting N numbers in the range left bracket 0,M right bracket for the standard VLSI bit model. The lower bounds apply to a variety of problems. Two new techniques are presented for establishing lower bounds on the information flow in VLSI circuits.",
author = "Richard Cole and Alan Siegel",
year = "1985",
language = "English (US)",
isbn = "0818606444",
pages = "208--221",
booktitle = "Annual Symposium on Foundations of Computer Science (Proceedings)",
publisher = "IEEE",

}

TY - GEN

T1 - ON INFORMATION FLOW AND SORTING

T2 - NEW UPPER AND LOWER BOUNDS FOR VLSI CIRCUITS.

AU - Cole, Richard

AU - Siegel, Alan

PY - 1985

Y1 - 1985

N2 - This work comprises two parts: lower bounds and upper bounds in VLSI circuits. The upper bounds are for the sorting problem: the authors describe a large number of constructions for sorting N numbers in the range left bracket 0,M right bracket for the standard VLSI bit model. The lower bounds apply to a variety of problems. Two new techniques are presented for establishing lower bounds on the information flow in VLSI circuits.

AB - This work comprises two parts: lower bounds and upper bounds in VLSI circuits. The upper bounds are for the sorting problem: the authors describe a large number of constructions for sorting N numbers in the range left bracket 0,M right bracket for the standard VLSI bit model. The lower bounds apply to a variety of problems. Two new techniques are presented for establishing lower bounds on the information flow in VLSI circuits.

UR - http://www.scopus.com/inward/record.url?scp=0022188125&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022188125&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0022188125

SN - 0818606444

SP - 208

EP - 221

BT - Annual Symposium on Foundations of Computer Science (Proceedings)

PB - IEEE

ER -