首页 > 最新文献

Computer Science Symposium in Russia最新文献

英文 中文
The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in $${{mathsf {T}}}{{mathsf {C}}}^0$$ 讨论了自由可解群与阿贝尔群环积的共轭问题 $${{mathsf {T}}}{{mathsf {C}}}^0$$
Pub Date : 2017-06-08 DOI: 10.1007/978-3-319-58747-9_20
A. Myasnikov, S. Vassileva, A. Weiss
{"title":"The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in $${{mathsf {T}}}{{mathsf {C}}}^0$$","authors":"A. Myasnikov, S. Vassileva, A. Weiss","doi":"10.1007/978-3-319-58747-9_20","DOIUrl":"https://doi.org/10.1007/978-3-319-58747-9_20","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130533974","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 Transformation Monoid of a Partially Lossy Queue 部分有损队列的变换独阵
Pub Date : 2017-06-08 DOI: 10.1007/978-3-319-58747-9_18
Chris Köcher, D. Kuske
{"title":"The Transformation Monoid of a Partially Lossy Queue","authors":"Chris Köcher, D. Kuske","doi":"10.1007/978-3-319-58747-9_18","DOIUrl":"https://doi.org/10.1007/978-3-319-58747-9_18","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132223752","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
Can We Locally Compute Sparse Connected Subgraphs? 我们能局部计算稀疏连通子图吗?
Pub Date : 2017-06-08 DOI: 10.1007/978-3-319-58747-9_6
R. Rubinfeld
{"title":"Can We Locally Compute Sparse Connected Subgraphs?","authors":"R. Rubinfeld","doi":"10.1007/978-3-319-58747-9_6","DOIUrl":"https://doi.org/10.1007/978-3-319-58747-9_6","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114604191","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
Edit Distance Neighbourhoods of Input-Driven Pushdown Automata 编辑输入驱动下推自动机的距离邻域
Pub Date : 2017-06-08 DOI: 10.1007/978-3-319-58747-9_23
A. Okhotin, K. Salomaa
{"title":"Edit Distance Neighbourhoods of Input-Driven Pushdown Automata","authors":"A. Okhotin, K. Salomaa","doi":"10.1007/978-3-319-58747-9_23","DOIUrl":"https://doi.org/10.1007/978-3-319-58747-9_23","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129368535","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
Verification of Quantum Computation and the Price of Trust 量子计算的验证与信任的代价
Pub Date : 2017-06-08 DOI: 10.1007/978-3-319-58747-9_3
A. Gheorghiu, Theodoros Kapourniotis, Elham Kashefi
{"title":"Verification of Quantum Computation and the Price of Trust","authors":"A. Gheorghiu, Theodoros Kapourniotis, Elham Kashefi","doi":"10.1007/978-3-319-58747-9_3","DOIUrl":"https://doi.org/10.1007/978-3-319-58747-9_3","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128784269","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
Graph Sketching and Streaming: New Approaches for Analyzing Massive Graphs 图形素描和流:分析海量图形的新方法
Pub Date : 2017-06-08 DOI: 10.1007/978-3-319-58747-9_4
A. Mcgregor
{"title":"Graph Sketching and Streaming: New Approaches for Analyzing Massive Graphs","authors":"A. Mcgregor","doi":"10.1007/978-3-319-58747-9_4","DOIUrl":"https://doi.org/10.1007/978-3-319-58747-9_4","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125658297","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
Dynamic Stabbing Queries with Sub-logarithmic Local Updates for Overlapping Intervals 具有次对数局部更新的重叠区间动态刺入查询
Pub Date : 2017-06-08 DOI: 10.1007/978-3-319-58747-9_17
Elena Khramtcova, M. Löffler
{"title":"Dynamic Stabbing Queries with Sub-logarithmic Local Updates for Overlapping Intervals","authors":"Elena Khramtcova, M. Löffler","doi":"10.1007/978-3-319-58747-9_17","DOIUrl":"https://doi.org/10.1007/978-3-319-58747-9_17","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134010471","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
On Probabilistic Algorithm for Solving Almost All Instances of the Set Partition Problem 求解集划分问题几乎所有实例的概率算法
Pub Date : 2017-06-08 DOI: 10.1007/978-3-319-58747-9_25
A. Seliverstov
{"title":"On Probabilistic Algorithm for Solving Almost All Instances of the Set Partition Problem","authors":"A. Seliverstov","doi":"10.1007/978-3-319-58747-9_25","DOIUrl":"https://doi.org/10.1007/978-3-319-58747-9_25","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121806492","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
Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets 串并联序集中线性扩展的熵均匀抽样
Pub Date : 2017-06-08 DOI: 10.1007/978-3-319-58747-9_9
O. Bodini, M. Dien, Antoine Genitrini, F. Peschanski
{"title":"Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets","authors":"O. Bodini, M. Dien, Antoine Genitrini, F. Peschanski","doi":"10.1007/978-3-319-58747-9_9","DOIUrl":"https://doi.org/10.1007/978-3-319-58747-9_9","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116352613","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
Concatenation Hierarchies: New Bottle, Old Wine 级配等级:新瓶,陈酒
Pub Date : 2017-06-08 DOI: 10.1007/978-3-319-58747-9_5
Thomas Place, M. Zeitoun
{"title":"Concatenation Hierarchies: New Bottle, Old Wine","authors":"Thomas Place, M. Zeitoun","doi":"10.1007/978-3-319-58747-9_5","DOIUrl":"https://doi.org/10.1007/978-3-319-58747-9_5","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125091602","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
期刊
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