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

Aegean Workshop on Computing最新文献

筛选
英文 中文
Families of Consensus Algorithms 一致性算法族
Aegean Workshop on Computing Pub Date : 1988-06-28 DOI: 10.1007/BFb0040405
A. Bar-Noy, D. Dolev
{"title":"Families of Consensus Algorithms","authors":"A. Bar-Noy, D. Dolev","doi":"10.1007/BFb0040405","DOIUrl":"https://doi.org/10.1007/BFb0040405","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"20 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":"124062750","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}
引用次数: 17
Separation Pair Detection 分离对检测
Aegean Workshop on Computing Pub Date : 1988-06-28 DOI: 10.1007/BFb0040383
D. Fussell, R. Thurimella
{"title":"Separation Pair Detection","authors":"D. Fussell, R. Thurimella","doi":"10.1007/BFb0040383","DOIUrl":"https://doi.org/10.1007/BFb0040383","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"27 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":"126803832","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}
引用次数: 8
The Complexity of Selection Resolution, Conflict Resolution and Maximum Finding on Multiple Access Channels
Aegean Workshop on Computing Pub Date : 1988-06-28 DOI: 10.1007/BFb0040407
C. Martel, T. P. Vayda
{"title":"The Complexity of Selection Resolution, Conflict Resolution and Maximum Finding on Multiple Access Channels","authors":"C. Martel, T. P. Vayda","doi":"10.1007/BFb0040407","DOIUrl":"https://doi.org/10.1007/BFb0040407","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":"130989311","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}
引用次数: 9
Regular Structures and Testing: RCC-Adders 常规结构和测试:rcc加法器
Aegean Workshop on Computing Pub Date : 1988-06-28 DOI: 10.1007/BFb0040396
B. Becker, U. Sparmann
{"title":"Regular Structures and Testing: RCC-Adders","authors":"B. Becker, U. Sparmann","doi":"10.1007/BFb0040396","DOIUrl":"https://doi.org/10.1007/BFb0040396","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"9 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":"121677861","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}
引用次数: 5
Input Sensitive VLSI Layouts for Graphs of Arbitrary Degree 任意度图形的输入敏感VLSI布局
Aegean Workshop on Computing Pub Date : 1988-06-28 DOI: 10.1007/BFb0040394
Deepak D. Sherlekar, J. JáJá
{"title":"Input Sensitive VLSI Layouts for Graphs of Arbitrary Degree","authors":"Deepak D. Sherlekar, J. JáJá","doi":"10.1007/BFb0040394","DOIUrl":"https://doi.org/10.1007/BFb0040394","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"33 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":"121699405","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}
引用次数: 5
A 4D Channel Router for a Two Layer Diagonal Model 一个4D通道路由器的两层对角模型
Aegean Workshop on Computing Pub Date : 1988-06-28 DOI: 10.1007/BFb0040413
E. Lodi, F. Luccio, L. Pagli
{"title":"A 4D Channel Router for a Two Layer Diagonal Model","authors":"E. Lodi, F. Luccio, L. Pagli","doi":"10.1007/BFb0040413","DOIUrl":"https://doi.org/10.1007/BFb0040413","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"116 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":"114567918","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}
引用次数: 4
Fast Parallel and Sequential Algorithms for Edge-Coloring Planar Graphs 边着色平面图形的快速并行和顺序算法
Aegean Workshop on Computing Pub Date : 1988-06-28 DOI: 10.1007/BFb0040369
M. Chrobak, M. Yung
{"title":"Fast Parallel and Sequential Algorithms for Edge-Coloring Planar Graphs","authors":"M. Chrobak, M. Yung","doi":"10.1007/BFb0040369","DOIUrl":"https://doi.org/10.1007/BFb0040369","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"202 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":"130174628","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}
引用次数: 2
Applying the Classification Theorem for Finite Simple Groups to Minimize Pin Count in Uniform Permutation Architectures 有限简单群分类定理在一致排列结构中最小化引脚数的应用
Aegean Workshop on Computing Pub Date : 1988-06-28 DOI: 10.1007/BFb0040392
L. Finkelstein, D. Kleitman, F. Leighton
{"title":"Applying the Classification Theorem for Finite Simple Groups to Minimize Pin Count in Uniform Permutation Architectures","authors":"L. Finkelstein, D. Kleitman, F. Leighton","doi":"10.1007/BFb0040392","DOIUrl":"https://doi.org/10.1007/BFb0040392","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"3 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":"114362958","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}
引用次数: 17
Fast Self-Reduction Algorithms for Combinatorical Problems of VLSI-Design vlsi设计组合问题的快速自约简算法
Aegean Workshop on Computing Pub Date : 1988-06-28 DOI: 10.1007/BFb0040395
M. Fellows, M. Langston
{"title":"Fast Self-Reduction Algorithms for Combinatorical Problems of VLSI-Design","authors":"M. Fellows, M. Langston","doi":"10.1007/BFb0040395","DOIUrl":"https://doi.org/10.1007/BFb0040395","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"8 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":"123949547","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}
引用次数: 17
Efficient Parallel Triconnectivity in Logarithmic Time 对数时间下的高效并行三连通
Aegean Workshop on Computing Pub Date : 1988-06-28 DOI: 10.1007/BFb0040371
V. Ramachandran, U. Vishkin
{"title":"Efficient Parallel Triconnectivity in Logarithmic Time","authors":"V. Ramachandran, U. Vishkin","doi":"10.1007/BFb0040371","DOIUrl":"https://doi.org/10.1007/BFb0040371","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"3 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":"117166887","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}
引用次数: 36
首页 上一页 下一页 尾页
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学术官方微信