default search action
16th CiE 2020: Fisciano, Italy
- Marcella Anselmo
, Gianluca Della Vedova
Beyond the Horizon of Computability - 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29 - July 3, 2020, Proceedings. Lecture Notes in Computer Science 12098, Springer 2020, ISBN 978-3-030-51465-5 - Nikolay Bazhenov
A Note on Computable Embeddings for Ordinals and Their Reverses. 1-13 - Merlin Carl:
Clockability for Ordinal Turing Machines. 14-25 - Matthew de Brecht:
Some Notes on Spaces of Ideals and Computable Topology. 26-37 - Makoto Fujiwara
Parallelizations in Weihrauch Reducibility and Constructive Reverse Mathematics. 38-49 - Sune Kristian Jakobsen, Jakob Grue Simonsen:
Liouville Numbers and the Computational Complexity of Changing Bases. 50-62 - Lars Kristiansen, Juvenal Murwanashyaka
On Interpretability Between Some Weak Essentially Undecidable Theories. 63-74 - Lars Kristiansen, Jakob Grue Simonsen:
On the Complexity of Conversion Between Classic Real Number Representations. 75-86 - Martin Kutrib
Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power. 87-99 - Rodney G. Downey, Alexander G. Melnikov
Computable Analysis and Classification Problems. 100-111 - Russell Miller:
Non-coding Enumeration Operators. 112-123 - Thomas Zeugmann:
On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive Numberings. 124-136 - Ulrich Berger, Olga Petrovska
Prawf: An Interactive Proof System for Program Extraction. 137-148 - Manuel Bodirsky
ASNP: A Tame Fragment of Existential Second-Order Logic. 149-162 - David Fernández-Duque
Ackermannian Goodstein Sequences of Intermediate Growth. 163-174 - Zuzana Haniková
On the Complexity of Validity Degrees in Łukasiewicz Logic. 175-188 - Mathieu Hoyrup, Takayuki Kihara
Degrees of Non-computability of Homeomorphism Types of Polish Spaces. 189-192 - Stéphane Le Roux:
Time-Aware Uniformization of Winning Strategies. 193-204 - Donghyun Lim
Quantitative Coding and Complexity Theory of Compact Metric Spaces. 205-214 - Iosif Petrakis
Functions of Baire Class One over a Bishop Topology. 215-227 - Andrea Frosini, Giulia Palma, Simone Rinaldi
Combinatorial Properties of Degree Sequences of 3-Uniform Hypergraphs Arising from Saind Arrays. 228-238 - Peter Schuster
The Computational Significance of Hausdorff's Maximal Chain Principle. 239-250 - Cyril Banderier
Number of Prefixes in Trace Monoids: Clique Polynomials and Dependency Graphs. 251-263 - Antonio Boccuto
Repetitions in Toeplitz Words and the Thue Threshold. 264-276 - Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier:
On Simulation in Automata Networks. 277-288 - Stavros Konstantinidis
Theoretical and Implementational Aspects of the Formal Language Server (LaSer). 289-295 - Markus Lohrey:
Balancing Straight-Line Programs for Strings and Trees. 296-300 - Maria Madonia:
Two-Dimensional Codes. 301-305 - Wim Martens:
Formal Languages in Information Extraction and Graph Databases. 306-309 - Shay Moran, Ido Nachum, Itai Panasoff, Amir Yehudayoff:
On the Perceptron's Compression. 310-325 - Kévin Perrot, Sylvain Sené, Lucas Venturini:
#P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method. 326-338 - Nicola Prezza
Faster Online Computation of the Succinct Longest Previous Factor Array. 339-352 - Przemyslaw Uznanski
Recent Advances in Text-to-Pattern Distance Algorithms. 353-365 - Martin Vu, Henning Fernau
Insertion-Deletion Systems with Substitutions I. 366-378
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 2024-12-19 22:02 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: