


default search action
Theoretical Computer Science, Volume 859
Volume 859, March 2021
- Giuseppe Ateniese

, Danilo Francati
, Bernardo Magri
, Daniele Venturi:
Immunization against complete subversion without random oracles. 1-36 - Jianhui Shang

, Peng Li
, Yi Shi:
The longest cycle problem is polynomial on interval graphs. 37-47 - Guozhen Rong, Wenjun Li, Yongjie Yang

, Jianxin Wang:
Reconstruction and verification of chordal graphs with a distance oracle. 48-56 - Katsuhisa Yamanaka, Takashi Horiyama, Kunihiro Wasa:

Optimal reconfiguration of optimal ladder lotteries. 57-69 - F. Michel Dekking:

The sum of digits functions of the Zeckendorf and the base phi expansions. 70-79 - Pedro Ramaciotti Morales

, Robin Lamarche-Perrin, Raphaël Fournier-S'niehotta, Rémy Poulain, Lionel Tabourier, Fabien Tarissan:
Measuring diversity in heterogeneous information networks. 80-115 - Mitsuru Funakoshi

, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
, Masayuki Takeda:
Computing longest palindromic substring after single-character or block-wise edits. 116-133 - Ferdinando Cicalese, Zsuzsanna Lipták

, Massimiliano Rossi:
On infinite prefix normal words. 134-148 - Paolo D'Arco, Roberto De Prisco

, Alfredo De Santis
:
Secret sharing schemes for infinite sets of participants: A new design technique. 149-161 - Dominique Barth, Thierry Mautor, Arnaud De Moissac, Dimitri Watel, Marc-Antoine Weisser:

Optimisation of electrical network configuration: Complexity and algorithms for ring topologies. 162-173

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














