default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID22nd CiE 2026: Trier, Germany
- Vasco Brattka
, Henning Fernau, Lorenzo Galeotti:
Timeless Machines: Computability Across Eras - 22nd Conference on Computability in Europe, CiE 2026, Trier, Germany, July 27-31, 2026, Proceedings. Lecture Notes in Computer Science 16674, Springer 2027, ISBN 978-3-032-31347-8
Invited Papers
- Olivier Bournez:
Ordinary Differential Equations as a Universal Language for Computability and Complexity: From Polynomial Time to the Hyperarithmetical Hierarchy. 3-22 - Dana Fisman, Elina Sudit, Oded Zimerman:
Learning Omega-Regular Languages: A Tour of Learning Results and Canonical Representations. 23-47 - Victor Mitrana:
Multisets in Reaction Systems. 48-59 - David Orellana-Martín:
Computing with Spikes and Membranes: Computability and Complexity in Spiking Neural P Systems. 60-77 - Paula Quinon:
The New French School of Philosophy of Computing. 78-85 - Thomas Seiller:
Mathematical Informatics: Algorithms. 86-105
Contributed Papers
- Nathanael L. Ackerman, Cameron E. Freer, Mostafa Mirabi:
Computable Cofinal Fraïssé Limits. 109-123 - Mikhail Andreev, Alexander Shen:
Bishop's (Up)Crossing Inequality and Lower Semicomputable Random Reals Revisited. 124-134 - Aras Bacho, Svetlana Selivanova, Martin Ziegler:
What is a Polynomial-Time Computable Square-Integrable Function? 135-149 - Nikolay Bazhenov, Manat Mustafa, Stanislav Yun:
On Computability of Ideal Lattices. 150-161 - Riccardo Borsetto, Giulio Fellin, Tarmo Uustalu, Cheng-Syuan Wan:
Glivenko's Theorem Underneath Structure. 162-177 - Merlin Carl:
Complexities of Effective Reductions with Ordinal Turing Machines. 178-192 - Lorenzo Carlucci, Giordano Celli:
Weihrauch Reducibility Between Ramsey-Type Theorems and Well-Ordering Principles at the Level of $\varSigma ^0_2$-Induction. 193-207 - Lorenzo Carlucci, Oriola Gjetaj:
Free Sets, Thin Sets and Rainbows for Barriers. 208-223 - Julianne Cruz, Sho Glashausser, Xiaoyuan Li, Neil Lutz:
Adaptive Multi-Head Finite-State Gamblers. 224-239 - Matthew de Brecht:
A Note on Computable Étale Spaces. 240-255 - Gero Ellmies, Till Fluschnik:
Placing Green Bridges Optimally for Robust Habitat Reconnection. 256-271 - Giulio Fellin, Sara Negri, Peter Schuster:
Nuclear Shifts for Conservation. 272-288 - Makoto Fujiwara:
On the $\varSigma $-Hierarchy of the Logical Principles Over Intuitionistic Predicate Logic. 289-303 - Mario Grobler, Nils Morawietz, Silas Cato Sacher:
Towards Settling the Complexity of the Lettericity Problem. 304-319 - Peter Hertling, Leonard Schulte-Michels:
Closure Properties of Left NP Real Numbers and NP Real Functions. 320-334 - John M. Hitchcock, Adewale Sekoni, Hadi Shafei:
Counting Random Oracles for the Polynomial-Time Hierarchy and Quantum Complexity Classes. 335-349 - Philip Janicki:
Tadaki Numbers and Speedability. 350-357 - Anton E. Lipin, Mikhail V. Volkov:
Adversarial Synchronization and Reset Length. 358-373 - Neil Lutz, Spencer Park Martin, Rain White:
Lines in Every Direction with No ee-Random Points. 374-388 - Katalin Anna Lázár, Florin Manea, Stefan Siemer, Timo Specht:
Self-assembly of Strings and Languages Revisited: Efficient Membership Algorithms. 389-404 - Florin Manea, Tina Ringleb, Stefan Siemer, Maximilian Winkler:
Efficiently Finding All Shortest Absent Subsequences in a String. 405-420 - A. Nakid Cordero, Isabella Scott:
Comparing the Effective Content of Subshifts. 421-436 - Eike Neumann, Margret Tembo:
Termination of Real Linear Loops. 437-452 - Reino Niskanen, Igor Potapov, James Topley:
Safety and Reachability in k-Control Games on Integer Vector Addition Systems with States. 453-468 - Arno Pauly:
Mergeable Represented Spaces. 469-481 - Subin Pulari:
On Normality and Equidistribution for Separator Enumerators. 482-497 - Sam Sanders:
On the Reverse Mathematics of Darboux's Supremum Principle. 498-513 - Dag Normann, Sam Sanders:
On the Computational Properties of Ambivalent Sets and Functions. 514-527 - Ludwig Staiger:
A Polynomial-Time Algorithm for the Automatic Baire Property. 528-536 - Patrick Uftring:
The More Gödels, the Better. 537-552
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 2026-08-03 00:16 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
