EDBT 2026 Demo / reviewers in the wild / expert
Juvenal Murwanashyaka
dblp:223/4898
· DBLP profile ↗
6ranked-venue papers
3as first author
4since 2021 · last 2024
0000-0002-7621-6540ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 6 · 3 first-author · 4 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | A Weak First-Order Theory of Sequences
Lars Kristiansen, Juvenal Murwanashyaka |
CiE | 2 |
| 2024 | There are no minimal essentially undecidable theoriesabstractAbstract We show that there is no theory that is minimal with respect to interpretability among recursively enumerable essentially undecidable theories. Juvenal Murwanashyaka, Fedor Pakhomov, Albert Visser |
J. Log. Comput. | 1 |
| 2022 | Hilbert's Tenth Problem for Term Algebras with a Substitution Operator
Juvenal Murwanashyaka |
CiE | 1 |
| 2022 | Weak Sequential Theories of Finite Full Binary Trees
Juvenal Murwanashyaka |
CiE | 1 |
| 2020 | On Interpretability Between Some Weak Essentially Undecidable Theories
Lars Kristiansen, Juvenal Murwanashyaka |
CiE | 2 |
| 2018 | Decidable and Undecidable Fragments of First-Order Concatenation Theory
Lars Kristiansen, Juvenal Murwanashyaka |
CiE | 2 |