default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 856
Volume 856, February 2021
- Christian Deppe
, Vladimir S. Lebedev, Georg Maringer:
Bounds for the capacity error function for unidirectional channels with noiseless feedback. 1-13 - Nikolai K. Vereshchagin:
Proofs of conservation inequalities for Levin's notion of mutual information of 1974. 14-20 - Tyler Schrock, Rafael M. Frongillo:
Computational complexity of k-block conjugacy. 21-40 - Stanley P. Y. Fung:
Online two-way trading: Randomization and advice. 41-50 - Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen:
A hierarchy of local decision. 51-67 - Kristóf Bérczi, Endre Boros, Ondrej Cepek, Khaled M. Elbassioni, Petr Kucera, Kazuhisa Makino:
Generating clause sequences of a CNF formula. 68-74 - Yu-Huei Chang, Kung-Jui Pai, Chiun-Chieh Hsu, Jinn-Shyong Yang, Jou-Ming Chang:
Constructing dual-CISTs of folded divide-and-swap cubes. 75-87 - Kei Kimura, Akira Suzuki:
Trichotomy for the reconfiguration problem of integer linear systems. 88-109 - Aida Abiad, Boris Brimkov, Alexander Grigoriev:
On the status sequences of trees. 110-120 - Remie Janssen, Yukihiro Murakami:
On cherry-picking and network containment. 121-150 - Veronika Prokhorchuk:
Generation of amalgamated free products of cyclic groups by finite automata over minimal alphabet. 151-164 - Edy Tri Baskoro, Devi Imulia Dian Primaskun:
Improved algorithm for the locating-chromatic number of trees. 165-168 - Yaqiao Li:
Conflict complexity is lower bounded by block sensitivity. 169-172
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.
last updated on 2025-12-12 22:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
