default search action

combined dblp search
author search
venue search
publication search

ask others

Theoretical Computer Science, Volume 859

> Home > Journals > Theoretical Computer Science

Refine list

refinements active!

zoomed in on 10 of 10 records

view refined list in

export refined list as

showing all 10 records

refine by search term

refine by author

refine by access Please note:
▪ This facet is still work in progress.
▪ Open access information for publications is still rather incomplete.

Volume 859, March 2021

- view
  authority control:
- export record
  dblp key:
  - journals/tcs/AtenieseFMV21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/AtenieseFMV21
Giuseppe Ateniese, Danilo Francati, Bernardo Magri, Daniele Venturi:
Immunization against complete subversion without random oracles. 1-36
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/ShangLS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/ShangLS21
Jianhui Shang, Peng Li, Yi Shi:
The longest cycle problem is polynomial on interval graphs. 37-47
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/RongLYW21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/RongLYW21
Guozhen Rong, Wenjun Li, Yongjie Yang, Jianxin Wang:
Reconstruction and verification of chordal graphs with a distance oracle. 48-56
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/YamanakaHW21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/YamanakaHW21
Katsuhisa Yamanaka, Takashi Horiyama, Kunihiro Wasa:
Optimal reconfiguration of optimal ladder lotteries. 57-69
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/Dekking21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Dekking21
F. Michel Dekking:
The sum of digits functions of the Zeckendorf and the base phi expansions. 70-79
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/MoralesLFPTT21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/MoralesLFPTT21
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
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/FunakoshiNIBT21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/FunakoshiNIBT21
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing longest palindromic substring after single-character or block-wise edits. 116-133
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/CicaleseLR21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/CicaleseLR21
Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi:
On infinite prefix normal words. 134-148
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/DArcoPS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/DArcoPS21
Paolo D'Arco, Roberto De Prisco, Alfredo De Santis:
Secret sharing schemes for infinite sets of participants: A new design technique. 149-161
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/BarthMMWW21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BarthMMWW21
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
no results

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.