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

SIGAL International Symposium on Algorithms最新文献

筛选
英文 中文
Oracles versus Proof Techniques that Do Not Relativize oracle与不相对化的证明技术
SIGAL International Symposium on Algorithms Pub Date : 1990-08-01 DOI: 10.1007/3-540-52921-7_54
E. Allender
{"title":"Oracles versus Proof Techniques that Do Not Relativize","authors":"E. Allender","doi":"10.1007/3-540-52921-7_54","DOIUrl":"https://doi.org/10.1007/3-540-52921-7_54","url":null,"abstract":"","PeriodicalId":355399,"journal":{"name":"SIGAL International Symposium on Algorithms","volume":"230 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114663300","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}
引用次数: 23
Efficient Parallel Algorithms for Path Problems in Planar Directed Graphs 平面有向图中路径问题的高效并行算法
SIGAL International Symposium on Algorithms Pub Date : 1990-08-01 DOI: 10.1007/3-540-52921-7_94
A. Lingas
{"title":"Efficient Parallel Algorithms for Path Problems in Planar Directed Graphs","authors":"A. Lingas","doi":"10.1007/3-540-52921-7_94","DOIUrl":"https://doi.org/10.1007/3-540-52921-7_94","url":null,"abstract":"","PeriodicalId":355399,"journal":{"name":"SIGAL International Symposium on Algorithms","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122149990","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
Planar Separators and the Euclidean Norm 平面分隔和欧几里得范数
SIGAL International Symposium on Algorithms Pub Date : 1990-08-01 DOI: 10.1007/3-540-52921-7_83
Hillel Gazit, G. Miller
{"title":"Planar Separators and the Euclidean Norm","authors":"Hillel Gazit, G. Miller","doi":"10.1007/3-540-52921-7_83","DOIUrl":"https://doi.org/10.1007/3-540-52921-7_83","url":null,"abstract":"","PeriodicalId":355399,"journal":{"name":"SIGAL International Symposium on Algorithms","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128113582","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
Sublinear Merging and Natural Merge Sort 次线性归并和自然归并排序
SIGAL International Symposium on Algorithms Pub Date : 1990-08-01 DOI: 10.1007/3-540-52921-7_74
S. Carlsson, C. Levcopoulos, O. Petersson
{"title":"Sublinear Merging and Natural Merge Sort","authors":"S. Carlsson, C. Levcopoulos, O. Petersson","doi":"10.1007/3-540-52921-7_74","DOIUrl":"https://doi.org/10.1007/3-540-52921-7_74","url":null,"abstract":"","PeriodicalId":355399,"journal":{"name":"SIGAL International Symposium on Algorithms","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134539031","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}
引用次数: 23
Distributed Algorithms for Deciphering 分布式译码算法
SIGAL International Symposium on Algorithms Pub Date : 1990-08-01 DOI: 10.1007/3-540-52921-7_68
M. Cosnard, J. Philippe
{"title":"Distributed Algorithms for Deciphering","authors":"M. Cosnard, J. Philippe","doi":"10.1007/3-540-52921-7_68","DOIUrl":"https://doi.org/10.1007/3-540-52921-7_68","url":null,"abstract":"","PeriodicalId":355399,"journal":{"name":"SIGAL International Symposium on Algorithms","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131388403","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
Parallel Algorithms for Finding Steiner Forests in Planar Graphs 平面图中寻找Steiner森林的并行算法
SIGAL International Symposium on Algorithms Pub Date : 1990-08-01 DOI: 10.1007/3-540-52921-7_95
H. Suzuki, Chiseko Yamanaka, Takao Nishizeki
{"title":"Parallel Algorithms for Finding Steiner Forests in Planar Graphs","authors":"H. Suzuki, Chiseko Yamanaka, Takao Nishizeki","doi":"10.1007/3-540-52921-7_95","DOIUrl":"https://doi.org/10.1007/3-540-52921-7_95","url":null,"abstract":"","PeriodicalId":355399,"journal":{"name":"SIGAL International Symposium on Algorithms","volume":"36 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120919232","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}
引用次数: 7
Simultaneous Solution of Families of Problems 问题家族的同时解
SIGAL International Symposium on Algorithms Pub Date : 1990-08-01 DOI: 10.1007/3-540-52921-7_78
Refael Hassin
{"title":"Simultaneous Solution of Families of Problems","authors":"Refael Hassin","doi":"10.1007/3-540-52921-7_78","DOIUrl":"https://doi.org/10.1007/3-540-52921-7_78","url":null,"abstract":"","PeriodicalId":355399,"journal":{"name":"SIGAL International Symposium on Algorithms","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127736959","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
On the Complexity of Isometric Embedding in the Hypercube 超立方体中等距嵌入的复杂性
SIGAL International Symposium on Algorithms Pub Date : 1990-08-01 DOI: 10.1007/3-540-52921-7_84
D. Avis
{"title":"On the Complexity of Isometric Embedding in the Hypercube","authors":"D. Avis","doi":"10.1007/3-540-52921-7_84","DOIUrl":"https://doi.org/10.1007/3-540-52921-7_84","url":null,"abstract":"","PeriodicalId":355399,"journal":{"name":"SIGAL International Symposium on Algorithms","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126866050","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
Graph Augmentation Problems for a Specified Set of Vertices 给定顶点集的图增广问题
SIGAL International Symposium on Algorithms Pub Date : 1990-08-01 DOI: 10.1007/3-540-52921-7_87
Toshimasa Watanabe, Y. Higashi, A. Nakamura
{"title":"Graph Augmentation Problems for a Specified Set of Vertices","authors":"Toshimasa Watanabe, Y. Higashi, A. Nakamura","doi":"10.1007/3-540-52921-7_87","DOIUrl":"https://doi.org/10.1007/3-540-52921-7_87","url":null,"abstract":"","PeriodicalId":355399,"journal":{"name":"SIGAL International Symposium on Algorithms","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131421960","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}
引用次数: 18
Another View on the SSS* Algorithm SSS*算法的另一种观点
SIGAL International Symposium on Algorithms Pub Date : 1990-08-01 DOI: 10.1007/3-540-52921-7_70
W. Pijls, A. Bruin
{"title":"Another View on the SSS* Algorithm","authors":"W. Pijls, A. Bruin","doi":"10.1007/3-540-52921-7_70","DOIUrl":"https://doi.org/10.1007/3-540-52921-7_70","url":null,"abstract":"","PeriodicalId":355399,"journal":{"name":"SIGAL International Symposium on Algorithms","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131553821","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}
引用次数: 22
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信