Pub Date : 2018-10-27DOI: 10.1007/978-3-030-19955-5_12
Kshitij Gajjar, J. Radhakrishnan
{"title":"Minimizing Branching Vertices in Distance-preserving Subgraphs","authors":"Kshitij Gajjar, J. Radhakrishnan","doi":"10.1007/978-3-030-19955-5_12","DOIUrl":"https://doi.org/10.1007/978-3-030-19955-5_12","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134304732","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}
Pub Date : 2018-10-01DOI: 10.1007/978-3-030-19955-5_30
Suthee Ruangwises, T. Itoh
{"title":"AND Protocols Using Only Uniform Shuffles","authors":"Suthee Ruangwises, T. Itoh","doi":"10.1007/978-3-030-19955-5_30","DOIUrl":"https://doi.org/10.1007/978-3-030-19955-5_30","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126891967","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}
Pub Date : 2018-06-06DOI: 10.1007/978-3-319-90530-3_1
V. Gurvich
{"title":"Complexity of Generation","authors":"V. Gurvich","doi":"10.1007/978-3-319-90530-3_1","DOIUrl":"https://doi.org/10.1007/978-3-319-90530-3_1","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133748590","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}
Pub Date : 2018-06-06DOI: 10.1007/978-3-319-90530-3_25
A. Rubtsov, M. Vyalyi
{"title":"On Emptiness and Membership Problems for Set Automata","authors":"A. Rubtsov, M. Vyalyi","doi":"10.1007/978-3-319-90530-3_25","DOIUrl":"https://doi.org/10.1007/978-3-319-90530-3_25","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124569830","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}
Pub Date : 2018-06-06DOI: 10.1007/978-3-319-90530-3_10
G. Italiano, Y. Manoussakis, K. Nguyen, H. Pham
{"title":"Maximum Colorful Cycles in Vertex-Colored Graphs","authors":"G. Italiano, Y. Manoussakis, K. Nguyen, H. Pham","doi":"10.1007/978-3-319-90530-3_10","DOIUrl":"https://doi.org/10.1007/978-3-319-90530-3_10","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"3a 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128200467","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}
Pub Date : 2018-06-06DOI: 10.1007/978-3-319-90530-3_3
M. Saks
{"title":"Online Labeling: Algorithms, Lower Bounds and Open Questions","authors":"M. Saks","doi":"10.1007/978-3-319-90530-3_3","DOIUrl":"https://doi.org/10.1007/978-3-319-90530-3_3","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124923811","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}
Pub Date : 2018-06-06DOI: 10.1007/978-3-319-90530-3_2
A. Kulikov
{"title":"Lower Bounds for Unrestricted Boolean Circuits: Open Problems","authors":"A. Kulikov","doi":"10.1007/978-3-319-90530-3_2","DOIUrl":"https://doi.org/10.1007/978-3-319-90530-3_2","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127497481","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}
Pub Date : 2018-06-06DOI: 10.1007/978-3-319-90530-3_13
Daniel Genkin, M. Kaminski, L. Peterfreund
{"title":"Closure Under Reversal of Languages over Infinite Alphabets","authors":"Daniel Genkin, M. Kaminski, L. Peterfreund","doi":"10.1007/978-3-319-90530-3_13","DOIUrl":"https://doi.org/10.1007/978-3-319-90530-3_13","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122310667","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：