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

International Symposium on Fundamentals of Computation Theory最新文献

筛选
英文 中文
Bivariate B-Splines from Convex Pseudo-circle Configurations 凸伪圆构型的二元b样条
International Symposium on Fundamentals of Computation Theory Pub Date : 2019-08-12 DOI: 10.1007/978-3-030-25027-0_23
Dominique Schmitt
{"title":"Bivariate B-Splines from Convex Pseudo-circle Configurations","authors":"Dominique Schmitt","doi":"10.1007/978-3-030-25027-0_23","DOIUrl":"https://doi.org/10.1007/978-3-030-25027-0_23","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133512255","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
Highly Succinct Dynamic Data Structures 高度简洁的动态数据结构
International Symposium on Fundamentals of Computation Theory Pub Date : 2019-08-12 DOI: 10.1007/978-3-030-25027-0_3
T. Hagerup
{"title":"Highly Succinct Dynamic Data Structures","authors":"T. Hagerup","doi":"10.1007/978-3-030-25027-0_3","DOIUrl":"https://doi.org/10.1007/978-3-030-25027-0_3","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133314583","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
Succinct Representations of Finite Groups 有限群的简洁表示
International Symposium on Fundamentals of Computation Theory Pub Date : 2019-08-12 DOI: 10.1007/978-3-030-25027-0_16
Bireswar Das, Shivdutt Sharma, P. R. Vaidyanathan
{"title":"Succinct Representations of Finite Groups","authors":"Bireswar Das, Shivdutt Sharma, P. R. Vaidyanathan","doi":"10.1007/978-3-030-25027-0_16","DOIUrl":"https://doi.org/10.1007/978-3-030-25027-0_16","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115708764","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
Computing Digraph Width Measures on Directed Co-graphs - (Extended Abstract) 计算有向图上的有向图宽度测度-(扩展摘要)
International Symposium on Fundamentals of Computation Theory Pub Date : 2019-08-12 DOI: 10.1007/978-3-030-25027-0_20
Frank Gurski, Dominique Komander, Carolin Rehs
{"title":"Computing Digraph Width Measures on Directed Co-graphs - (Extended Abstract)","authors":"Frank Gurski, Dominique Komander, Carolin Rehs","doi":"10.1007/978-3-030-25027-0_20","DOIUrl":"https://doi.org/10.1007/978-3-030-25027-0_20","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122895458","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
Maximum rectilinear convex subsets 最大直线凸子集
International Symposium on Fundamentals of Computation Theory Pub Date : 2019-07-17 DOI: 10.1137/19M1303010
H. González-Aguilar, David Orden, P. Pérez-Lantero, D. Rappaport, C. Seara, J. Tejel, J. Urrutia
{"title":"Maximum rectilinear convex subsets","authors":"H. González-Aguilar, David Orden, P. Pérez-Lantero, D. Rappaport, C. Seara, J. Tejel, J. Urrutia","doi":"10.1137/19M1303010","DOIUrl":"https://doi.org/10.1137/19M1303010","url":null,"abstract":"Let $P$ be a set of $n$ points in the plane. We consider a variation of the classical Erdős-Szekeres problem, presenting efficient algorithms with $O(n^3)$ running time and $O(n^2)$ space complexity that compute: (1) A subset $S$ of $P$ such that the boundary of the rectilinear convex hull of $S$ has the maximum number of points from $P$, (2) a subset $S$ of $P$ such that the boundary of the rectilinear convex hull of $S$ has the maximum number of points from $P$ and its interior contains no element of $P$, (3) a subset $S$ of $P$ such that the rectilinear convex hull of $S$ has maximum area and its interior contains no element of $P$, and (4) when each point of $P$ is assigned a weight, positive or negative, a subset $S$ of $P$ that maximizes the total weight of the points in the rectilinear convex hull of $S$.","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129194406","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
Circular Pattern Matching with k Mismatches 有k个错配的圆形图案匹配
International Symposium on Fundamentals of Computation Theory Pub Date : 2019-07-03 DOI: 10.1007/978-3-030-25027-0_15
P. Charalampopoulos, T. Kociumaka, S. Pissis, J. Radoszewski, W. Rytter, Juliusz Straszynski, Tomasz Waleń, Wiktor Zuba
{"title":"Circular Pattern Matching with k Mismatches","authors":"P. Charalampopoulos, T. Kociumaka, S. Pissis, J. Radoszewski, W. Rytter, Juliusz Straszynski, Tomasz Waleń, Wiktor Zuba","doi":"10.1007/978-3-030-25027-0_15","DOIUrl":"https://doi.org/10.1007/978-3-030-25027-0_15","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129299136","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
Space Efficient Algorithms for Breadth-Depth Search 宽度深度搜索的空间高效算法
International Symposium on Fundamentals of Computation Theory Pub Date : 2019-06-19 DOI: 10.1007/978-3-030-25027-0_14
Sankardeep Chakraborty, A. Mukherjee, S. Rao
{"title":"Space Efficient Algorithms for Breadth-Depth Search","authors":"Sankardeep Chakraborty, A. Mukherjee, S. Rao","doi":"10.1007/978-3-030-25027-0_14","DOIUrl":"https://doi.org/10.1007/978-3-030-25027-0_14","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122591854","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
An Efficient Algorithm for the Fast Delivery Problem 快速交货问题的一种高效算法
International Symposium on Fundamentals of Computation Theory Pub Date : 2019-04-19 DOI: 10.1007/978-3-030-25027-0_12
I. Carvalho, T. Erlebach, Kleitos Papadopoulos
{"title":"An Efficient Algorithm for the Fast Delivery Problem","authors":"I. Carvalho, T. Erlebach, Kleitos Papadopoulos","doi":"10.1007/978-3-030-25027-0_12","DOIUrl":"https://doi.org/10.1007/978-3-030-25027-0_12","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"04 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131012159","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
Deterministic Preparation of Dicke States 迪克状态的确定性准备
International Symposium on Fundamentals of Computation Theory Pub Date : 2019-04-15 DOI: 10.1007/978-3-030-25027-0_9
Andreas Bärtschi, S. Eidenbenz
{"title":"Deterministic Preparation of Dicke States","authors":"Andreas Bärtschi, S. Eidenbenz","doi":"10.1007/978-3-030-25027-0_9","DOIUrl":"https://doi.org/10.1007/978-3-030-25027-0_9","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"2017 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114788262","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}
引用次数: 77
Two-Sided Matching Markets with Strongly Correlated Preferences 具有强相关偏好的双边匹配市场
International Symposium on Fundamentals of Computation Theory Pub Date : 2019-04-08 DOI: 10.1007/978-3-030-86593-1_1
H. Gimbert, Claire Mathieu, Simon Mauras
{"title":"Two-Sided Matching Markets with Strongly Correlated Preferences","authors":"H. Gimbert, Claire Mathieu, Simon Mauras","doi":"10.1007/978-3-030-86593-1_1","DOIUrl":"https://doi.org/10.1007/978-3-030-86593-1_1","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128775104","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
首页 上一页 下一页 尾页
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学术官方微信