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

Optimal Algorithms最新文献

筛选
英文 中文
Optimal Constant Space Move-to-Rear List Organization 最佳恒定空间移动到后方列表组织
Optimal Algorithms Pub Date : 1989-11-01 DOI: 10.1007/3-540-51859-2_11
B. Oommen, D. Ng
{"title":"Optimal Constant Space Move-to-Rear List Organization","authors":"B. Oommen, D. Ng","doi":"10.1007/3-540-51859-2_11","DOIUrl":"https://doi.org/10.1007/3-540-51859-2_11","url":null,"abstract":"","PeriodicalId":321589,"journal":{"name":"Optimal Algorithms","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126307290","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
Which Triangulations Approximate the Complete Graph? 哪些三角剖分近似完全图?
Optimal Algorithms Pub Date : 1989-11-01 DOI: 10.1007/3-540-51859-2_15
G. Das, D. Joseph
{"title":"Which Triangulations Approximate the Complete Graph?","authors":"G. Das, D. Joseph","doi":"10.1007/3-540-51859-2_15","DOIUrl":"https://doi.org/10.1007/3-540-51859-2_15","url":null,"abstract":"","PeriodicalId":321589,"journal":{"name":"Optimal Algorithms","volume":"4 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131805827","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}
引用次数: 104
Computing Digitized Voronoi Diagrams on a Systolic Screen and Applications to Clustering 在收缩屏幕上计算数字化Voronoi图及其在聚类中的应用
Optimal Algorithms Pub Date : 1989-11-01 DOI: 10.1007/3-540-51859-2_3
F. Dehne
{"title":"Computing Digitized Voronoi Diagrams on a Systolic Screen and Applications to Clustering","authors":"F. Dehne","doi":"10.1007/3-540-51859-2_3","DOIUrl":"https://doi.org/10.1007/3-540-51859-2_3","url":null,"abstract":"","PeriodicalId":321589,"journal":{"name":"Optimal Algorithms","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132141931","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
PRAM Algorithms for Identifying Polygon Similarity 多边形相似度识别的PRAM算法
Optimal Algorithms Pub Date : 1989-11-01 DOI: 10.1007/3-540-51859-2_4
C. Iliopoulos, W. F. Smyth
{"title":"PRAM Algorithms for Identifying Polygon Similarity","authors":"C. Iliopoulos, W. F. Smyth","doi":"10.1007/3-540-51859-2_4","DOIUrl":"https://doi.org/10.1007/3-540-51859-2_4","url":null,"abstract":"","PeriodicalId":321589,"journal":{"name":"Optimal Algorithms","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124167444","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
Local Insertion Sort Revisited 重新访问本地插入排序
Optimal Algorithms Pub Date : 1989-11-01 DOI: 10.1007/3-540-51859-2_19
J. Katajainen, C. Levcopoulos, O. Petersson
{"title":"Local Insertion Sort Revisited","authors":"J. Katajainen, C. Levcopoulos, O. Petersson","doi":"10.1007/3-540-51859-2_19","DOIUrl":"https://doi.org/10.1007/3-540-51859-2_19","url":null,"abstract":"","PeriodicalId":321589,"journal":{"name":"Optimal Algorithms","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116590137","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}
引用次数: 10
A Fast Algorithm to Decide on Simple Grammars Equivalence 一种快速确定简单语法等价的算法
Optimal Algorithms Pub Date : 1989-11-01 DOI: 10.1007/3-540-51859-2_8
D. Caucal
{"title":"A Fast Algorithm to Decide on Simple Grammars Equivalence","authors":"D. Caucal","doi":"10.1007/3-540-51859-2_8","DOIUrl":"https://doi.org/10.1007/3-540-51859-2_8","url":null,"abstract":"","PeriodicalId":321589,"journal":{"name":"Optimal Algorithms","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126728697","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}
引用次数: 12
Improved Bounds on the Size of Separators of Toroidal Graphs 环面图分隔符大小的改进界
Optimal Algorithms Pub Date : 1989-05-29 DOI: 10.1007/3-540-51859-2_12
L. Aleksandrov, H. Djidjev
{"title":"Improved Bounds on the Size of Separators of Toroidal Graphs","authors":"L. Aleksandrov, H. Djidjev","doi":"10.1007/3-540-51859-2_12","DOIUrl":"https://doi.org/10.1007/3-540-51859-2_12","url":null,"abstract":"","PeriodicalId":321589,"journal":{"name":"Optimal Algorithms","volume":"34 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":"123665438","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
Fast Soliton Automata 快速孤子自动机
Optimal Algorithms Pub Date : 1989-05-29 DOI: 10.1007/3-540-51859-2_6
T. Papatheodorou, N. Tsantanis
{"title":"Fast Soliton Automata","authors":"T. Papatheodorou, N. Tsantanis","doi":"10.1007/3-540-51859-2_6","DOIUrl":"https://doi.org/10.1007/3-540-51859-2_6","url":null,"abstract":"","PeriodicalId":321589,"journal":{"name":"Optimal Algorithms","volume":"45 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":"134595364","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
A Structural Overview of NP Optimization Problems NP优化问题的结构概述
Optimal Algorithms Pub Date : 1989-05-29 DOI: 10.1007/3-540-51859-2_17
D. Bruschi, D. Joseph, P. Young
{"title":"A Structural Overview of NP Optimization Problems","authors":"D. Bruschi, D. Joseph, P. Young","doi":"10.1007/3-540-51859-2_17","DOIUrl":"https://doi.org/10.1007/3-540-51859-2_17","url":null,"abstract":"","PeriodicalId":321589,"journal":{"name":"Optimal Algorithms","volume":"19 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":"122112250","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}
引用次数: 27
Ther Are Planar Graphs Almost as Good as the Complete Graphs and as Short as Minimum Spanning Trees 有一些平面图几乎和完全图一样好，和最小生成树一样短
Optimal Algorithms Pub Date : 1989-05-29 DOI: 10.1007/3-540-51859-2_2
C. Levcopoulos, A. Lingas
{"title":"Ther Are Planar Graphs Almost as Good as the Complete Graphs and as Short as Minimum Spanning Trees","authors":"C. Levcopoulos, A. Lingas","doi":"10.1007/3-540-51859-2_2","DOIUrl":"https://doi.org/10.1007/3-540-51859-2_2","url":null,"abstract":"","PeriodicalId":321589,"journal":{"name":"Optimal Algorithms","volume":"31 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":"127798778","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}
引用次数: 32
下一页 尾页
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学术官方微信