default search action
Theoretical Computer Science, Volume 857
Volume 857, February 2021
- Sahar Hooshmand, Paniz Abedin, M. Oguzhan Külekci, Sharma V. Thankachan:
I/O-efficient data structures for non-overlapping indexing. 1-7 - Bei Niu, Bi Li, Xin Zhang:
Hardness and algorithms of equitable tree-coloring problem in chordal graphs. 8-15 - Xingjian Ding, Jianxiong Guo, Deying Li, Weili Wu:
Optimal wireless charger placement with individual energy requirement. 16-28 - Nan Zhang, Bin Yu, Cong Tian, Zhenhua Duan, Xiaoshuai Yuan:
Temporal logic specification mining of programs. 29-42 - Zhiyao Li, Bosen Cheng, Xiaofeng Gao, Huai Chen, Guihai Chen:
A unified task recommendation strategy for realistic mobile crowdsourcing system. 43-58 - Heng-Zhao Ma, Jianzhong Li:
A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee. 59-70 - Guoyao Rao, Yongcai Wang, Wenping Chen, Deying Li, Weili Wu:
Matching influence maximization in social networks. 71-86 - Shengminjie Chen, Wenguo Yang, Suixiang Gao, Rong Jin:
Novel algorithms for maximum DS decomposition. 87-96 - Gwénaël Richomme:
On sets of indefinitely desubstitutable words. 97-113 - Yuehua Bu, Chentao Qi, Junlei Zhu, Ting Xu:
Injective coloring of planar graphs. 114-122 - Sara Giuliani, Zsuzsanna Lipták, Francesco Masillo, Romeo Rizzi:
When a dollar makes a BWT. 123-146 - Martin Berglund, Willem Bester, Brink van der Merwe:
Formalising and implementing Boost POSIX regular expression matching. 147-165 - Sebastián González Hermosillo de la Maza, Seyyed Aliasghar Hosseini, Fiachra Knox, Bojan Mohar, Bruce A. Reed:
Cops and robbers on oriented toroidal grids. 166-176 - Baoling Ning, Jianzhong Li, Shouxu Jiang:
Range partitioning within sublinear time: Algorithms and lower bounds. 177-191
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.