期刊


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

2014, vol.515 2014, vol.516 2014, vol.517 2014, vol.518 2014, vol.519 2014, vol.520
2014, vol.521 2014, vol.522 2014, vol.523 2014, vol.524 2014, vol.525 2014, vol.526
2014, vol.527 2014, vol.528 2014, vol.529 2014, vol.530 2014, vol.531 2014, vol.532
2014, vol.533 2014, vol.534 2014, vol.535 2014, vol.536 2014, vol.537 2014, vol.538
2014, vol.539 2014, vol.540/541 2014, vol.543 2014, vol.544 2014, vol.545 2014, vol.546
2014, vol.547 2014, vol.548 2014, vol.549 2014, vol.550 2014, vol.551 2014, vol.551, no.
2014, vol.552 2014, vol.553 2014, vol.554 2014, vol.555 2014, vol.556 2014, vol.557
2014, vol.558 2014, vol.559 2014, vol.559, no. 2014, vol.560, no.Pt.1 2014, vol.560, no.Pt.2 2014, vol.560, no.Pt.3

题名作者出版年年卷期
Solving the maximum duo-preservation string mapping problem with linear programmingWenbin Chen; Zhengzhang Chen; Nagiza F. Samatova; Lingxi Peng; Jianxiong Wang; Maobin Tang20142014, vol.530
Competitive router scheduling with structured dataYishay Mansour; Boaz Patt-Shamir; Dror Rawitz20142014, vol.530
Average-case linear-time similar substring searching by the q-gram distanceHiroyuki Hanada; Mineichi Kudo; Atsuyoshi Nakamura20142014, vol.530
Squares in partial wordsF. Blanchet-Sadri; Yang Jiao; John M. Machacek; J. D. Quigley; Xufan Zhang20142014, vol.530
The diagnosability of triangle-free graphsCheng-Kuan Lin; Yuan-Hsiang Teng20142014, vol.530
Complexity insights of the MINIMUM DUPLICATION problemGuillaume Blin; Paola Bonizzoni; Riccardo Dondi; Romeo Rizzi; Florian Sikora20142014, vol.530
The Covering Canadian Traveller ProblemChung-Shou Liao; Yamming Huang20142014, vol.530
The complexity of LSH feasibilityFlavio Chierichetti; Ravi Kumar; Mohammad Mahdian20142014, vol.530



制造业外文文献服务平台