


default search action
Theoretical Computer Science, Volume 851
Volume 851, January 2021
- Lila Kari:

Editorial. iii - Daphne Der-Fen Liu, Laxman Saha

, Satyabrata Das:
Improved lower bounds for the radio number of trees. 1-13 - Jiafei Liu

, Shuming Zhou, Zhendong Gu, Qianru Zhou, Dajin Wang:
Fault diagnosability of Bicube networks under the PMC diagnostic model. 14-23 - Benjamin Doerr:

Exponential upper bounds for the runtime of randomized search heuristics. 24-38 - Michael Christensen

, Joseph McMahan, Lawton Nichols, Jared Roesch, Timothy Sherwood
, Ben Hardekopf
:
Safe functional systems through integrity types and verified assembly. 39-61 - Diego Minatel

, Vinícius Ferreira, Alneu de Andrade Lopes:
Local-entity resolution for building location-based social networks by using stay points. 62-76 - Yue Huang, Wenmei Yi, Hong Peng, Jun Wang, Xiaohui Luo, Qian Yang:

Computational power of dynamic threshold neural P systems for generating string languages. 77-91 - Johan Kopra:

On the trace subshifts of fractional multiplication automata. 92-110 - Pankaj Kumar Singh

, Surabhi Tiwari:
A fixed point theorem in rough semi-linear uniform spaces. 111-120 - Benjamin Doerr, Martin S. Krejca:

A simplified run time analysis of the univariate marginal distribution algorithm on LeadingOnes. 121-128 - Yasuhiro Takahashi, Seiichiro Tani:

Power of uninitialized qubits in shallow quantum circuits. 129-153

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














