期刊


ISSN0304-3975
刊名Theoretical Computer Science
参考译名理论计算机科学
收藏年代2002～2024



全部

2002 2003 2004 2005 2006 2007
2008 2009 2010 2011 2012 2013
2014 2015 2016 2017 2018 2019
2020 2021 2022 2023 2024

2017, vol.657, no.Pt.A 2017, vol.657, no.Pt.B 2017, vol.658, no.Pt.A 2017, vol.658, no.Pt.B 2017, vol.659 2017, vol.660
2017, vol.661 2017, vol.662 2017, vol.663 2017, vol.664 2017, vol.665 2017, vol.666
2017, vol.667 2017, vol.668 2017, vol.669 2017, vol.670 2017, vol.671 2017, vol.672
2017, vol.673 2017, vol.674 2017, vol.675 2017, vol.676 2017, vol.677 2017, vol.678
2017, vol.679 2017, vol.680 2017, vol.681 2017, vol.682 2017, vol.683 2017, vol.684
2017, vol.685 2017, vol.686 2017, vol.687 2017, vol.688 2017, vol.689 2017, vol.690
2017, vol.691 2017, vol.692 2017, vol.693 2017, vol.694 2017, vol.695 2017, vol.696
2017, vol.697 2017, vol.698 2017, vol.699 2017, vol.700 2017, vol.701 2017, vol.702
2017, vol.703 2017, vol.704

题名作者出版年年卷期
Graph editing to a given degree sequenceGolovach, Petr A.; Mertzios, George B.20172017, vol.665
Unambiguous conjunctive grammars over a one-symbol alphabetJez, Artur; Okhotin, Alexander20172017, vol.665
Acyclic edge coloring through the Lovasz Local LemmaGiotis, Ioannis; Kirousis, Lefteris; Psaromiligkos, Kostas I.; Thilikos, Dimitrios M.20172017, vol.665
Self-stabilizing silent disjunction in an anonymous networkDatta, Ajoy K.; Devismes, Stephane; Larmore, Lawrence L.20172017, vol.665
Separating sets of strings by finding matching patterns is almost always hardLancia, Giuseppe; Mathieson, Luke; Moscato, Pablo20172017, vol.665
Finding minimum and maximum termination time of timed automata models with cyclic behaviourAl-Bataineh, Omar; Reynolds, Mark; French, Tim20172017, vol.665



国家科技图书文献中心  全球文献资源网  京ICP备05055788号-26  机械工业信息研究院 2018-2024