


default search action
Theoretical Computer Science, Volume 889
Volume 889, October 2021
- Mateus Rodrigues Alves, Mateus de Oliveira Oliveira

, Janio Carlos Nascimento Silva
, Uéverton dos Santos Souza
:
Succinct certification of monotone circuits. 1-13 - Jin-Yi Cai, Artem Govorov:

The complexity of counting edge colorings for simple graphs. 14-24 - Tzu-Liang Kung, Yuan-Hsiang Teng, Cheng-Kuan Lin:

Super fault-tolerance assessment of locally twisted cubes based on the structure connectivity. 25-40 - Bernd Gärtner, Ahad N. Zehmakan

:
Majority rule cellular automata. 41-59 - Gordon Hoi, Frank Stephan:

Improved algorithms for the general exact satisfiability problem. 60-84 - Nour El Houda Tellache

:
New complexity results for shop scheduling problems with agreement graphs. 85-95 - He Li, Shumin Zhang, Chengfu Ye, Shuming Zhou:

The g-component connectivity of graphs. 96-104 - Francisco J. Soulignac:

A certifying and dynamic algorithm for the recognition of proper circular-arc graphs. 105-134 - Mengce Zheng

, Noboru Kunihiro, Yuanzhi Yao
:
Cryptanalysis of the RSA variant based on cubic Pell equation. 135-144 - Somayeh Dolatnezhad Samarin, Dario Fiore, Daniele Venturi, Morteza Amini

:
A compiler for multi-key homomorphic signatures for Turing machines. 145-170 - A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz:

Minimizing total interference in asymmetric sensor networks. 171-181 - Xingfu Li, Guihai Yu, Sandi Klavzar, Jie Hu, Bo Li:

The Steiner k-eccentricity on trees. 182-188

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














