default search action
Theoretical Computer Science, Volume 933
Volume 933, October 2022
- Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro:
Reducing the local alphabet size in tiling systems by means of 2D comma-free codes. 1-20 - Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda:
Parameterized DAWGs: Efficient constructions and bidirectional pattern searches. 21-42 - Daniel Coronel, Alexander Frank, Mathieu Hoyrup, Cristobal Rojas:
Realizing semicomputable simplices by computable dynamical systems. 43-54 - Marie-Pierre Béal, Maxime Crochemore:
Checking whether a word is Hamming-isometric in linear time. 55-59 - Xiaoguang Bao, Lei Xu, Wei Yu, Wei Song:
Approximation algorithms for the min-max clustered k-traveling salesmen problems. 60-66 - Madhumita Sardar, Deepanwita Das, Srabani Mukhopadhyaya:
Grid exploration by a swarm of autonomous robots with minimum repetitions. 67-87 - Simone Faro, Stefano Scafiti:
A weak approach to suffix automata simulation for exact and approximate string matching. 88-103 - Siu-Wing Cheng:
Multistage online maxmin allocation of indivisible entities. 104-113 - Yongcui Tian, Qiang Zhu:
r-component diagnosability of hypercubes under the PMC model. 114-124 - Ajinkya Gaikwad, Soumen Maity:
Further parameterized algorithms for the F-free edge deletion problem. 125-137 - Joe Sawada, Aaron Williams, Dennis Wong:
Flip-swap languages in binary reflected Gray code order. 138-148 - Matthias Bentert, Leon Kellerhals, Rolf Niedermeier:
The structural complexity landscape of finding balance-fair shortest paths. 149-162 - Xinjian Chen, Qiong Huang, Hongbo Li, Zhijian Liao, Willy Susilo:
A novel identity-based multi-signature scheme over NTRU lattices. 163-176
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.