


default search action
Theoretical Computer Science, Volume 793
Volume 793, November 2019
- Kitti Gelle, Szabolcs Iván:

The ordinal generated by an ordinal grammar is computable. 1-13 - Bin Wang, Guangyan Zhou:

Super solutions of random (3 + p)-SAT. 14-27 - Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid:

The discrete Voronoi game in a simple polygon. 28-35 - Hossein Teimoori Faal:

A multiset version of determinants and the Coin arrangements lemma. 36-43 - Wei Yu, Zhaohui Liu, Xiaoguang Bao:

New approximation algorithms for the minimum cycle cover problem. 44-58 - Amihood Amir, Avivit Levy, Ronit Lubin, Ely Porat:

Approximate cover of strings. 59-69 - Alexander V. Kononov, Mikhail Y. Kovalyov

, Bertrand M. T. Lin
:
Minimizing machine assignment costs over Δ-approximate solutions of the scheduling problem P||Cmax. 70-78 - Hui Wang

, Cees H. Elzinga, Zhiwei Lin, Jordan Vincent:
Quantifying sequential subsumption. 79-99 - Bernadette Charron-Bost, Shlomo Moran:

The firing squad problem revisited. 100-112 - Mengjie Lv, Shuming Zhou, Xueli Sun, Guanqin Lian, Jiafei Liu, Dajin Wang:

Probabilistic diagnosis of clustered faults for hypercube-based multiprocessor system. 113-131 - Yoshifumi Sakai:

Maximal common subsequence algorithms. 132-139 - Tung-Wei Kuo:

On the approximability and hardness of the minimum connected dominating set with routing cost constraint. 140-151 - Da-Jung Cho, Yo-Sub Han, Hwee Kim:

Bound-decreasing duplication system. 152-168 - Nadia Brauner, Yves Crama, Etienne Delaporte, Vincent Jost

, Luc Libralesso
:
Do balanced words have a short period? 169-180 - Pingshan Li, Min Xu:

The t/k-diagnosability and strong Menger connectivity on star graphs with conditional faults. 181-192 - Benjamin Blanchette:

Quasi-automatic groups are asynchronously automatic. 193-195

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














