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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Prohrak Kruengthomya

dblp:256/5143 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none

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

Theory of computation · 2 · 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 · 77% Combinatorics and discrete mathematics · 23%

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

TopicWeightPapersLastEvidence papers
Computational complexity › complexity classes
polynomial-time computability		 0.612022
Cayley polynomial-time computable groups · Inf. Comput. 2022
Combinatorics and discrete mathematics
group theory		 0.212022
Cayley polynomial-time computable groups · Inf. Comput. 2022
YearPublicationVenuePosition
2022 Cayley polynomial-time computable groups
Dmitry Berdinsky, Murray Elder, Prohrak Kruengthomya
 Inf. Comput.3
2020 Nonstandard Cayley Automatic Representations for Fundamental Groups of Torus Bundles over the Circle
Dmitry Berdinsky, Prohrak Kruengthomya
 LATA2