Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID17th CiE 2021: Virtual Event / Ghent, Belgium
- Liesbeth De Mol, Andreas Weiermann, Florin Manea
, David Fernández-Duque:
Connecting with Computability - 17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 5-9, 2021, Proceedings. Lecture Notes in Computer Science 12813, Springer 2021, ISBN 978-3-030-80048-2 - Pavel Alaev, Victor L. Selivanov:
Searching for Applicable Versions of Computable Structures. 1-11 - Melissa Antonelli, Ugo Dal Lago, Paolo Pistone:
On Measure Quantifiers in First-Order Arithmetic. 12-24 - Julian Berger, Maximilian Böther, Vanja Doskoc, Jonathan Gadea Harder, Nicolas Klodt, Timo Kötzing, Winfried Lötzsch, Jannik Peters, Leon Schiller, Lars Seifert, Armin Wells, Simon Wietheger:
Learning Languages with Decidable Hypotheses. 25-37 - Sebastian Berndt, Kilian Grage, Klaus Jansen, Lukas Johannsen, Maria Kosche:
Robust Online Algorithms for Dynamic Choosing Problems. 38-49 - Samuel D. Birns, Bjørn Kjos-Hanssen:
On the Degrees of Constructively Immune Sets. 50-59 - Karl Bringmann:
Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry. 60-70 - Merlin Carl:
The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines. 71-81 - Merlin Carl, Lorenzo Galeotti, Robert Paßmann:
Randomising Realizability. 82-93 - Lorenzo Carlucci:
Restrictions of Hindman's Theorem: An Overview. 94-105 - Richard Krogman, Douglas Cenzer:
Complexity and Categoricity of Injection Structures Induced by Finite State Transducers. 106-119 - Rayan Chikhi:
A Tale of Optimizing the Space Taken by de Bruijn Graphs. 120-134 - Liron Cohen:
Formally Computing with the Non-computable. 135-145 - Vanja Doskoc, Timo Kötzing:
Mapping Monotonic Restrictions in Inductive Inference. 146-157 - Vanja Doskoc, Timo Kötzing:
Normal Forms for Semantically Witness-Based Learners in Inductive Inference. 158-168 - Jordan M. Eizenga, Ryan Lorig-Roach, Melissa M. Meredith, Benedict Paten:
Walk-Preserving Transformation of Overlapped Sequence Graphs into Blunt Sequence Graphs with GetBlunted. 169-177 - Esther Ezra:
On 3SUM-hard Problems in the Decision Tree Model. 178-188 - Marat Kh. Faizrahmanov:
Limitwise Monotonic Spectra and Their Generalizations. 189-198 - Fernando Ferreira:
On False Heine/Borel Compactness Principles in Proof Mining. 199-203 - Till Fluschnik, Leon Kellerhals:
Placing Green Bridges Optimally, with a Multivariate Analysis. 204-216 - Johanna N. Y. Franklin:
A Church-Turing Thesis for Randomness? 217-226 - Askar Gafurov, Tomás Vinar, Brona Brejová:
Probabilistic Models of k-mer Frequencies (Extended Abstract). 227-236 - Francesco A. Genco, Francesca Poggiolesi:
Defining Formal Explanation in Classical Logic by Substructural Derivability. 237-247 - Ivan Georgiev:
Dedekind Cuts and Long Strings of Zeros in Base Expansions. 248-259 - Eric Goles, Pedro Montealegre, Martín Ríos Wilson, Guillaume Theyssier:
On the Impact of Treewidth in the Computational Complexity of Freezing Dynamics. 260-272 - Ardalan Khazraei, Timo Kötzing, Karen Seidel:
Towards a Map for Incremental Learning in the Limit from Positive and Negative Information. 273-284 - Angeliki Koutsoukou-Argyraki:
On Preserving the Computational Content of Mathematical Proofs: Toy Examples for a Formalising Strategy. 285-296 - Leszek Aleksander Kolodziejczyk, Keita Yokoyama:
In Search of the First-Order Part of Ramsey's Theorem for Pairs. 297-307 - Lars Kristiansen:
On Subrecursive Representation of Irrational Numbers: Contractors and Baire Sequences. 308-317 - Timo Kötzing, Karen Seidel:
Learning Languages in the Limit from Positive Information with Finitely Many Memory Changes. 318-329 - Markus Lohrey:
Compression Techniques in Group Theory. 330-341 - Russell Miller:
Computable Procedures for Fields. 342-352 - Joan Rand Moschovakis, Garyfallia Vafeiadou:
Minimum Classical Extensions of Constructive Theories. 353-362 - Jean-Yves Moyen, Jakob Grue Simonsen:
Subrecursive Equivalence Relations and (non-)Closure Under Lattice Operations. 363-372 - Léo Robert, Daiki Miyahara, Pascal Lafourcade, Takaaki Mizuki:
Interactive Physical ZKP for Connectivity: Applications to Nurikabe and Hitori. 373-384 - Barbara F. Csima, Dino Rossegger, Daniel Yu:
Positive Enumerable Functors. 385-394 - Sam Sanders:
Splittings and Robustness for the Heine-Borel Theorem. 395-406 - Victor L. Selivanov:
Non-collapse of the Effective Wadge Hierarchy. 407-416 - Andrea Sorbi:
Effective Inseparability and Its Applications. 417-423 - Tomasz Steifer:
Simple Betting and Stochasticity. 424-433 - Máté Szabó:
Péter on Church's Thesis, Constructivity and Computers. 434-445 - D. A. Turner:
Constructive Mathematics, Church's Thesis, and Free Choice Sequences. 446-456 - Bjørn Kjos-Hanssen, David J. Webb:
KL-Randomness and Effective Dimension Under Strong Reducibility. 457-468 - Franziskus Wiesnet:
An Algorithmic Version of Zariski's Lemma. 469-482 - Henry Yuen:
Einstein Meets Turing: The Computability of Nonlocal Games. 483-493 - Daniel Silva Graça, Ning Zhong:
Computability of Limit Sets for Two-Dimensional Flows. 494-503
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 2024-04-30 21:07 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:
