期刊


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

2002, vol.286, no.1 2002, vol.286, no.2 2002, vol.287, no.1 2002, vol.287, no.2 2002, vol.288, no.2 2002, vol.289, no.1
2002, vol.289, no.2

题名作者出版年年卷期
A generic causal model for place latencyReiner Durchholz20022002, vol.289, no.1
Sorting algorithms for broadcast communications: mathematical analysisPeter J. Grabner; Helmut Prodinger20022002, vol.289, no.1
A deterministic (2-2/(k+1){sup}n algorithm for k-SAT based on local searchEvgeny Dantsin; Andreas Goerdt; Edward A. Hirsch; Ravi Kannan; Jon Kleinberg; Christos Papadimitriou; Prabhakar Raghavan; Uwe Schoning20022002, vol.289, no.1
The complexity of the characterization of networks supporting shortest-path interval routingT. Eilam; S. Moran; S. Zaks20022002, vol.289, no.1
Symmetries of decimation invariant sequences and digit setsA. Barbe; F. von Haeseler20022002, vol.289, no.1
Canonical derivatives, partial derivatives and finite automaton constructionsJ. -M. Champarnaud; D. Ziadi20022002, vol.289, no.1
Counter machines and verification problemsOscar H. Ibarra; Jianwen Su; Zhe Dang; Tevfik Bultan; Richard A. Kemmerer20022002, vol.289, no.1
Augmenting the discrete time automaton with other data structuresOscar H. Ibarra; Jianwen Su20022002, vol.289, no.1
Sorting with two ordered stacks in seriesM. D. Atkinson; M. M. Murphy; N. Ruskuc20022002, vol.289, no.1
Determinization of transducers over finite and infinite wordsMarie-Pierre Beal; Olivier Carton20022002, vol.289, no.1
1234