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

International Symposium on Fundamentals of Computation Theory最新文献

筛选
英文 中文
Incremental Complexity of a Bi-objective Hypergraph Transversal Problem 一类双目标超图截线问题的增量复杂度
International Symposium on Fundamentals of Computation Theory Pub Date : 2015-05-22 DOI: 10.1007/978-3-319-22177-9_16
Ricardo Andrade, E. Birmelé, A. Mary, Thomas Picchetti, M. Sagot
{"title":"Incremental Complexity of a Bi-objective Hypergraph Transversal Problem","authors":"Ricardo Andrade, E. Birmelé, A. Mary, Thomas Picchetti, M. Sagot","doi":"10.1007/978-3-319-22177-9_16","DOIUrl":"https://doi.org/10.1007/978-3-319-22177-9_16","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121054244","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
Interprocedural Reachability for Flat Integer Programs 平面整数程序的过程间可达性
International Symposium on Fundamentals of Computation Theory Pub Date : 2014-05-13 DOI: 10.1007/978-3-319-22177-9_11
P. Ganty, Radu Iosif
{"title":"Interprocedural Reachability for Flat Integer Programs","authors":"P. Ganty, Radu Iosif","doi":"10.1007/978-3-319-22177-9_11","DOIUrl":"https://doi.org/10.1007/978-3-319-22177-9_11","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"324 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132867370","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
The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design 具有共同到达和截止日期的懒惰官僚问题:近似和机制设计
International Symposium on Fundamentals of Computation Theory Pub Date : 2013-08-19 DOI: 10.1007/978-3-642-40164-0_18
L. Gourvès, J. Monnot, Aris Pagourtzis
{"title":"The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design","authors":"L. Gourvès, J. Monnot, Aris Pagourtzis","doi":"10.1007/978-3-642-40164-0_18","DOIUrl":"https://doi.org/10.1007/978-3-642-40164-0_18","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"18 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":"123874643","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
Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs 二部布尔二次规划算法的支配分析
International Symposium on Fundamentals of Computation Theory Pub Date : 2013-08-19 DOI: 10.1007/978-3-642-40164-0_26
Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan
{"title":"Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs","authors":"Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan","doi":"10.1007/978-3-642-40164-0_26","DOIUrl":"https://doi.org/10.1007/978-3-642-40164-0_26","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"65 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":"124596003","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
Guarding Thin Orthogonal Polygons Is Hard 保护薄正交多边形是困难的
International Symposium on Fundamentals of Computation Theory Pub Date : 2013-08-19 DOI: 10.1007/978-3-642-40164-0_29
Ana Paula Tomás
{"title":"Guarding Thin Orthogonal Polygons Is Hard","authors":"Ana Paula Tomás","doi":"10.1007/978-3-642-40164-0_29","DOIUrl":"https://doi.org/10.1007/978-3-642-40164-0_29","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"120 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":"121324176","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}
引用次数: 14
A Formal Framework for Property-Driven Obfuscation Strategies 属性驱动混淆策略的正式框架
International Symposium on Fundamentals of Computation Theory Pub Date : 2013-08-19 DOI: 10.1007/978-3-642-40164-0_15
M. Preda, Isabella Mastroeni, R. Giacobazzi
{"title":"A Formal Framework for Property-Driven Obfuscation Strategies","authors":"M. Preda, Isabella Mastroeni, R. Giacobazzi","doi":"10.1007/978-3-642-40164-0_15","DOIUrl":"https://doi.org/10.1007/978-3-642-40164-0_15","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"81 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":"129345406","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
On the Isomorphism Problem for Decision Trees and Decision Lists 决策树与决策表的同构问题
International Symposium on Fundamentals of Computation Theory Pub Date : 2013-08-19 DOI: 10.1007/978-3-642-40164-0_5
V. Arvind, J. Köbler, Sebastian Kuhnert, Gaurav Rattan, Y. Vasudev
{"title":"On the Isomorphism Problem for Decision Trees and Decision Lists","authors":"V. Arvind, J. Köbler, Sebastian Kuhnert, Gaurav Rattan, Y. Vasudev","doi":"10.1007/978-3-642-40164-0_5","DOIUrl":"https://doi.org/10.1007/978-3-642-40164-0_5","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"34 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":"122393564","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
Groups with a Recursively Enumerable Irreducible Word Problem 具有递归可数不可约字问题的群
International Symposium on Fundamentals of Computation Theory Pub Date : 2013-08-19 DOI: 10.1007/978-3-642-40164-0_27
Gabriela Asli Rino Nesin, R. Thomas
{"title":"Groups with a Recursively Enumerable Irreducible Word Problem","authors":"Gabriela Asli Rino Nesin, R. Thomas","doi":"10.1007/978-3-642-40164-0_27","DOIUrl":"https://doi.org/10.1007/978-3-642-40164-0_27","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"362 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":"124558957","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
Improved Approximation Algorithms for Constrained Fault-Tolerant Resource Allocation - (Extended Abstract) 约束容错资源分配的改进逼近算法(扩展摘要)
International Symposium on Fundamentals of Computation Theory Pub Date : 2013-08-19 DOI: 10.1007/978-3-642-40164-0_23
Kewen Liao, Hong Shen, Longkun Guo
{"title":"Improved Approximation Algorithms for Constrained Fault-Tolerant Resource Allocation - (Extended Abstract)","authors":"Kewen Liao, Hong Shen, Longkun Guo","doi":"10.1007/978-3-642-40164-0_23","DOIUrl":"https://doi.org/10.1007/978-3-642-40164-0_23","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"57 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":"128752047","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
Randomized Distributed Decision (Invited Lecture Abstract) 随机分布决策(特邀讲座摘要)
International Symposium on Fundamentals of Computation Theory Pub Date : 2013-08-19 DOI: 10.1007/978-3-642-40164-0_3
D. Peleg
{"title":"Randomized Distributed Decision (Invited Lecture Abstract)","authors":"D. Peleg","doi":"10.1007/978-3-642-40164-0_3","DOIUrl":"https://doi.org/10.1007/978-3-642-40164-0_3","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"42 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":"116962429","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学术官方微信