default search action
Theoretical Computer Science, Volume 654
Volume 654, November 2016
- Dachuan Xu, Donglei Du, Ding-Zhu Du:
Editorial for Computing and Combinatorics Conference. 1
- Ruiwen Chen, Valentine Kabanets:
Correlation bounds and #SAT algorithms for small linear-size circuits. 2-10 - Nan Zhang, Zhenhua Duan, Cong Tian:
A mechanism of function calls in MSVL. 11-25 - Dayu He, Xin He:
Nearly optimal monotone drawing of trees. 26-32 - Zhe Dang, Thomas R. Fischer, William J. Hutton III, Oscar H. Ibarra, Qin Li:
Quantifying communication in synchronized languages. 33-44 - Wei Yu, Zhaohui Liu:
Improved approximation algorithms for some min-max and minimum cycle cover problems. 45-58 - Jens Maßberg:
Embedding rectilinear Steiner trees with length restrictions. 59-69 - Syed Mohammad Meesum, Pranabendu Misra, Saket Saurabh:
Reducing rank of the adjacency matrix by graph modification. 70-79 - Seungbum Jo, Srinivasa Rao Satti:
Simultaneous encodings for range and next/previous larger/smaller value queries. 80-91 - Sourav Chakraborty, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh:
Upper bounds on Fourier entropy. 92-112 - Shenghui Su, Shuwang Lü, Maozhi Xu, Tao Xie:
A semantically secure public key cryptoscheme using bit-pair shadows. 113-127 - Shenghui Su, Tao Xie, Shuwang Lü:
A provably secure non-iterative hash function resisting birthday attack. 128-142 - Kevin Balas, Csaba D. Tóth:
On the number of anchored rectangle packings for a planar point set. 143-154 - Takeaki Uno, Yushi Uno:
Mining preserving structures in a graph sequence. 155-163 - Yin Wang, Yinfeng Xu:
The approximation algorithms for a class of multiple-choice problem. 164-174 - Kameng Nip, Zhenbo Wang, Wenxun Xing:
A study on several combination problems of classic shop scheduling and shortest path. 175-187 - Deshi Ye, Guochuan Zhang:
Approximate composable truthful mechanism design. 188-198
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.