中国机械工程学会生产工程分会知识服务平台

期刊


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

2007, vol.370, no.1-3 2007, vol.371, no.1-2 2007, vol.371, no.3 2007, vol.372, no.1 2007, vol.372, no.2-3 2007, vol.373, no.1-2
2007, vol.373, no.3 2007, vol.374, no.1-3 2007, vol.375, no.1-3 2007, vol.376, no.1-2 2007, vol.376, no.3 2007, vol.377, no.1-3
2007, vol.378, no.1 2007, vol.378, no.2 2007, vol.378, no.3 2007, vol.379, no.1-2 2007, vol.379, no.3 2007, vol.380, no.1-2
2007, vol.380, no.3 2007, vol.381, no.1-3 2007, vol.382, no.1 2007, vol.382, no.2 2007, vol.382, no.3 2007, vol.383, no.1
2007, vol.383, no.2-3 2007, vol.384, no.1 2007, vol.384, no.2-3 2007, vol.385, no.1-3 2007, vol.386, no.1-2 2007, vol.386, no.3
2007, vol.387, no.1 2007, vol.387, no.2 2007, vol.387, no.3 2007, vol.388, no.1-3 2007, vol.389, no.1-2 2007, vol.389, no.3

题名作者出版年年卷期
Impossibility of gathering by a set of autonomous mobile robotsGiuseppe Prencipe20072007, vol.384, no.2-3
Agreement in synchronous networks with ubiquitous faultsNicola Santoro; Peter Widmayer20072007, vol.384, no.2-3
Optimal gossiping in square 2D meshesRui Wang; Francis C. M. Lau20072007, vol.384, no.2-3
Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problemMordechai Shalom; Shmuel Zaks20072007, vol.384, no.2-3
Hardness and approximation results for Black Hole Search in arbitrary networksRalf Klasing; Euripides Markou; Tomasz Radzik; Fabiano Sarracco20072007, vol.384, no.2-3
Communications in unknown networks: Preserving the secret of topologyMarkus Hinkelmann; Andreas Jakoby20072007, vol.384, no.2-3
A tight bound for online colouring of disk graphsIoannis Caragiannis; Aleksei V. Fishkin; Christos Kaklamanis; Evi Papaioannou20072007, vol.384, no.2-3
Traffic grooming on the pathJean-Claude Bermond; Laurent Braud; David Coudert20072007, vol.384, no.2-3
On the bounded-hop MST problem on random Euclidean instancesAndrea E. F. Clementi; Miriam Di Ianni; Massimo Lauria; Angelo Monti; Gianluca Rossi; Riccardo Silvestri20072007, vol.384, no.2-3
Two absolute bounds for distributed bit complexityYefim Dinitz; Noam Solomon20072007, vol.384, no.2-3



国家科技图书文献中心  全球文献资源网  京ICP备05055788号-26  京公网安备11010202008970号  机械工业信息研究院 2018-2024