发布求助
文献互助 智能选刊 最新文献

Aegean Workshop on Computing最新文献

筛选
英文 中文
Efficient Reconfiguration of VLSI Arrays VLSI阵列的高效重构
Aegean Workshop on Computing Pub Date : 1988-08-01 DOI: 10.1007/BFb0040387
B. Codenotti, R. Tamassia
{"title":"Efficient Reconfiguration of VLSI Arrays","authors":"B. Codenotti, R. Tamassia","doi":"10.1007/BFb0040387","DOIUrl":"https://doi.org/10.1007/BFb0040387","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117293802","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Universal Hashing in VLSI VLSI中的通用散列
Aegean Workshop on Computing Pub Date : 1988-08-01 DOI: 10.1007/BFb0040398
Martin Fürer
{"title":"Universal Hashing in VLSI","authors":"Martin Fürer","doi":"10.1007/BFb0040398","DOIUrl":"https://doi.org/10.1007/BFb0040398","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122541523","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Compaction on the Torus 环面上的压实
Aegean Workshop on Computing Pub Date : 1988-08-01 DOI: 10.1007/BFb0040389
K. Mehlhorn, Wolfgang Rülling
{"title":"Compaction on the Torus","authors":"K. Mehlhorn, Wolfgang Rülling","doi":"10.1007/BFb0040389","DOIUrl":"https://doi.org/10.1007/BFb0040389","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125551662","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 19
Simple Three-Layer Channel Routing Algorithms 简单三层通道路由算法
Aegean Workshop on Computing Pub Date : 1988-08-01 DOI: 10.1007/BFb0040391
T. Gonzalez, Si-Qing Zheng
{"title":"Simple Three-Layer Channel Routing Algorithms","authors":"T. Gonzalez, Si-Qing Zheng","doi":"10.1007/BFb0040391","DOIUrl":"https://doi.org/10.1007/BFb0040391","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123957221","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Cubesort: An Optimal Sorting Algorithm for Feasible Parallel Computers 立方体排序:可行并行计算机的最优排序算法
Aegean Workshop on Computing Pub Date : 1988-08-01 DOI: 10.1007/BFb0040412
R. Cypher, J. Sanz
{"title":"Cubesort: An Optimal Sorting Algorithm for Feasible Parallel Computers","authors":"R. Cypher, J. Sanz","doi":"10.1007/BFb0040412","DOIUrl":"https://doi.org/10.1007/BFb0040412","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121937916","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
Routing and Sorting on Mesh-Connected Arrays 网格连接阵列上的路由和排序
Aegean Workshop on Computing Pub Date : 1988-06-28 DOI: 10.1007/BFb0040409
M. Kunde
{"title":"Routing and Sorting on Mesh-Connected Arrays","authors":"M. Kunde","doi":"10.1007/BFb0040409","DOIUrl":"https://doi.org/10.1007/BFb0040409","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132213957","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 102
Weighted Distributed Match-Making 加权分布式配对
Aegean Workshop on Computing Pub Date : 1988-06-28 DOI: 10.1007/BFb0040403
E. Kranakis, P. Vitányi
{"title":"Weighted Distributed Match-Making","authors":"E. Kranakis, P. Vitányi","doi":"10.1007/BFb0040403","DOIUrl":"https://doi.org/10.1007/BFb0040403","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129852254","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Simulating Binary Trees on Hypercubes 在超立方体上模拟二叉树
Aegean Workshop on Computing Pub Date : 1988-06-28 DOI: 10.1007/BFb0040385
B. Monien, I. H. Sudborough
{"title":"Simulating Binary Trees on Hypercubes","authors":"B. Monien, I. H. Sudborough","doi":"10.1007/BFb0040385","DOIUrl":"https://doi.org/10.1007/BFb0040385","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128658739","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 55
Optimal Parallel Evaluation of Tree-Structured Computations by Raking 树结构计算的最优并行评价
Aegean Workshop on Computing Pub Date : 1988-06-28 DOI: 10.1007/BFb0040378
S. Kosaraju, A. Delcher
{"title":"Optimal Parallel Evaluation of Tree-Structured Computations by Raking","authors":"S. Kosaraju, A. Delcher","doi":"10.1007/BFb0040378","DOIUrl":"https://doi.org/10.1007/BFb0040378","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115315955","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 109
A New Algorithm for Wiring Layouts 一种新的布线布局算法
Aegean Workshop on Computing Pub Date : 1988-06-28 DOI: 10.1007/BFb0040393
I. Tollis
{"title":"A New Algorithm for Wiring Layouts","authors":"I. Tollis","doi":"10.1007/BFb0040393","DOIUrl":"https://doi.org/10.1007/BFb0040393","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115870034","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信