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

International Symposium on Fundamentals of Computation Theory最新文献

筛选
英文 中文
Decidable Weighted Expressions with Presburger Combinators 具有Presburger组合子的可决定加权表达式
International Symposium on Fundamentals of Computation Theory Pub Date : 2017-06-27 DOI: 10.1007/978-3-662-55751-8_20
E. Filiot, Nicolas Mazzocchi, Jean-François Raskin
{"title":"Decidable Weighted Expressions with Presburger Combinators","authors":"E. Filiot, Nicolas Mazzocchi, Jean-François Raskin","doi":"10.1007/978-3-662-55751-8_20","DOIUrl":"https://doi.org/10.1007/978-3-662-55751-8_20","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125125580","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
Busy Beaver Scores and Alphabet Size 繁忙的海狸分数和字母大小
International Symposium on Fundamentals of Computation Theory Pub Date : 2017-04-27 DOI: 10.1007/978-3-662-55751-8_32
H. Petersen
{"title":"Busy Beaver Scores and Alphabet Size","authors":"H. Petersen","doi":"10.1007/978-3-662-55751-8_32","DOIUrl":"https://doi.org/10.1007/978-3-662-55751-8_32","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114400310","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
Parameterized Aspects of Triangle Enumeration 三角枚举的参数化方面
International Symposium on Fundamentals of Computation Theory Pub Date : 2017-02-21 DOI: 10.1007/978-3-662-55751-8_9
M. Bentert, T. Fluschnik, A. Nichterlein, R. Niedermeier
{"title":"Parameterized Aspects of Triangle Enumeration","authors":"M. Bentert, T. Fluschnik, A. Nichterlein, R. Niedermeier","doi":"10.1007/978-3-662-55751-8_9","DOIUrl":"https://doi.org/10.1007/978-3-662-55751-8_9","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132669404","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}
引用次数: 21
Automatic Kolmogorov Complexity and Normality Revisited 重新审视自动Kolmogorov复杂性和常态性
International Symposium on Fundamentals of Computation Theory Pub Date : 2017-01-31 DOI: 10.1007/978-3-662-55751-8_33
A. Shen
{"title":"Automatic Kolmogorov Complexity and Normality Revisited","authors":"A. Shen","doi":"10.1007/978-3-662-55751-8_33","DOIUrl":"https://doi.org/10.1007/978-3-662-55751-8_33","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123412384","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
Polynomial-Time Algorithms for the Subset Feedback Vertex Set Problem on Interval Graphs and Permutation Graphs 区间图和置换图上子集反馈顶点集问题的多项式时间算法
International Symposium on Fundamentals of Computation Theory Pub Date : 2017-01-17 DOI: 10.1007/978-3-662-55751-8_30
Charis Papadopoulos, Spyridon Tzimas
{"title":"Polynomial-Time Algorithms for the Subset Feedback Vertex Set Problem on Interval Graphs and Permutation Graphs","authors":"Charis Papadopoulos, Spyridon Tzimas","doi":"10.1007/978-3-662-55751-8_30","DOIUrl":"https://doi.org/10.1007/978-3-662-55751-8_30","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124122074","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}
引用次数: 17
Determinism and Computational Power of Real Measurement-Based Quantum Computation 基于实际测量的量子计算的确定性和计算能力
International Symposium on Fundamentals of Computation Theory Pub Date : 2016-10-10 DOI: 10.1007/978-3-662-55751-8_31
S. Perdrix, L. Sanselme
{"title":"Determinism and Computational Power of Real Measurement-Based Quantum Computation","authors":"S. Perdrix, L. Sanselme","doi":"10.1007/978-3-662-55751-8_31","DOIUrl":"https://doi.org/10.1007/978-3-662-55751-8_31","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"582 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115825097","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
Longest α-Gapped Repeat and Palindrome 最长α-间隙重复和回文
International Symposium on Fundamentals of Computation Theory Pub Date : 2015-08-17 DOI: 10.1007/978-3-319-22177-9_3
Paweł Gawrychowski, F. Manea
{"title":"Longest α-Gapped Repeat and Palindrome","authors":"Paweł Gawrychowski, F. Manea","doi":"10.1007/978-3-319-22177-9_3","DOIUrl":"https://doi.org/10.1007/978-3-319-22177-9_3","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"225 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117181221","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
Recurring Comparison Faults: Sorting and Finding the Minimum 反复出现的比较错误:排序和查找最小值
International Symposium on Fundamentals of Computation Theory Pub Date : 2015-08-17 DOI: 10.1007/978-3-319-22177-9_18
Barbara Geissmann, Matús Mihalák, P. Widmayer
{"title":"Recurring Comparison Faults: Sorting and Finding the Minimum","authors":"Barbara Geissmann, Matús Mihalák, P. Widmayer","doi":"10.1007/978-3-319-22177-9_18","DOIUrl":"https://doi.org/10.1007/978-3-319-22177-9_18","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123368470","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
Block Representation of Reversible Causal Graph Dynamics 可逆因果图动力学的块表示
International Symposium on Fundamentals of Computation Theory Pub Date : 2015-08-17 DOI: 10.1007/978-3-319-22177-9_27
P. Arrighi, S. Martiel, S. Perdrix
{"title":"Block Representation of Reversible Causal Graph Dynamics","authors":"P. Arrighi, S. Martiel, S. Perdrix","doi":"10.1007/978-3-319-22177-9_27","DOIUrl":"https://doi.org/10.1007/978-3-319-22177-9_27","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127738259","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
Privacy in Elections: k-Anonymizing Preference Orders 选举中的隐私:k-匿名偏好命令
International Symposium on Fundamentals of Computation Theory Pub Date : 2015-08-17 DOI: 10.1007/978-3-319-22177-9_23
Nimrod Talmon
{"title":"Privacy in Elections: k-Anonymizing Preference Orders","authors":"Nimrod Talmon","doi":"10.1007/978-3-319-22177-9_23","DOIUrl":"https://doi.org/10.1007/978-3-319-22177-9_23","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134073371","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
首页 上一页 下一页 尾页
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学术官方微信