期刊


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

2019, vol.753 2019, vol.754 2019, vol.755 2019, vol.756 2019, vol.757 2019, vol.758
2019, vol.759 2019, vol.760 2019, vol.761 2019, vol.762 2019, vol.763 2019, vol.764
2019, vol.765 2019, vol.766 2019, vol.767 2019, vol.768 2019, vol.769 2019, vol.770
2019, vol.771 2019, vol.772 2019, vol.773 2019, vol.774 2019, vol.775 2019, vol.776
2019, vol.777 2019, vol.778 2019, vol.779 2019, vol.780 2019, vol.781 2019, vol.782
2019, vol.783 2019, vol.784 2019, vol.785 2019, vol.786 2019, vol.787 2019, vol.788
2019, vol.789 2019, vol.790 2019, vol.791 2019, vol.792 2019, vol.793 2019, vol.794
2019, vol.795 2019, vol.796 2019, vol.797 2019, vol.798 2019, vol.799 2019, vol.800

题名作者出版年年卷期
Disjoint path covers joining prescribed source and sink sets in interval graphsPark, Jung-Heum; Kim, Jae-Hoon; Lim, Hyeong-Seok20192019, vol.776
Scheduling two-stage jobs on multiple flowshopsWu, Guangwei; Chen, Jianer; Wang, Jianxin20192019, vol.776
Intrinsic complexity of partial learningJain, Sanjay; Kinber, Efim20192019, vol.776
Online circle and sphere packingLintzmayer, Carla Negri; Miyazawa, Flavio Keidi; Xavier, Eduardo Candido20192019, vol.776
Fault diagnosability of data center networksGu, Mei-Mei; Hao, Rong-Xia; Zhou, Shuming20192019, vol.776
Better analysis of GREEDY binary search tree on decomposable sequencesGoyal, Navin; Gupta, Manoj20192019, vol.776
A study on splay treesRusso, Luis M. S.20192019, vol.776
Existential Diophantine definability of string lengthLitow, B.20192019, vol.776
Degree-constrained 2-partitions of graphsBang-Jensen, Jorgen; Bessy, Stephane20192019, vol.776
Online packet scheduling with bounded delay and lookaheadBoehm, Martin; Chrobak, Marek; Jez, Lukasz; Li, Fei; Sgall, Jiri; Vesely, Pavel20192019, vol.776