期刊


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

2023, vol.939 2023, vol.940, no.Pt.A 2023, vol.940, no.Pt.B 2023, vol.941 2023, vol.942 2023, vol.943
2023, vol.944 2023, vol.945 2023, vol.946 2023, vol.947 2023, vol.948 2023, vol.949
2023, vol.950 2023, vol.951 2023, vol.952 2023, vol.953 2023, vol.954 2023, vol.955
2023, vol.956 2023, vol.957 2023, vol.958 2023, vol.959 2023, vol.960 2023, vol.961
2023, vol.962 2023, vol.963 2023, vol.964 2023, vol.965 2023, vol.966/967 2023, vol.968
2023, vol.969 2023, vol.970 2023, vol.971 2023, vol.972 2023, vol.973 2023, vol.974
2023, vol.975 2023, vol.976 2023, vol.977 2023, vol.978 2023, vol.979 2023, vol.980

题名作者出版年年卷期
Flexible scheduling of transactional memory on treesBusch C.; Chlebus B.S.; Herlihy M.; Popovic M.; Poudel P.; Sharma G.20232023, vol.978
How bad is the merger paradox?Blumrosen L.; Mizrahi Y.20232023, vol.978
Maximal degenerate palindromes with gaps and mismatchesAlzamel M.; Hampson C.; Iliopoulos C.S.; Lim Z.; Watts S.; Pissis S.; Vlachakis D.20232023, vol.978
Sorting balls and water: Equivalence and computational complexityIto T.; Suzuki A.; Yoshinaka R.; Kawahara J.; Minato S.-I.; Otachi Y.; Saitoh T.; Uehara R.; Uno T.; Yamanaka K.20232023, vol.978
Distributed algorithms for filling MIS vertices of an arbitrary graph by myopic luminous robotsPramanick S.; Samala S.V.; Mandal P.S.; Pattanayak D.20232023, vol.978
On (simple) decision tree rankDahiya Y.; Mahajan M.20232023, vol.978
Parameterized complexity of multicut in weighted treesGalby E.; Marx D.; Schepper P.; Sharma R.; Tale P.20232023, vol.978
Asynchronous Byzantine reliable broadcast with a message adversaryAlbouy T.; Frey D.; Raynal M.; Taiani F.20232023, vol.978
Progress analysis of a multi-recombinative evolution strategy on the highly multimodal Rastrigin functionOmeradzic A.; Beyer H.-G.20232023, vol.978
On orientations maximizing total arc-connectivityHorsch F.20232023, vol.978
12