普查函数:VLSI上界的一种方法

22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) Pub Date : 1981-10-28 DOI:10.1145/3828.3834

R. Lipton, J. Valdes

{"title":"普查函数:VLSI上界的一种方法","authors":"R. Lipton, J. Valdes","doi":"10.1145/3828.3834","DOIUrl":null,"url":null,"abstract":"A model of VLSI computation suitable for the description of algorithms at a high level is introduced. The model is basically a language to express parallel computations which can be efficiently implemented by a VLSI circuit. This language is used to describe area-time efficient algorithms for a few well known graph problems. The exact complexity of these algorithms and their relevance to recent work on the inherent limitations of VLSI computations are also presented.","PeriodicalId":224735,"journal":{"name":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1981-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":"{\"title\":\"Census functions: An approach to VLSI upper bounds\",\"authors\":\"R. Lipton, J. Valdes\",\"doi\":\"10.1145/3828.3834\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A model of VLSI computation suitable for the description of algorithms at a high level is introduced. The model is basically a language to express parallel computations which can be efficiently implemented by a VLSI circuit. This language is used to describe area-time efficient algorithms for a few well known graph problems. The exact complexity of these algorithms and their relevance to recent work on the inherent limitations of VLSI computations are also presented.\",\"PeriodicalId\":224735,\"journal\":{\"name\":\"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1981-10-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"20\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3828.3834\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3828.3834","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 20

摘要

介绍了一种适用于高层次算法描述的VLSI计算模型。该模型基本上是一种表达并行计算的语言，可以在VLSI电路中有效地实现。这种语言被用来描述一些众所周知的图问题的面积-时间高效算法。这些算法的确切复杂性及其与VLSI计算固有局限性的最新工作的相关性也被提出。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Census functions: An approach to VLSI upper bounds

A model of VLSI computation suitable for the description of algorithms at a high level is introduced. The model is basically a language to express parallel computations which can be efficiently implemented by a VLSI circuit. This language is used to describe area-time efficient algorithms for a few well known graph problems. The exact complexity of these algorithms and their relevance to recent work on the inherent limitations of VLSI computations are also presented.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)

自引率

0.00%

发文量