Demo Data from EDBT 2026 / reviewers in the wild / expert
Mikhail Bernadsky
dblp:24/557
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2004
0009-0006-4271-2227ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1
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 |
Automated reasoning and model checking · 39% Automata and formal languages · 30% Logic in computer science · 30% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automated reasoning and model checking
reachability |
0.0 | 1 | 2004 | Optimal Reachability for Weighted Timed Games · ICALP 2004 |
Automata and formal languages › timed automata
timed games |
0.0 | 1 | 2004 | Optimal Reachability for Weighted Timed Games · ICALP 2004 |
Logic in computer science › transition systems › timed systems
weighted timed games |
0.0 | 1 | 2004 | Optimal Reachability for Weighted Timed Games · ICALP 2004 |
Automated reasoning and model checking
real-time systems |
0.0 | 1 | 2004 | Optimal Reachability for Weighted Timed Games · ICALP 2004 |
Methods — techniques the papers use, named apart from their topics
reachability analysis · 0.0game theory · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2004 | Optimal Reachability for Weighted Timed Games
Rajeev Alur, Mikhail Bernadsky, P. Madhusudan |
ICALP | 2 |