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

Ilya Mezhirov

dblp:98/4988 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2012
—ORCID · none

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

Theory of computation · 5 · 3 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
Logic in computer science · 50% Computational complexity · 50%

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

TopicWeightPapersLastEvidence papers
Logic in computer science
constructive mathematics		 0.112012
A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points · Inf. Comput. 2012
Computational complexity › algorithmic randomness
martin-löf randomness		 0.112012
A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points · Inf. Comput. 2012
YearPublicationVenuePosition
2012 A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
Laurent Bienvenu, Adam R. Day, Mathieu Hoyrup, Ilya Mezhirov, Alexander Shen 0001
 Inf. Comput.4
2010 Ergodic-Type Characterizations of Algorithmic Randomness
Laurent Bienvenu, Adam R. Day, Ilya Mezhirov, Alexander Shen 0001
 CiE3
2010 On abstract resource semantics and computability logic
Ilya Mezhirov, Nikolai K. Vereshchagin
 J. Comput. Syst. Sci.1
2008 On Game Semantics of the Affine and Intuitionistic Logics
Ilya Mezhirov, Nikolai K. Vereshchagin
 WoLLIC1
2006 A Game Semantics for Grz
abstract
We present a game semantics for modal propositional logic Grz. Since intuitionistic logic may be embedded into Grz, the semantics also covers intuitionistic propositional logic. That semantics is simpler than Lorenzen's ‘dialogue’ games, but lacks predicates.
Ilya Mezhirov
 J. Log. Comput.1