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.

Tomislav Petrovic

dblp:117/3647 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · none

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

Theory of computation · 2 · 2 first-author · 2 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
algorithmic randomness
0.512021
A universal pair of 1/2-betting strategies · Inf. Comput. 2021
YearPublicationVenuePosition
2025 Kolmogorov-Loveland betting strategies lose the Betting game on open sets
Tomislav Petrovic
Theor. Comput. Sci.1
2021 A universal pair of 1/2-betting strategies
Tomislav Petrovic
Inf. Comput.1