期刊


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

2004, vol.310, no.1-3 2004, vol.311, no.1-3 2004, vol.312, no.1 2004, vol.312, no.2-3 2004, vol.313, no.1 2004, vol.313, no.2
2004, vol.313, no.3 2004, vol.314, no.1-2 2004, vol.314, no.3 2004, vol.315, no.1 2004, vol.315, no.2-3 2004, vol.316, no.1-3
2004, vol.317, no.1-3 2004, vol.318, no.1-2 2004, vol.318, no.3 2004, vol.319, no.1-3 2004, vol.320, no.1 2004, vol.320, no.2-3
2004, vol.321, no.1 2004, vol.321, no.2-3 2004, vol.322, no.1 2004, vol.322, no.2 2004, vol.322, no.3 2004, vol.323, no.1-3
2004, vol.324, no.1 2004, vol.324, no.2-3 2004, vol.325, no.1 2004, vol.325, no.2 2004, vol.325, no.3 2004, vol.326, no.1-3
2004, vol.327, no.1-2 2004, vol.327, no.3 2004, vol.328, no.1-2 2004, vol.328, no.3 2004, vol.329, no.1-3

题名作者出版年年卷期
Cross-monotonic cost sharing methods for connected facility location gamesStefano Leonardi; Guido Schafer20042004, vol.326, no.1-3
On the ultimate complexity of factorialsQi Cheng20042004, vol.326, no.1-3
Rotation sequences and edge-colouring of binary tree pairsAlan Gibbons; Paul Sant20042004, vol.326, no.1-3
Performance evaluation for energy efficient topologic control in ad hoc wireless networksMinming Li; Shawn L. Huang, Xiaoming Sun; Xiao Huang20042004, vol.326, no.1-3
The complexity of computing the MCD-estimatorThorsten Bernholt; Paul Fischer20042004, vol.326, no.1-3
Authenticated key agreement in dynamic peer groupsXun Yi20042004, vol.326, no.1-3
Optimal graph exploration without good mapsAnders Dessmark; Andrzej Pelc20042004, vol.326, no.1-3
The Chilean highway problemMarcos Kiwi; Alexander Russell20042004, vol.326, no.1-3
Least-recently-used caching with dependent requestsPredrag R. Jelenkovic; Ana Radovanovic20042004, vol.326, no.1-3
On distance constrained labeling of disk graphsJiff Fiala; Aleksei V. Fishkin; Fedor Fomin20042004, vol.326, no.1-3
123