Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID18th CiE 2022: Swansea, UK
- Ulrich Berger
, Johanna N. Y. Franklin, Florin Manea, Arno Pauly:
Revolutions and Revelations in Computability - 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11-15, 2022, Proceedings. Lecture Notes in Computer Science 13359, Springer 2022, ISBN 978-3-031-08739-4
- Nikolay Bazhenov, Vittorio Cipriani, Luca San Mauro:
Calculating the Mind Change Complexity of Learning Algebraic Structures. 1-12 - Nikolay Bazhenov, Maxim V. Zubkov:
Well-Orders Realized by C.E. Equivalence Relations. 13-23 - Ingo Blechschmidt, Peter Schuster:
Maximal Ideals in Countable Rings, Constructively. 24-38 - Olivier Bournez:
Programming with Ordinary Differential Equations: Some First Steps Towards a Programming Language. 39-51 - Véronique Bruyère:
A Game-Theoretic Approach for the Synthesis of Complex Systems. 52-63 - Merlin Carl:
Lower Bounds on β (α ). 64-73 - Anupam Das, Avgerinos Delkos:
Proof Complexity of Monotone Branching Programs. 74-87 - Matthew de Brecht, Takayuki Kihara, Victor L. Selivanov:
Enumerating Classes of Effective Quasi-Polish Spaces. 88-102 - Vanja Doskoc, Timo Kötzing:
Maps of Restrictions for Behaviourally Correct Learning. 103-114 - Makoto Fujiwara:
An Extension of the Equivalence Between Brouwer's Fan Theorem and Weak König's Lemma with a Uniqueness Hypothesis. 115-124 - Lauri Hella, Miikka Vilander:
Defining Long Words Succinctly in FO and MSO. 125-138 - María Dolores Jiménez-López:
Processing Natural Language with Biomolecules: Where Linguistics, Biology and Computation Meet. 139-150 - Bjørn Kjos-Hanssen, David J. Webb:
Strong Medvedev Reducibilities and the KL-Randomness Problem. 151-161 - Robert S. Lubarsky:
On the Necessity of Some Topological Spaces. 162-171 - Samuele Maschio, Pietro Sabelli:
On the Compatibility Between the Minimalist Foundation and Constructive Set Theory. 172-185 - Kitty Meeks:
Reducing Reachability in Temporal Graphs: Towards a More Realistic Model of Real-World Spreading Processes. 186-195 - Juvenal Murwanashyaka:
Hilbert's Tenth Problem for Term Algebras with a Substitution Operator. 196-207 - Juvenal Murwanashyaka:
Weak Sequential Theories of Finite Full Binary Trees. 208-219 - Eike Neumann:
On Envelopes and Backward Approximations. 220-233 - Keng Meng Ng, Frank Stephan, Yue Yang, Liang Yu:
On Trees Without Hyperimmune Branches. 234-245 - Iosif Petrakis, Daniel Misselbeck-Wessel:
Algebras of Complemented Subsets. 246-258 - Pierre Pradic, Giovanni Solda:
On the Weihrauch Degree of the Additive Ramsey Theorem over the Rationals. 259-271 - Sam Sanders:
Reverse Mathematics of the Uncountability of ℝ. 272-286 - Victor L. Selivanov:
Boole vs Wadge: Comparing Two Basic Tools of Descriptive Set Theory. 287-298 - Svetlana Selivanova:
Computational Complexity of Classical Solutions of Partial Differential Equations. 299-312 - William R. Stirton:
Barendregt's Problem #26 and Combinatory Strong Reduction. 313-326
a service of 
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 2023-09-29 23:24 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:
