default search action
Theoretical Computer Science, Volume 800
Volume 800, December 2019
- Manfred Droste, Ilias S. Kotsireas, Robert Rolland:
Preface. 1-2 - Gregory V. Bard:
Determining whether a given cryptographic function is a permutation of another given cryptographic function - A problem in intellectual property. 3-14 - Pascal Caron, Jean-Gabriel Luque, Bruno Patrou:
State complexity of combined operations involving catenation and binary Boolean operations: Beyond the Brzozowski conjectures. 15-30 - Charles J. Colbourn, Ryan E. Dougherty, Daniel Horsley:
Distributing hash families with few rows. 31-41 - Nikolaos Doukas, Oleksandr P. Markovskyi, Nikolaos G. Bardis:
Hash function design for cloud storage data auditing. 42-51 - Gérard H. E. Duchamp, Vincel Hoang Ngoc Minh, Quoc Hoan Ngô:
Kleene stars of the plane, polylogarithms and symmetries. 52-72 - Georgios Fotiadis, Elisavet Konstantinou:
TNFS resistant families of pairing-friendly elliptic curves. 73-89 - Ludwig Kampel, Manuel Leithner, Bernhard Garn, Dimitris E. Simos:
Problems and algorithms for covering arrays via set covers. 90-106 - Ludwig Kampel, Dimitris E. Simos:
A survey on the state of the art of complexity problems for covering arrays. 107-124 - Ondrej Klíma, Libor Polák:
Syntactic structures of regular languages. 125-141 - Petr Lisonek:
Kochen-Specker sets and Hadamard matrices. 142-145 - Lucia Moura, Sebastian Raaphorst, Brett Stevens:
Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma. 146-154 - Jean-Éric Pin, Xaro Soler-Escrivà:
Languages and formations generated by D4 and Q8. 155-172 - Takis Sakkalis, Kwanghee Ko, Galam Song:
Roots of quaternion polynomials: Theory and computation. 173-178
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.