Lecture Notes in Computer Science - Beyond the Horizon of Computability
Latest Publications

TOTAL DOCUMENTS

34

(FIVE YEARS 34)

H-INDEX

1

(FIVE YEARS 1)

Published By Springer International Publishing

9783030514655, 9783030514662

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Correction to: #P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method

Lecture Notes in Computer Science - Beyond the Horizon of Computability ◽

10.1007/978-3-030-51466-2_34 ◽

2021 ◽

pp. C1-C1

Author(s):

Kévin Perrot ◽

Sylvain Sené ◽

Lucas Venturini

Keyword(s):

Decomposition Method ◽

Parallel Decomposition

Download Full-text

Two-Dimensional Codes

Lecture Notes in Computer Science - Beyond the Horizon of Computability ◽

10.1007/978-3-030-51466-2_27 ◽

2020 ◽

pp. 301-305

Author(s):

Maria Madonia

Keyword(s):

Two Dimensional

Download Full-text

Recent Advances in Text-to-Pattern Distance Algorithms

Lecture Notes in Computer Science - Beyond the Horizon of Computability ◽

10.1007/978-3-030-51466-2_32 ◽

2020 ◽

pp. 353-365

Author(s):

Przemysław Uznański

Keyword(s):

Recent Advances

Download Full-text

Repetitions in Toeplitz Words and the Thue Threshold

Lecture Notes in Computer Science - Beyond the Horizon of Computability ◽

10.1007/978-3-030-51466-2_23 ◽

2020 ◽

pp. 264-276

Author(s):

Antonio Boccuto ◽

Arturo Carpi

Download Full-text

Time-Aware Uniformization of Winning Strategies

Lecture Notes in Computer Science - Beyond the Horizon of Computability ◽

10.1007/978-3-030-51466-2_17 ◽

2020 ◽

pp. 193-204

Author(s):

Stéphane Le Roux

Keyword(s):

Winning Strategies ◽

Download Full-text

On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive Numberings

Lecture Notes in Computer Science - Beyond the Horizon of Computability ◽

10.1007/978-3-030-51466-2_11 ◽

2020 ◽

pp. 124-136

Author(s):

Thomas Zeugmann

Keyword(s):

Complexity Theory ◽

Inductive Inference ◽

Recursive Functions

Download Full-text

Balancing Straight-Line Programs for Strings and Trees

Lecture Notes in Computer Science - Beyond the Horizon of Computability ◽

10.1007/978-3-030-51466-2_26 ◽

2020 ◽

pp. 296-300

Author(s):

Markus Lohrey

Keyword(s):

Straight Line ◽

Straight Line Programs

Download Full-text

#P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method

Lecture Notes in Computer Science - Beyond the Horizon of Computability ◽

10.1007/978-3-030-51466-2_30 ◽

2020 ◽

pp. 326-338

Author(s):

Camille Noûs ◽

Kévin Perrot ◽

Sylvain Sené ◽

Lucas Venturini

Keyword(s):

Decomposition Method ◽

Parallel Decomposition

Download Full-text

Formal Languages in Information Extraction and Graph Databases

Lecture Notes in Computer Science - Beyond the Horizon of Computability ◽

10.1007/978-3-030-51466-2_28 ◽

2020 ◽

pp. 306-309

Author(s):

Wim Martens

Keyword(s):

Information Extraction ◽

Formal Languages ◽

Graph Databases

Download Full-text

On the Complexity of Conversion Between Classic Real Number Representations

Lecture Notes in Computer Science - Beyond the Horizon of Computability ◽

10.1007/978-3-030-51466-2_7 ◽

2020 ◽

pp. 75-86

Author(s):

Lars Kristiansen ◽

Jakob Grue Simonsen

Keyword(s):

Real Number ◽

Number Representations

Download Full-text