default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID14th CiE 2018: Kiel, Germany
- Florin Manea, Russell G. Miller, Dirk Nowotka
:
Sailing Routes in the World of Computation - 14th Conference on Computability in Europe, CiE 2018, Kiel, Germany, July 30 - August 3, 2018, Proceedings. Lecture Notes in Computer Science 10936, Springer 2018, ISBN 978-3-319-94417-3 - Bakh Khoussainov:
A Journey to Computably Enumerable Structures (Tutorial Lectures). 1-19 - Pavel Alaev, Victor L. Selivanov:
Polynomial-Time Presentations of Algebraic Number Fields. 20-29 - Klaus Ambos-Spies:
Multiple Permitting and Array Noncomputability. 30-39 - Nikolay Bazhenov, Margarita Marchuk:
Degrees of Categoricity for Prime and Homogeneous Models. 40-49 - Florent Becker, Diego Maldonado, Nicolas Ollinger, Guillaume Theyssier:
Universality in Freezing Cellular Automata. 50-59 - Christoph Benzmüller, Xavier Parent, Leendert W. N. van der Torre:
A Deontic Logic Reasoning Infrastructure. 60-69 - Ulrich Berger, Olga Petrovska:
Optimized Program Extraction for Induction and Coinduction. 70-80 - Sebastian Berndt:
Computing Tree Width: From Theory to Practice and Back. 81-88 - Sebastian Berndt, Kim-Manuel Klein:
Using Structural Properties for Integer Programs. 89-96 - Achilles A. Beros, Mushfeq Khan, Bjørn Kjos-Hanssen, André Nies:
From Eventually Different Functions to Pandemic Numberings. 97-106 - Paola Bonizzoni, Gianluca Della Vedova, Serena Nicosia, Yuri Pirola, Marco Previtali, Raffaella Rizzi:
Divide and Conquer Computation of the Multi-string BWT and LCP Array. 107-117 - Merlin Carl:
Some Observations on Infinitary Complexity. 118-125 - Merlin Carl, Sabrina Ouazzani, Philip D. Welch:
Taming Koepke's Zoo. 126-135 - Douglas Cenzer, Diego A. Rojas:
Online Computability and Differentiation in the Cantor Space. 136-145 - Martin Davis:
Turing's Vision and Deep Learning. 146-155 - Thomas Erlebach:
Computing and Scheduling with Explorable Uncertainty. 156-160 - Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier:
Diminishable Parameterized Problems and Strict Polynomial Kernelization. 161-171 - Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele:
New Nonterminal Complexity Results for Semi-conditional Grammars. 172-182 - Till Fluschnik, George B. Mertzios, André Nichterlein:
Kernelization Lower Bounds for Finding Constant-Size Subgraphs. 183-193 - Ivan Georgiev, Lars Kristiansen, Frank Stephan:
On General Sum Approximations of Irrational Numbers. 194-203 - Daniel Silva Graça, Ning Zhong:
Computability of Ordinary Differential Equations. 204-213 - Mathieu Hoyrup:
Topological Analysis of Representations. 214-223 - Ishai Kones, Asaf Levin:
A Unified Framework for Designing EPTAS's for Load Balancing on Parallel Machines. 224-233 - Margarita V. Korovina, Oleg V. Kudinov:
Weak Reduction Principle and Computable Metric Spaces. 234-243 - Lars Kristiansen, Juvenal Murwanashyaka:
Decidable and Undecidable Fragments of First-Order Concatenation Theory. 244-253 - Massimo Lauria:
Algorithm Analysis Through Proof Complexity. 254-263 - João Marques-Silva:
Computing with SAT Oracles: Past, Present and Future. 264-276 - Timothy H. McNicholl, Don M. Stull:
The Isometry Degree of a Computable Copy of 𝓁p. 277-286 - Alexey Milovanov:
Algorithmic Statistics and Prediction for Polynomial Time-Bounded Algorithms. 287-296 - Martin Monath:
A C.E. Weak Truth Table Degree Which Is Array Noncomputable and R-maximal. 297-306 - Marie Nicholson:
The Complexity of Tukey Types and Cofinal Types. 307-317 - Dag Normann:
Functionals of Type 3 as Realisers of Classical Theorems in Analysis. 318-327 - Arno Pauly:
Enumeration Degrees and Topology. 328-337 - Paula Quinon:
A Taxonomy of Deviant Encodings. 338-348 - Dino Rossegger:
Elementary Bi-embeddability Spectra of Structures. 349-358 - Alexander N. Rybalov:
A Generic m-Reducibility. 359-364 - Sam Sanders:
Some Nonstandard Equivalences in Reverse Mathematics. 365-375 - Svetlana V. Selivanova, Victor L. Selivanov:
Bit Complexity of Computing Solutions for Symmetric Hyperbolic Systems of PDEs (Extended Abstract). 376-385 - Wilfried Sieg:
What Is the Concept of Computation? 386-396 - André Souto, Luís Antunes, Paulo Mateus, Andreia Teixeira:
Witness Hiding Without Extractors or Simulators. 397-409 - Vladimir Uspenskiy, Alexander Shen:
Algorithms and Geometric Constructions. 410-420 - Takashi Yokomori, Fumiya Okubo:
Computing with Multisets: A Survey on Reaction Automata Theory. 421-431
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 2025-11-04 22:08 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:
