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

Optimal Algorithms最新文献

筛选
英文 中文
Complexity of the Parallel Givens Facotrization on Shared Memory Architectures 共享内存体系结构上并行给定分解的复杂性
Optimal Algorithms Pub Date : 1989-05-29 DOI: 10.1007/3-540-51859-2_9
M. Cosnard, E. M. Daoudi, Y. Robert
{"title":"Complexity of the Parallel Givens Facotrization on Shared Memory Architectures","authors":"M. Cosnard, E. M. Daoudi, Y. Robert","doi":"10.1007/3-540-51859-2_9","DOIUrl":"https://doi.org/10.1007/3-540-51859-2_9","url":null,"abstract":"","PeriodicalId":321589,"journal":{"name":"Optimal Algorithms","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127490197","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
Sorting within Distance Bound on a Mesh-Connected Processor Array 在网格连接处理器阵列上的距离范围内排序
Optimal Algorithms Pub Date : 1989-05-29 DOI: 10.1007/3-540-51859-2_18
Bogdan S. Chlebus
{"title":"Sorting within Distance Bound on a Mesh-Connected Processor Array","authors":"Bogdan S. Chlebus","doi":"10.1007/3-540-51859-2_18","DOIUrl":"https://doi.org/10.1007/3-540-51859-2_18","url":null,"abstract":"","PeriodicalId":321589,"journal":{"name":"Optimal Algorithms","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114598023","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
Optimal Parallel Computations for Halin Graphs Halin图的最佳并行计算
Optimal Algorithms Pub Date : 1989-05-29 DOI: 10.1007/3-540-51859-2_21
K. Diks, W. Rytter
{"title":"Optimal Parallel Computations for Halin Graphs","authors":"K. Diks, W. Rytter","doi":"10.1007/3-540-51859-2_21","DOIUrl":"https://doi.org/10.1007/3-540-51859-2_21","url":null,"abstract":"","PeriodicalId":321589,"journal":{"name":"Optimal Algorithms","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122761290","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}
引用次数: 0
A Framework for Parallel Graph Algorithm Design 并行图算法设计框架
Optimal Algorithms Pub Date : 1989-05-29 DOI: 10.1007/3-540-51859-2_5
V. Ramachandran
{"title":"A Framework for Parallel Graph Algorithm Design","authors":"V. Ramachandran","doi":"10.1007/3-540-51859-2_5","DOIUrl":"https://doi.org/10.1007/3-540-51859-2_5","url":null,"abstract":"","PeriodicalId":321589,"journal":{"name":"Optimal Algorithms","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123450688","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
Optimal Bounds on the Dictionary Problem 字典问题的最优界
Optimal Algorithms Pub Date : 1989-05-29 DOI: 10.1007/3-540-51859-2_10
A. Andersson
{"title":"Optimal Bounds on the Dictionary Problem","authors":"A. Andersson","doi":"10.1007/3-540-51859-2_10","DOIUrl":"https://doi.org/10.1007/3-540-51859-2_10","url":null,"abstract":"","PeriodicalId":321589,"journal":{"name":"Optimal Algorithms","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127234319","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}
引用次数: 11
On Some Properties of (a, b)-Trees 关于(a, b)-树的一些性质
Optimal Algorithms Pub Date : 1989-05-29 DOI: 10.1007/3-540-51859-2_13
R. Sprugnoli, E. Barcucci, A. Chiuderi, R. Pinzani
{"title":"On Some Properties of (a, b)-Trees","authors":"R. Sprugnoli, E. Barcucci, A. Chiuderi, R. Pinzani","doi":"10.1007/3-540-51859-2_13","DOIUrl":"https://doi.org/10.1007/3-540-51859-2_13","url":null,"abstract":"","PeriodicalId":321589,"journal":{"name":"Optimal Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134479214","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}
引用次数: 0
Randomization in Parallel Algorithms and its Impact on Computational Geometry 并行算法中的随机化及其对计算几何的影响
Optimal Algorithms Pub Date : 1989-05-29 DOI: 10.1007/3-540-51859-2_1
J. Reif, Sandeep Sen
{"title":"Randomization in Parallel Algorithms and its Impact on Computational Geometry","authors":"J. Reif, Sandeep Sen","doi":"10.1007/3-540-51859-2_1","DOIUrl":"https://doi.org/10.1007/3-540-51859-2_1","url":null,"abstract":"","PeriodicalId":321589,"journal":{"name":"Optimal Algorithms","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122136785","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
Optimal Parallel Algorithms for b-Matchings in Trees 树中b匹配的最优并行算法
Optimal Algorithms Pub Date : 1989-05-29 DOI: 10.1007/3-540-51859-2_22
Constantine N. K. Osiakwan, S. Akl
{"title":"Optimal Parallel Algorithms for b-Matchings in Trees","authors":"Constantine N. K. Osiakwan, S. Akl","doi":"10.1007/3-540-51859-2_22","DOIUrl":"https://doi.org/10.1007/3-540-51859-2_22","url":null,"abstract":"","PeriodicalId":321589,"journal":{"name":"Optimal Algorithms","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129693468","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}
引用次数: 6
An Upper Bound on the Order of Locally Testable Deterministic Finite Automata 局部可测试确定性有限自动机阶的上界
Optimal Algorithms Pub Date : 1989-05-29 DOI: 10.1007/3-540-51859-2_7
Sam M. Kim, R. McNaughton, Robert McCloskey
{"title":"An Upper Bound on the Order of Locally Testable Deterministic Finite Automata","authors":"Sam M. Kim, R. McNaughton, Robert McCloskey","doi":"10.1007/3-540-51859-2_7","DOIUrl":"https://doi.org/10.1007/3-540-51859-2_7","url":null,"abstract":"","PeriodicalId":321589,"journal":{"name":"Optimal Algorithms","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133765325","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 Approximability of Problems Complete for P P完备问题的逼近性
Optimal Algorithms Pub Date : 1989-05-29 DOI: 10.1007/3-540-51859-2_16
M. Serna, P. Spirakis
{"title":"The Approximability of Problems Complete for P","authors":"M. Serna, P. Spirakis","doi":"10.1007/3-540-51859-2_16","DOIUrl":"https://doi.org/10.1007/3-540-51859-2_16","url":null,"abstract":"","PeriodicalId":321589,"journal":{"name":"Optimal Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125370456","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学术官方微信