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

Computer Science Symposium in Russia最新文献

筛选
英文 中文
On rooted k-connectivity problems in quasi-bipartite digraphs 拟二部有向图的根k-连通性问题
Computer Science Symposium in Russia Pub Date : 2020-09-21 DOI: 10.1007/978-3-030-79416-3_20
Zeev Nutov
{"title":"On rooted k-connectivity problems in quasi-bipartite digraphs","authors":"Zeev Nutov","doi":"10.1007/978-3-030-79416-3_20","DOIUrl":"https://doi.org/10.1007/978-3-030-79416-3_20","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130450859","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
Dynamic Complexity of Expansion 展开的动态复杂性
Computer Science Symposium in Russia Pub Date : 2020-08-13 DOI: 10.1007/978-3-030-79416-3_4
Samir Datta, Anuj Tawari, Y. Vasudev
{"title":"Dynamic Complexity of Expansion","authors":"Samir Datta, Anuj Tawari, Y. Vasudev","doi":"10.1007/978-3-030-79416-3_4","DOIUrl":"https://doi.org/10.1007/978-3-030-79416-3_4","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126810675","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
Lower Bounds and Hardness Magnification for Sublinear-Time Shrinking Cellular Automata 次线性时间收缩元胞自动机的下界和硬度放大
Computer Science Symposium in Russia Pub Date : 2020-07-23 DOI: 10.1007/978-3-030-79416-3_18
Augusto Modanese
{"title":"Lower Bounds and Hardness Magnification for Sublinear-Time Shrinking Cellular Automata","authors":"Augusto Modanese","doi":"10.1007/978-3-030-79416-3_18","DOIUrl":"https://doi.org/10.1007/978-3-030-79416-3_18","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130091104","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
Definable Subsets of Polynomial-Time Algebraic Structures 多项式时间代数结构的可定义子集
Computer Science Symposium in Russia Pub Date : 2020-06-29 DOI: 10.1007/978-3-030-50026-9_10
N. Bazhenov
{"title":"Definable Subsets of Polynomial-Time Algebraic Structures","authors":"N. Bazhenov","doi":"10.1007/978-3-030-50026-9_10","DOIUrl":"https://doi.org/10.1007/978-3-030-50026-9_10","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116455272","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
A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels 压缩层次结构和枢纽标签查询阶段的下界
Computer Science Symposium in Russia Pub Date : 2020-06-29 DOI: 10.1007/978-3-030-50026-9_26
Tobias Rupp, S. Funke
{"title":"A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels","authors":"Tobias Rupp, S. Funke","doi":"10.1007/978-3-030-50026-9_26","DOIUrl":"https://doi.org/10.1007/978-3-030-50026-9_26","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123910168","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
On Subquadratic Derivational Complexity of Semi-Thue Systems 半虚系统的次二次导数复杂度
Computer Science Symposium in Russia Pub Date : 2020-06-29 DOI: 10.1007/978-3-030-50026-9_28
A. Talambutsa
{"title":"On Subquadratic Derivational Complexity of Semi-Thue Systems","authors":"A. Talambutsa","doi":"10.1007/978-3-030-50026-9_28","DOIUrl":"https://doi.org/10.1007/978-3-030-50026-9_28","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131719926","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
Central Positions in Social Networks 社交网络中的中心位置
Computer Science Symposium in Russia Pub Date : 2020-06-29 DOI: 10.1007/978-3-030-50026-9_3
U. Brandes
{"title":"Central Positions in Social Networks","authors":"U. Brandes","doi":"10.1007/978-3-030-50026-9_3","DOIUrl":"https://doi.org/10.1007/978-3-030-50026-9_3","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133885254","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
Faster 2-Disjoint-Shortest-Paths Algorithm 更快的2-不相交最短路径算法
Computer Science Symposium in Russia Pub Date : 2020-06-29 DOI: 10.1007/978-3-030-50026-9_7
M. Akhmedov
{"title":"Faster 2-Disjoint-Shortest-Paths Algorithm","authors":"M. Akhmedov","doi":"10.1007/978-3-030-50026-9_7","DOIUrl":"https://doi.org/10.1007/978-3-030-50026-9_7","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129326273","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
Isomorphic Distances Among Elections 选举中的同构距离
Computer Science Symposium in Russia Pub Date : 2020-06-29 DOI: 10.1007/978-3-030-50026-9_5
P. Faliszewski, P. Skowron, A. Slinko, Stanislaw Szufa, Nimrod Talmon
{"title":"Isomorphic Distances Among Elections","authors":"P. Faliszewski, P. Skowron, A. Slinko, Stanislaw Szufa, Nimrod Talmon","doi":"10.1007/978-3-030-50026-9_5","DOIUrl":"https://doi.org/10.1007/978-3-030-50026-9_5","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131819798","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
The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters 通过更换候选人或选民来控制孔多塞、后退和k-否决选举的复杂性
Computer Science Symposium in Russia Pub Date : 2020-06-29 DOI: 10.1007/978-3-030-50026-9_23
Marc Neveling, J. Rothe, Roman Zorn
{"title":"The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters","authors":"Marc Neveling, J. Rothe, Roman Zorn","doi":"10.1007/978-3-030-50026-9_23","DOIUrl":"https://doi.org/10.1007/978-3-030-50026-9_23","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122354904","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
首页 上一页 下一页 尾页
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学术官方微信