期刊


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

2018, vol.705 2018, vol.706 2018, vol.707 2018, vol.708 2018, vol.709 2018, vol.710
2018, vol.711 2018, vol.712 2018, vol.713 2018, vol.714 2018, vol.715 2018, vol.716
2018, vol.717 2018, vol.718 2018, vol.719 2018, vol.720 2018, vol.721 2018, vol.722
2018, vol.723 2018, vol.724 2018, vol.725 2018, vol.726 2018, vol.727 2018, vol.728
2018, vol.729 2018, vol.730 2018, vol.731 2018, vol.732 2018, vol.733 2018, vol.734
2018, vol.735 2018, vol.736 2018, vol.737 2018, vol.738 2018, vol.739 2018, vol.740
2018, vol.741 2018, vol.742 2018, vol.743 2018, vol.744 2018, vol.745 2018, vol.746
2018, vol.747 2018, vol.748 2018, vol.749 2018, vol.750 2018, vol.751 2018, vol.752

题名作者出版年年卷期
Bivariate complexity analysis ofAlmost Forest DeletionAshutosh Rai; Saket Saurabh20182018, vol.708
The maximum time of 2-neighbor bootstrap percolation: Complexity resultsThiago Marcilon; Rudini Sampaio20182018, vol.708
Editorial Board 20182018, vol.708
Efficient merged longest common subsequence algorithms for similar sequencesKuo-Tsung Tseng; De-Sheng Chan; Chang-Biau Yang; Shou-Fu Lo20182018, vol.708
Sums of read-once formulas: How many summands are necessary?Meena Mahajan; Anuj Tawari20182018, vol.708
An iteration method for computing the total number of spanning trees and its applications in graph theoryBing Yao; Fei Ma20182018, vol.708
A new lower bound for the on-line coloring of intervals with bandwidthPatryk Mikos20182018, vol.708
A transfer method from bounded existential Diophantine equations to Tarski algebra formulasB. Litow20182018, vol.708
Structured proportional representationNimrod Talmon20182018, vol.708



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