期刊


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

2016, vol.609, no.Pt.1 2016, vol.609, no.Pt.2 2016, vol.609, no.Pt.3 2016, vol.610, no.Pt.A 2016, vol.610, no.Pt.B 2016, vol.611
2016, vol.612 2016, vol.613 2016, vol.614 2016, vol.615 2016, vol.616 2016, vol.617
2016, vol.618 2016, vol.619 2016, vol.620 2016, vol.621 2016, vol.622 2016, vol.623
2016, vol.624 2016, vol.625 2016, vol.626 2016, vol.627 2016, vol.628 2016, vol.629
2016, vol.630 2016, vol.631 2016, vol.632 2016, vol.633 2016, vol.634 2016, vol.635
2016, vol.636 2016, vol.637 2016, vol.638 2016, vol.639 2016, vol.640 2016, vol.641
2016, vol.642 2016, vol.643 2016, vol.644 2016, vol.645 2016, vol.646 2016, vol.647
2016, vol.648 2016, vol.649 2016, vol.650 2016, vol.651 2016, vol.652 2016, vol.653
2016, vol.654 2016, vol.655, no.Pt.A 2016, vol.655, no.Pt.B 2016, vol.656, no.Pt.A 2016, vol.656, no.Pt.B

题名作者出版年年卷期
A reduction of security notions in designated confirmer signaturesXia, Yingjie; Liu, Xuejiao; Xia, Fubiao; Wang, Guilin20162016, vol.618
Solving the Many to Many assignment problem by improving the Kuhn-Munkres algorithm with backtrackingZhu, Haibin; Liu, Dongning; Zhang, Siqin; Zhu, Yu; Teng, Luyao; Teng, Shaohua20162016, vol.618
Relating the extra connectivity and the conditional diagnosability of regular graphs under the comparison modelLin, Limei; Xu, Li; Zhou, Shuming20162016, vol.618
Computing equality-free and repetitive string factorisationsSchmid, Markus L.20162016, vol.618
Input-driven languages are linear conjunctiveOkhotin, Alexander20162016, vol.618
Complexity of reversible circuits and their quantum implementationsAbdessaied, Nabila; Amy, Matthew; Drechsler, Rolf; Soeken, Mathias20162016, vol.618
Quantified conjunctive queries on partially ordered setsBova, Simone; Ganian, Robert; Szeider, Stefan20162016, vol.618
Extended dualization: Application to maximal pattern miningNourine, Lhouari; Petit, Jean-Marc20162016, vol.618
Working in binary protects the repetends of 1/3(h): Comment on Colussi's 'The convergence classes of Collatz function'Hew, Patrick Chisan20162016, vol.618
Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3Macedo Filho, Helio B.; Machado, Raphael C. S.; de Figueiredo, Celina M. H.20162016, vol.618