期刊


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



全部

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

2024, vol.1000 2024, vol.1001 2024, vol.1002 2024, vol.1003 2024, vol.1004 2024, vol.1005
2024, vol.1006 2024, vol.1007 2024, vol.1008 2024, vol.1009 2024, vol.1010 2024, vol.1011
2024, vol.1012 2024, vol.1013 2024, vol.1014 2024, vol.1015 2024, vol.1016 2024, vol.1017
2024, vol.1018 2024, vol.1019 2024, vol.1022 2024, vol.981 2024, vol.982 2024, vol.983
2024, vol.984 2024, vol.985 2024, vol.986 2024, vol.987 2024, vol.988 2024, vol.989
2024, vol.990 2024, vol.991 2024, vol.992 2024, vol.993 2024, vol.994 2024, vol.995
2024, vol.996 2024, vol.997 2024, vol.998 2024, vol.999

题名作者出版年年卷期
Linear time online algorithms for constructing linear-size suffix trieHendrian, Diptarama; Takagi, Takuya; Inenaga, Shunsuke; Goto, Keisuke; Funakoshi, Mitsuru20242024, vol.1015
On the power of local graph expansion grammars with and without additional restrictionsDrewes, Frank; Stade, Yannick20242024, vol.1015
A better LP rounding for feedback arc set on tournamentsOstovari, Mojtaba; Zarei, Alireza20242024, vol.1015
Slowing down top trees for better worst-case compressionDudek, Bartlomiej; Gawrychowski, Pawel20242024, vol.1015
Computational complexity of counting coincidencesChan, Swee Hong; Pak, Igor20242024, vol.1015
Chess is hard even for a single playerAravind, N. R.; Misra, Neeldhara; Mittal, Harshil20242024, vol.1015
Diagnosability of labeled D p -automataZhang, Kuize; Raisch, Joerg20242024, vol.1015



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