期刊


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

2025, vol.1023 2025, vol.1024 2025, vol.1025 2025, vol.1026 2025, vol.1027 2025, vol.1028
2025, vol.1029 2025, vol.1030 2025, vol.1031 2025, vol.1032 2025, vol.1033 2025, vol.1034
2025, vol.1035 2025, vol.1036 2025, vol.1037 2025, vol.1038 2025, vol.1039

题名作者出版年年卷期
A note on quantum divide and conquer for minimal string rotationWang, QishengWang, Qisheng20252025, vol.1034
Lower bounds for graph reconstruction with maximal independent set queriesMichel, Lukas; Scott, AlexMichel, Lukas; Scott, Alex20252025, vol.1034
Shell sort with expected complexity of O(nlog2n)Hu, ShengrongHu, Shengrong20252025, vol.1034
Network control games played on graphsLiang, Zihui; Khoussainov, Bakh; Xiao, MingyuLiang, Zihui; Khoussainov, Bakh; Xiao, Mingyu20252025, vol.1034
For rational numbers with Suppes-Ono division, equational validity is one-one equivalent with Diophantine unsolvabilityBergstra, Jan A.; Tucker, John, VBergstra, Jan A.; Tucker, John, V20252025, vol.1034
Fast and simple (1+ E )Δ-edge-coloring of dense graphsDhawan, AbhishekDhawan, Abhishek20252025, vol.1034