default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 550
Volume 550, September 2014
- Hongyang Sun
, Yuxiong He, Wen-Jing Hsu, Rui Fan:
Energy-efficient multiprocessor scheduling for flow time and makespan. 1-20 - Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano:
Complexity of finding maximum regular induced subgraphs with prescribed degree. 21-35 - MohammadAmin Fazli, Mohammad Ghodsi, Jafar Habibi, Pooya Jalaly Khalilabadi, Vahab S. Mirrokni, Sina Sadeghian Sadeghabad:
On non-progressive spread of influence through social networks. 36-50 - Philip Bille, Patrick Hagge Cording, Inge Li Gørtz:
Compact q-gram profiling of compressed strings. 51-58 - Zhixiang Chen, Bin Fu, Randy Goebel, Guohui Lin, Weitian Tong, Jinhui Xu, Boting Yang, Zhiyu Zhao, Binhai Zhu:
On the approximability of the exemplar adjacency number problem for genomes with gene repetitions. 59-65 - Jamie Simpson:
Palindromes in circular words. 66-78 - Lila Kari, Stavros Konstantinidis, Steffen Kopecki:
On the maximality of languages with combined types of code properties. 79-89 - Da-Jung Cho, Yo-Sub Han, Sang-Ki Ko:
Decidability of involution hypercodes. 90-99
- John Haslegrave:
Bounds on Herman's algorithm. 100-106 - Michel Dekking:
On the structure of Thue-Morse subwords, with an application to dynamical systems. 107-112
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-10 18:36 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
