期刊


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

2022, vol.897 2022, vol.898 2022, vol.899 2022, vol.900 2022, vol.901 2022, vol.902
2022, vol.903 2022, vol.904 2022, vol.905 2022, vol.906 2022, vol.907 2022, vol.908
2022, vol.909 2022, vol.910 2022, vol.911 2022, vol.912 2022, vol.913 2022, vol.914
2022, vol.915 2022, vol.916 2022, vol.917 2022, vol.918 2022, vol.919 2022, vol.920
2022, vol.921 2022, vol.922 2022, vol.923 2022, vol.924 2022, vol.925 2022, vol.926
2022, vol.927 2022, vol.928 2022, vol.929 2022, vol.930 2022, vol.931 2022, vol.932
2022, vol.933 2022, vol.934 2022, vol.935 2022, vol.936 2022, vol.937 2022, vol.938

题名作者出版年年卷期
Computing subset transversals in H-free graphsBrettell, Nick; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniel20222022, vol.902
Improvements in the computing efficiency of the probabilities of the LIL test for the PRNG evaluationMatos-Rodriguez, Yuniel; Jose Madarro-Capo, Evaristo; Miguel Legon-Perez, Carlos; Rojas, Omar; Sosa-Gomez, Guillermo20222022, vol.902
Wildcarded identity-based encryption from latticesMinh Thuy Truc Pham; Ngoc Ai Van Nguyen; Jiang, Mei; Dung Hoang Duong; Susilo, Willy20222022, vol.902
Parameterized complexity of two-interval pattern problemBose, Prosenjit; Mehrabi, Saeed; Mondal, Debajyoti20222022, vol.902
p Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphsElbassioni, Khaled20222022, vol.902
Taming the knight's tour: Minimizing turns and crossingsBesa, Juan Jose; Johnson, Timothy; Mamano, Nil; Osegueda, Martha C.; Williams, Parker20222022, vol.902
A nondeterministic Turing machine variant to compute functionsFritsche Colombo, Joao Guilherme; Marchi, Jerusa20222022, vol.902



制造业外文文献服务平台