ProblemElsevierAlgorithmsAlgorithmRIGHTSEditorialMinimumStringthe MaximumLinearComplexityPatternTREESElementRunningPRESENTPattern MatchingApproximation AlgorithmsSolutionSimple
无数据
vol.9 (2011)
vol.8 (2010)
vol.7 (2009)
vol.6 (2008)
vol.5 (2007)
vol.4 (2006)
vol.3 (2005)
vol.2 (2004)
vol.1 (2003)
不详
Lewenstein, M.Valiente, G.
Kutz, MartinBrodal, Gerth StoltingKaligosi, KanelaKatriel, Irit
Kingsford, CarlZaslavsky, ElenaSingh, Mona
Evans, Patricia A.
OzeryFlato, MichalShamir, Ron
Chan, HoLeungLam, TakWahSung, WingKinTama, SiuLungWong, SweeSeong
Kubica, MarcinRizzi, RomeoVialette, StephaneWalen, Tomasz
2011年04期
客服热线
400-638-5550
客服邮箱
service@cqvip.com