期刊


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

2020, vol.801 2020, vol.802 2020, vol.803 2020, vol.804 2020, vol.805 2020, vol.806
2020, vol.807 2020, vol.808 2020, vol.809 2020, vol.810 2020, vol.811 2020, vol.812
2020, vol.813 2020, vol.814 2020, vol.815 2020, vol.816 2020, vol.817 2020, vol.818
2020, vol.819 2020, vol.820 2020, vol.821 2020, vol.822 2020, vol.823 2020, vol.824/825
2020, vol.826/827 2020, vol.828/829 2020, vol.830/831 2020, vol.832 2020, vol.833 2020, vol.834
2020, vol.835 2020, vol.836 2020, vol.837 2020, vol.838 2020, vol.839 2020, vol.840
2020, vol.841 2020, vol.842 2020, vol.843 2020, vol.844 2020, vol.845 2020, vol.846
2020, vol.847 2020, vol.848

题名作者出版年年卷期
On ultrametric 1-median selectionChang, Ching-Lueh20202020, vol.828/829
Faster compression of patterns to Rectangle Rule ListsRaymundo Da Silva, Ian Albuquerque; Calinescu, Gruia; De Graaf, Nathan20202020, vol.828/829
Minimizing the cost of batch calibrationsChau, Vincent; Li, Minming; Wang, Elaine Yinling; Zhang, Ruilong; Zhao, Yingchao20202020, vol.828/829
GHS algorithm on a graph with random weightsRybarczyk, Katarzyna20202020, vol.828/829
A new proof for exact relationship between extra connectivity and extra diagnosability of regular connected graphs under MM* modelHuang, Yanze; Lin, Limei; Xu, Li20202020, vol.828/829
Information coverage maximization for multiple products in social networksGuo, Jianxiong; Huang, Chuanhe; Ni, Qiufen; Wu, Weili20202020, vol.828/829
On RAC drawings of graphs with one bend per edgeAngelini, Patrizio; Bekos, Michael A.; Foerster, Henry; Kaufmann, Michael20202020, vol.828/829