| Robust Online Algorithms for Dynamic Choosing Problems
|
2021 |
Berndt, Sebastian |
| Randomising Realizability
|
2021 |
Carl, Merlin |
| Formally Computing with the Non-computable
|
2021 |
Cohen, Liron |
| Subrecursive Equivalence Relations and (non-)Closure Under Lattice Operations
|
2021 |
Moyen, Jean-Yves |
| An Algorithmic Version of Zariski’s Lemma
|
2021 |
Wiesnet, Franziskus |
| Restrictions of Hindman’s Theorem: An Overview
|
2021 |
Carlucci, Lorenzo |
| Mapping Monotonic Restrictions in Inductive Inference
|
2021 |
Doskoč, Vanja |
| On False Heine/Borel Compactness Principles in Proot Mining
|
2021 |
Ferreira, Fernando |
| On 3SUM-hard Problems in the Decision Tree Model
|
2021 |
Ezra, Esther |
| Learning Languages in the Limit from Positive Information with Finitely Many Memory Changes
|
2021 |
Kötzing, Timo |
| On Preserving the Computational Content of Mathematical Proofs: Toy Examples for a Formalising Strategy
|
2021 |
Koutsoukou-Argyraki, Angeliki |
| On Subrecursive Representation of Irrational Numbers: Contractors and Baire Sequences
|
2021 |
Kristiansen, Lars |
| Computable Procedures for Fields
|
2021 |
Miller, Russell |
| Minimum Classical Extensions of Constructive Theories
|
2021 |
Moschovakis, Joan Rand |
| Positive Enumerable Functors
|
2021 |
Csima, Barbara F. |
| Splittings and Robustness for the Heine-Borel Theorem
|
2021 |
Sanders, Sam |
| Interactive Physical ZKP for Connectivity: Applications to Nurikabe and Hitori
|
2021 |
Robert, Léo |
| Non-collapse of the Effective Wadge Hierarchy
|
2021 |
Selivanov, Victor |
| KL-Randomness and Effective Dimension Under Strong Reducibility
|
2021 |
Kjos-Hanssen, Bjørn |
| Péter on Church’s Thesis, Constructivity and Computers
|
2021 |
Szabó, Máté |
Tag hinzufügen