Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Daniel Coronel

dblp:115/4963 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
1since 2021 · last 2022
0000-0002-2159-0228ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Computational complexity · 100%

Topics — the 1 heaviest of 1, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational complexity
undecidability
0.312018
Non computable Mandelbrot-like sets for a one-parameter complex family · Inf. Comput. 2018

Methods — techniques the papers use, named apart from their topics

complex analysis · 0.3
YearPublicationVenuePosition
2022 Realizing semicomputable simplices by computable dynamical systems
Daniel Coronel, Alexander Frank, Mathieu Hoyrup, Cristobal Rojas
Theor. Comput. Sci.1
2018 Non computable Mandelbrot-like sets for a one-parameter complex family
Daniel Coronel, Cristobal Rojas, Michael Yampolsky
Inf. Comput.1