长垣产业园区科技文献服务平台

期刊


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

题名作者出版年年卷期
Complementation of rational sets on scattered linear orderings of finite rankOlivier Carton; Chloe Rispal20072007, vol.382, no.2
Bounds on the bisection width for random d-regular graphsJ. Diaz; M. J. Serna; N. C. Wormald20072007, vol.382, no.2
On coding labeled treesSaverio Caminiti; Irene Finocchi; Rossella Petreschi20072007, vol.382, no.2
Complexity of the bisection methodClaudio Gutierrez; Flavio Gutierrez; Maria-Cecilia Rivara20072007, vol.382, no.2
A unified access bound on comparison-based dynamic dictionariesMihai Badoiu; Richard Cole; Erik D. Demaine; John Iacono20072007, vol.382, no.2
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphsLeonid Khachiyan; Endre Boros; Khaled Elbassioni; Vladimir Gurvich20072007, vol.382, no.2
Approximation schemes for a class of subset selection problemsKirk Pruhs; Gerhard J. Woeginger20072007, vol.382, no.2
On the (im)possibility of non-interactive correlation distillationKe Yang20072007, vol.382, no.2



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