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

期刊


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

题名作者出版年年卷期
Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structuresCarlo Blundo; Paolo D'Arco; Vanessa Daza; Carles Padro20042004, vol.320, no.2-3
Combined supers/substring and super-/subsequence problemsMartin Middendorf; David F. Manlove20042004, vol.320, no.2-3
On the number of nonterminals in linear conjunctive grammarsAlexander Okhotin20042004, vol.320, no.2-3
On probabilistic analog automataAsa Ben-Hur; Alexander Roitershtein; Hava T. Siegelmann20042004, vol.320, no.2-3
An algorithmic view of gene teamsMarie-Pierre Beal; Anne Bergeron; Sylvie Corteel; Mathieu Raffinot20042004, vol.320, no.2-3
The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespanJ. J. Yuan; Z. H. Liu; C. T. Ng; T. C. E. Cheng20042004, vol.320, no.2-3
String-matching with OBDDsCh. Choffrut; Y. Haddad20042004, vol.320, no.2-3
Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instancesSimona Cocco; Remi Monasson20042004, vol.320, no.2-3
New spectral lower bounds on the bisection width of graphsS. Bezrukov; R. Elsasser; B. Monien; R. Preis; J. -P. Tillich20042004, vol.320, no.2-3
On groups whose word problem is solved by a counter automatonGillian Z. Elston; Gretchen Ostheimer20042004, vol.320, no.2-3
12