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

Kerry Ojakian

dblp:59/6574 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · none

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

Theory of computation · 4 · 1 first-author

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 · 50% Logic in computer science · 50%

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

TopicWeightPapersLastEvidence papers
Computational complexity › computability theory
computable analysis		 0.112011
A characterization of computable analysis on unbounded domains using differential equations · Inf. Comput. 2011

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

differential equations · 0.1
YearPublicationVenuePosition
2019 Comparing the power of cops to zombies in pursuit-evasion games
David Offner, Kerry Ojakian
 Discret. Appl. Math.2
2011 A characterization of computable analysis on unbounded domains using differential equations
Manuel Lameiras Campagnolo, Kerry Ojakian
 Inf. Comput.2
2007 Using Approximation to Relate Computational Classes over the Reals
Manuel Lameiras Campagnolo, Kerry Ojakian
 MCU2
2005 Upper and lower Ramsey bounds in bounded arithmetic
Kerry Ojakian
 Ann. Pure Appl. Log.1