首页 > 最新文献

Computer Science Symposium in Russia最新文献

英文 中文
On High-Quality Synthesis 关于高质量合成
Computer Science Symposium in Russia
Pub Date : 2016-06-09 DOI: 10.1007/978-3-319-34171-2_1
O. Kupferman
{"title":"On High-Quality Synthesis","authors":"O. Kupferman","doi":"10.1007/978-3-319-34171-2_1","DOIUrl":"https://doi.org/10.1007/978-3-319-34171-2_1","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121158846","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
Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems 最小代价连通性增强问题的改进逼近算法
Computer Science Symposium in Russia
Pub Date : 2016-06-09 DOI: 10.1007/978-3-319-34171-2_23
Zeev Nutov
{"title":"Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems","authors":"Zeev Nutov","doi":"10.1007/978-3-319-34171-2_23","DOIUrl":"https://doi.org/10.1007/978-3-319-34171-2_23","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"300 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115940840","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
The Hardest Language for Conjunctive Grammars 最难的连接语法语言
Computer Science Symposium in Russia
Pub Date : 2016-06-09 DOI: 10.1007/978-3-319-34171-2_24
A. Okhotin
{"title":"The Hardest Language for Conjunctive Grammars","authors":"A. Okhotin","doi":"10.1007/978-3-319-34171-2_24","DOIUrl":"https://doi.org/10.1007/978-3-319-34171-2_24","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128779227","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
Affine Computation and Affine Automaton 仿射计算与仿射自动机
Computer Science Symposium in Russia
Pub Date : 2016-02-15 DOI: 10.1007/978-3-319-34171-2_11
Alejandro Díaz-Caro, A. Yakaryılmaz
{"title":"Affine Computation and Affine Automaton","authors":"Alejandro Díaz-Caro, A. Yakaryılmaz","doi":"10.1007/978-3-319-34171-2_11","DOIUrl":"https://doi.org/10.1007/978-3-319-34171-2_11","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127185250","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}
引用次数: 15
Representations of Analytic Functions and Weihrauch Degrees 解析函数的表示与魏氏度
Computer Science Symposium in Russia
Pub Date : 2015-12-09 DOI: 10.1007/978-3-319-34171-2_26
A. Pauly, Florian Steinberg
{"title":"Representations of Analytic Functions and Weihrauch Degrees","authors":"A. Pauly, Florian Steinberg","doi":"10.1007/978-3-319-34171-2_26","DOIUrl":"https://doi.org/10.1007/978-3-319-34171-2_26","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121314249","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
Low-Rank Approximation of a Matrix: Novel Insights, New Progress, and Extensions 矩阵的低秩逼近:新见解、新进展和扩展
Computer Science Symposium in Russia
Pub Date : 2015-10-21 DOI: 10.1007/978-3-319-34171-2_25
V. Pan, Liang Zhao
{"title":"Low-Rank Approximation of a Matrix: Novel Insights, New Progress, and Extensions","authors":"V. Pan, Liang Zhao","doi":"10.1007/978-3-319-34171-2_25","DOIUrl":"https://doi.org/10.1007/978-3-319-34171-2_25","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"232 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124287293","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}
引用次数: 15
An In-Place Priority Queue with O(1) Time for Push and lg n + O ( 1 ) Comparisons for Pop 一个具有O(1) Push时间和lgn + O(1) Pop比较时间的本地优先队列
Computer Science Symposium in Russia
Pub Date : 2015-07-13 DOI: 10.1007/978-3-319-20297-6_14
S. Edelkamp, Amr Elmasry, J. Katajainen
{"title":"An In-Place Priority Queue with O(1) Time for Push and lg n + O ( 1 ) Comparisons for Pop","authors":"S. Edelkamp, Amr Elmasry, J. Katajainen","doi":"10.1007/978-3-319-20297-6_14","DOIUrl":"https://doi.org/10.1007/978-3-319-20297-6_14","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"36 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120832036","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
First-Order Logic Definability of Free Languages 自由语言的一阶逻辑可定义性
Computer Science Symposium in Russia
Pub Date : 2015-07-13 DOI: 10.1007/978-3-319-20297-6_20
Violetta Lonati, D. Mandrioli, Federica Panella, Matteo Pradella
{"title":"First-Order Logic Definability of Free Languages","authors":"Violetta Lonati, D. Mandrioli, Federica Panella, Matteo Pradella","doi":"10.1007/978-3-319-20297-6_20","DOIUrl":"https://doi.org/10.1007/978-3-319-20297-6_20","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116164700","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
Automath Type Inclusion in Barendregt's Cube 自动类型包含在Barendregt的立方体
Computer Science Symposium in Russia
Pub Date : 2015-07-13 DOI: 10.1007/978-3-319-20297-6_17
Fairouz Kamareddine, J. Wells, D. Ventura
{"title":"Automath Type Inclusion in Barendregt's Cube","authors":"Fairouz Kamareddine, J. Wells, D. Ventura","doi":"10.1007/978-3-319-20297-6_17","DOIUrl":"https://doi.org/10.1007/978-3-319-20297-6_17","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128180193","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
Circuit Lower Bounds for Average-Case MA 平均情况MA的电路下界
Computer Science Symposium in Russia
Pub Date : 2015-07-13 DOI: 10.1007/978-3-319-20297-6_18
Alexander Knop
{"title":"Circuit Lower Bounds for Average-Case MA","authors":"Alexander Knop","doi":"10.1007/978-3-319-20297-6_18","DOIUrl":"https://doi.org/10.1007/978-3-319-20297-6_18","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130145367","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
首页 上一页
类型
全部 化学•材料 生命科学 医学 物理 工程技术 环境•农林 材料科学 地球科学 法学 管理学 化学 环境科学与生态学 计算机科学 教育学 经济学 农林科学 人文科学 生物学 数学 物理与天体物理 心理学 综合性期刊 其他 工业工程 理学 历史学 农学 文学 信息工程
数据库
全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley
期刊
Computer Science Symposium in Russia
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
﹀
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们：info@booksci.cn
Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1