中国机械工程学会生产工程分会知识服务平台 | sc.gmachineinfo.com

期刊

ISSN	0304-3975
刊名	Theoretical Computer Science
参考译名	理论计算机科学
收藏年代	2002～2024

全部

题名	作者	出版年	年卷期
On the hardness of network design for bottleneck routing games	Dimitris Fotakis; Alexis C. Kaporis; Thanasis Lianeas; Paul G. Spirakis	2014	2014, vol.521
Inefficiency of Nash Equilibrium for scheduling games with constrained jobs: A parametric analysis	Ling Lin; Zhiyi Tan	2014	2014, vol.521
Recognizing some complementary products	Marcia R. Cappelle; Lucia Penso; Dieter Rautenbach	2014	2014, vol.521
Extracting powers and periods in a word from its runs structure	M. Crochemore; C. S. Iliopoulos; M. Kubica; J. Radoszewski; W. Rytter; T. Walen	2014	2014, vol.521
One-dimensional approximate point set pattern matching with L_p-norm	Hung-Lung Wang; Kuan-Yu Chen	2014	2014, vol.521
UNO is hard, even for a single player	Erik D. Demaine; Martin L. Demaine; Nicholas J. A. Harvey; Ryuhei Uehara; Takeaki Uno; Yushi Uno	2014	2014, vol.521
Semi-online scheduling with two GoS levels and unit processing time	Taibo Luo; Yinfeng Xu; Li Luo; Changzheng He	2014	2014, vol.521
Alternating traps in Muller and parity games	Andrey Grinshpun; Pakawat Phalitnonkiat; Sasha Rubin; Andrei Tarfulea	2014	2014, vol.521
Tree shuffle	Sandor Vagvolgyi	2014	2014, vol.521
The guarding game is E-complete	R. Samal; T. Valla	2014	2014, vol.521