default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19th CiE 2023: Batumi, Georgia
- Gianluca Della Vedova
, Besik Dundua, Steffen Lempp, Florin Manea:
Unity of Logic and Computation - 19th Conference on Computability in Europe, CiE 2023, Batumi, Georgia, July 24-28, 2023, Proceedings. Lecture Notes in Computer Science 13967, Springer 2023, ISBN 978-3-031-36977-3
Degree Theory
- Hong Hanh Tran, Guohua Wu:
Cupping Computably Enumerable Degrees Simultaneously. 3-16 - Mariya Ivanova Soskova:
The Relationship Between Local and Global Structure in the Enumeration Degrees. 17-22 - Russell G. Miller:
Direct Construction of Scott Ideals. 23-34
Proof Theory
- Sam Sanders:
The Non-normal Abyss in Kleene's Computability Theory. 37-49 - Gabriele Buriola, Peter Schuster, Ingo Blechschmidt:
A Constructive Picture of Noetherian Conditions and Well Quasi-orders. 50-62
Computability
- Lorenzo Galeotti, Ethan S. Lewis, Benedikt Löwe:
Symmetry for Transfinite Computability. 65-76 - Merlin Carl:
All Melodies Are Lost - Recognizability for Weak and Strong α-Register Machines. 77-88 - Takayuki Kihara, Arno Pauly:
De Groot Duality for Represented Spaces. 89-101
Algorithmic Randomness
- Alexey Milovanov:
Some Games on Turing Machines and Power from Random Strings. 105-119 - Alexander Shen:
Inequalities for Entropies and Dimensions. 120-131
Computational Complexity
- Keita Hiroshima, Akitoshi Kawamura:
Elementarily Traceable Irrational Numbers. 135-140 - Vladislav Orekhovskii, Victor L. Selivanov:
Logic vs Topology on Regular ømega-languages. 141-153 - Ivan Georgiev:
Subrecursive Graphs of Representations of Irrational Numbers. 154-165 - Vasco Brattka:
On the Complexity of Learning Programs. 166-177 - Vittorio Cipriani, Arno Pauly:
The Complexity of Finding Supergraphs. 178-189 - Victor L. Selivanov:
Extending Wagner's Hierarchy to Deterministic Visibly Pushdown Automata. 190-201 - Alexey Barsukov, Florent R. Madelaine:
On Guarded Extensions of MMSNP. 202-213 - Pacôme Perrotin, Sylvain Sené:
Turning Block-Sequential Automata Networks into Smaller Parallel Networks with Isomorphic Limit Dynamics. 214-228
Interactive Proofs
- Daniil Musatov, Georgii Potapov:
Structural Complexity of Rational Interactive Proofs. 231-245 - Suthee Ruangwises:
Physical Zero-Knowledge Proof for Ball Sort Puzzle. 246-257
Combinatorial Approaches
- Pablo Arrighi, Amélia Durbec, Pierre Guillon:
Graph Subshifts. 261-274 - Pawel Parys, Aleksander Wiacek:
Improved Complexity Analysis of Quasi-Polynomial Algorithms Solving Parity Games. 275-286 - Zeev Nutov:
An $O(\sqrt{k})$-Approximation Algorithm for Minimum Power k Edge Disjoint st-Paths. 287-296
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-04-14 20:53 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
