期刊


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

2003, vol.290, no.1 2003, vol.290, no.2 2003, vol.290, no.3 2003, vol.291, no.1 2003, vol.291, no.2 2003, vol.291, no.3
2003, vol.292, no.1 2003, vol.292, no.2 2003, vol.292, no.3 2003, vol.293, no.1 2003, vol.293, no.2 2003, vol.293, no.3
2003, vol.294, no.1-2 2003, vol.294, no.3 2003, vol.295, no.1-3 2003, vol.296, no.1 2003, vol.296, no.2 2003, vol.296, no.3
2003, vol.297, no.1-3 2003, vol.298, no.1 2003, vol.298, no.2 2003, vol.298, no.3 2003, vol.299, no.1-3 2003, vol.300, no.1-3
2003, vol.301, no.1-3 2003, vol.302, no.1-3 2003, vol.303, no.1 2003, vol.303, no.2-3 2003, vol.304, no.1-3 2003, vol.305, no.1-3
2003, vol.306, no.1-3 2003, vol.307, no.1 2003, vol.307, no.2 2003, vol.307, no.3 2003, vol.308, no.1-3 2003, vol.309, no.1-3

题名作者出版年年卷期
Trade-off results for connection managementMarios Mavronicolas; Nikos Papadakis20032003, vol.290, no.1
Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithmFrank Stomp20032003, vol.290, no.1
On infinite transition graphs having a decidable monadic theoryDidier Caucal20032003, vol.290, no.1
Performance measure sensitive congruences for Markovian process algebrasMarco Bernardo; Mario Bravetti20032003, vol.290, no.1
Polarized proof-nets and λμ-calculusOlivier Laurent20032003, vol.290, no.1
A Cartesian closed category in Martin-Lof's intuitionistic type theorySilvio Valentini20032003, vol.290, no.1
Bounded time-stamping in message-passing systemsMadhavan Mukund; K. Narayan Kumar; Milind Sohoni20032003, vol.290, no.1
Model checking of systems with many identical timed processesParosh Aziz Abdulla; Bengt Jonsson20032003, vol.290, no.1
Relaxed models for rewriting logicDorel Lucanu20032003, vol.290, no.1
Unions of non-disjoint theories and combinations of satisfiability proceduresCesare Tinelli; Christophe Ringeissen20032003, vol.290, no.1
1234