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

International Symposium on Fundamentals of Computation Theory最新文献

筛选
英文 中文
One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata 在小而快速的双向有限自动机中，一个交替可能比随机化更强大
International Symposium on Fundamentals of Computation Theory Pub Date : 2013-08-19 DOI: 10.1007/978-3-642-40164-0_7
K. Balodis
{"title":"One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata","authors":"K. Balodis","doi":"10.1007/978-3-642-40164-0_7","DOIUrl":"https://doi.org/10.1007/978-3-642-40164-0_7","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130569803","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
Together or Separate? Algorithmic Aggregation Problems 一起还是分开?算法聚合问题
International Symposium on Fundamentals of Computation Theory Pub Date : 2013-08-19 DOI: 10.1007/978-3-642-40164-0_1
M. Chrobak
{"title":"Together or Separate? Algorithmic Aggregation Problems","authors":"M. Chrobak","doi":"10.1007/978-3-642-40164-0_1","DOIUrl":"https://doi.org/10.1007/978-3-642-40164-0_1","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125350512","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
An Axiomatization of the Theory of Generalized Ultrametric Semilattices of Linear Signals 线性信号广义超度量半格理论的公理化
International Symposium on Fundamentals of Computation Theory Pub Date : 2013-08-19 DOI: 10.1007/978-3-642-40164-0_24
E. Matsikoudis, Edward A. Lee
{"title":"An Axiomatization of the Theory of Generalized Ultrametric Semilattices of Linear Signals","authors":"E. Matsikoudis, Edward A. Lee","doi":"10.1007/978-3-642-40164-0_24","DOIUrl":"https://doi.org/10.1007/978-3-642-40164-0_24","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130478327","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
Approximation Algorithms for the Antenna Orientation Problem 天线定向问题的近似算法
International Symposium on Fundamentals of Computation Theory Pub Date : 2013-08-19 DOI: 10.1007/978-3-642-40164-0_22
E. Kranakis, Fraser MacQuarie, Oscar Morales-Ponce
{"title":"Approximation Algorithms for the Antenna Orientation Problem","authors":"E. Kranakis, Fraser MacQuarie, Oscar Morales-Ponce","doi":"10.1007/978-3-642-40164-0_22","DOIUrl":"https://doi.org/10.1007/978-3-642-40164-0_22","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116572689","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
On the Average Size of Glushkov and Equation Automata for KAT Expressions 关于KAT表达式的Glushkov和方程自动机的平均大小
International Symposium on Fundamentals of Computation Theory Pub Date : 2013-08-19 DOI: 10.1007/978-3-642-40164-0_10
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
{"title":"On the Average Size of Glushkov and Equation Automata for KAT Expressions","authors":"Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis","doi":"10.1007/978-3-642-40164-0_10","DOIUrl":"https://doi.org/10.1007/978-3-642-40164-0_10","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125440906","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
Real-Time Vector Automata 实时矢量自动机
International Symposium on Fundamentals of Computation Theory Pub Date : 2013-03-25 DOI: 10.1007/978-3-642-40164-0_28
Özlem Salehi, A. Yakaryılmaz, A. Say
{"title":"Real-Time Vector Automata","authors":"Özlem Salehi, A. Yakaryılmaz, A. Say","doi":"10.1007/978-3-642-40164-0_28","DOIUrl":"https://doi.org/10.1007/978-3-642-40164-0_28","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128654885","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
Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks 均匀功率自组织无线网络中的分布式确定性广播
International Symposium on Fundamentals of Computation Theory Pub Date : 2013-02-17 DOI: 10.1007/978-3-642-40164-0_20
T. Jurdzinski, D. Kowalski, Grzegorz Stachowiak
{"title":"Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks","authors":"T. Jurdzinski, D. Kowalski, Grzegorz Stachowiak","doi":"10.1007/978-3-642-40164-0_20","DOIUrl":"https://doi.org/10.1007/978-3-642-40164-0_20","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114522651","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}
引用次数: 36
Parameterized Complexity of Weak Odd Domination Problems 弱奇控制问题的参数化复杂度
International Symposium on Fundamentals of Computation Theory Pub Date : 2012-06-18 DOI: 10.1007/978-3-642-40164-0_13
D. Cattanéo, S. Perdrix
{"title":"Parameterized Complexity of Weak Odd Domination Problems","authors":"D. Cattanéo, S. Perdrix","doi":"10.1007/978-3-642-40164-0_13","DOIUrl":"https://doi.org/10.1007/978-3-642-40164-0_13","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121406532","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
Edge-matching Problems with Rotations 旋转的边缘匹配问题
International Symposium on Fundamentals of Computation Theory Pub Date : 2011-08-22 DOI: 10.1007/978-3-642-22953-4_10
Martin Ebbesen, P. Fischer, C. Witt
{"title":"Edge-matching Problems with Rotations","authors":"Martin Ebbesen, P. Fischer, C. Witt","doi":"10.1007/978-3-642-22953-4_10","DOIUrl":"https://doi.org/10.1007/978-3-642-22953-4_10","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115632030","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
Enumeration of Minimal Dominating Sets and Variants 极小支配集及其变体的枚举
International Symposium on Fundamentals of Computation Theory Pub Date : 2011-08-22 DOI: 10.1007/978-3-642-22953-4_26
M. Kanté, V. Limouzy, A. Mary, Lhouari Nourine
{"title":"Enumeration of Minimal Dominating Sets and Variants","authors":"M. Kanté, V. Limouzy, A. Mary, Lhouari Nourine","doi":"10.1007/978-3-642-22953-4_26","DOIUrl":"https://doi.org/10.1007/978-3-642-22953-4_26","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129247441","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}
引用次数: 45
首页 上一页 下一页 尾页
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学术官方微信