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

International Conference on Topics in Theoretical Computer Science最新文献

筛选
英文 中文
Computing Boundary Cycle of a Pseudo-Triangle Polygon from its Visibility Graph 伪三角形多边形可见性图边界环的计算
International Conference on Topics in Theoretical Computer Science Pub Date : 2020-02-16 DOI: 10.1007/978-3-030-57852-7_5
Hossein Boomari Soheila Farokhi
{"title":"Computing Boundary Cycle of a Pseudo-Triangle Polygon from its Visibility Graph","authors":"Hossein Boomari Soheila Farokhi","doi":"10.1007/978-3-030-57852-7_5","DOIUrl":"https://doi.org/10.1007/978-3-030-57852-7_5","url":null,"abstract":"","PeriodicalId":225805,"journal":{"name":"International Conference on Topics in Theoretical Computer Science","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115160112","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
Locality-Based Relaxation: An Efficient Method for GPU-Based Computation of Shortest Paths 基于位置的松弛:一种高效的gpu最短路径计算方法
International Conference on Topics in Theoretical Computer Science Pub Date : 2017-09-12 DOI: 10.1007/978-3-319-68953-1_5
M. Safari, Ali Ebnenasir
{"title":"Locality-Based Relaxation: An Efficient Method for GPU-Based Computation of Shortest Paths","authors":"M. Safari, Ali Ebnenasir","doi":"10.1007/978-3-319-68953-1_5","DOIUrl":"https://doi.org/10.1007/978-3-319-68953-1_5","url":null,"abstract":"","PeriodicalId":225805,"journal":{"name":"International Conference on Topics in Theoretical Computer Science","volume":"29 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114473078","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
Container Combinatorics: Monads and Lax Monoidal Functors 容器组合:单函数和Lax单函子
International Conference on Topics in Theoretical Computer Science Pub Date : 2017-09-12 DOI: 10.1007/978-3-319-68953-1_8
Tarmo Uustalu
{"title":"Container Combinatorics: Monads and Lax Monoidal Functors","authors":"Tarmo Uustalu","doi":"10.1007/978-3-319-68953-1_8","DOIUrl":"https://doi.org/10.1007/978-3-319-68953-1_8","url":null,"abstract":"","PeriodicalId":225805,"journal":{"name":"International Conference on Topics in Theoretical Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125660150","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
Design and Validation of Cloud Storage Systems Using Formal Methods 使用形式化方法设计和验证云存储系统
International Conference on Topics in Theoretical Computer Science Pub Date : 2017-09-12 DOI: 10.1007/978-3-319-68953-1_1
P. C. Ölveczky
{"title":"Design and Validation of Cloud Storage Systems Using Formal Methods","authors":"P. C. Ölveczky","doi":"10.1007/978-3-319-68953-1_1","DOIUrl":"https://doi.org/10.1007/978-3-319-68953-1_1","url":null,"abstract":"","PeriodicalId":225805,"journal":{"name":"International Conference on Topics in Theoretical Computer Science","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133440837","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 Characterization of Horoidal Digraphs 有向图的一个表征
International Conference on Topics in Theoretical Computer Science Pub Date : 2017-09-12 DOI: 10.1007/978-3-319-68953-1_2
Ardeshir Dolati
{"title":"A Characterization of Horoidal Digraphs","authors":"Ardeshir Dolati","doi":"10.1007/978-3-319-68953-1_2","DOIUrl":"https://doi.org/10.1007/978-3-319-68953-1_2","url":null,"abstract":"","PeriodicalId":225805,"journal":{"name":"International Conference on Topics in Theoretical Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130805477","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
Inverse Multi-objective Shortest Path Problem Under the Bottleneck Type Weighted Hamming Distance 瓶颈型加权汉明距离下的逆多目标最短路径问题
International Conference on Topics in Theoretical Computer Science Pub Date : 2017-09-12 DOI: 10.1007/978-3-319-68953-1_4
M. Karimi, M. Aman, Ardeshir Dolati
{"title":"Inverse Multi-objective Shortest Path Problem Under the Bottleneck Type Weighted Hamming Distance","authors":"M. Karimi, M. Aman, Ardeshir Dolati","doi":"10.1007/978-3-319-68953-1_4","DOIUrl":"https://doi.org/10.1007/978-3-319-68953-1_4","url":null,"abstract":"","PeriodicalId":225805,"journal":{"name":"International Conference on Topics in Theoretical Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115790595","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
Exposing Latent Mutual Exclusion by Work Automata 利用工作自动机揭示潜在互斥现象
International Conference on Topics in Theoretical Computer Science Pub Date : 2017-09-12 DOI: 10.1007/978-3-319-68953-1_6
Kasper Dokter, F. Arbab
{"title":"Exposing Latent Mutual Exclusion by Work Automata","authors":"Kasper Dokter, F. Arbab","doi":"10.1007/978-3-319-68953-1_6","DOIUrl":"https://doi.org/10.1007/978-3-319-68953-1_6","url":null,"abstract":"","PeriodicalId":225805,"journal":{"name":"International Conference on Topics in Theoretical Computer Science","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134559415","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
Unification of Hypergraph lambda -Terms 超图 λ -项的统一
International Conference on Topics in Theoretical Computer Science Pub Date : 2017-09-12 DOI: 10.1007/978-3-319-68953-1_9
Alimujiang Yasen, K. Ueda
{"title":"Unification of Hypergraph lambda -Terms","authors":"Alimujiang Yasen, K. Ueda","doi":"10.1007/978-3-319-68953-1_9","DOIUrl":"https://doi.org/10.1007/978-3-319-68953-1_9","url":null,"abstract":"","PeriodicalId":225805,"journal":{"name":"International Conference on Topics in Theoretical Computer Science","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129190883","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
Gomory Hu Tree and Pendant Pairs of a Symmetric Submodular System 对称子模系统的Gomory Hu树和垂坠对
International Conference on Topics in Theoretical Computer Science Pub Date : 2017-09-12 DOI: 10.1007/978-3-319-68953-1_3
Saeid Hanifehnezhad, Ardeshir Dolati
{"title":"Gomory Hu Tree and Pendant Pairs of a Symmetric Submodular System","authors":"Saeid Hanifehnezhad, Ardeshir Dolati","doi":"10.1007/978-3-319-68953-1_3","DOIUrl":"https://doi.org/10.1007/978-3-319-68953-1_3","url":null,"abstract":"","PeriodicalId":225805,"journal":{"name":"International Conference on Topics in Theoretical Computer Science","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115570979","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 Decidable Subtyping Logic for Intersection and Union Types 交集与联合类型的可判定子类型逻辑
International Conference on Topics in Theoretical Computer Science Pub Date : 2017-03-10 DOI: 10.1007/978-3-319-68953-1_7
L. Liquori, C. Stolze
{"title":"A Decidable Subtyping Logic for Intersection and Union Types","authors":"L. Liquori, C. Stolze","doi":"10.1007/978-3-319-68953-1_7","DOIUrl":"https://doi.org/10.1007/978-3-319-68953-1_7","url":null,"abstract":"","PeriodicalId":225805,"journal":{"name":"International Conference on Topics in Theoretical Computer Science","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125166682","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
下一页 尾页
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学术官方微信