EDBT 2026 Demo / reviewers in the wild / expert
Daniël M. H. van Gent
dblp:277/1295
· DBLP profile ↗
2ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous computing · 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 |
Computational complexity · 87% Coding theory · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity
reduction |
0.9 | 1 | 2025 | A Search to Distinguish Reduction for the Isomorphism Problem on Direct Sum Lattices · ASIACRYPT (3) 2025 |
Computational complexity › reduction
search-to-decision reduction |
0.9 | 1 | 2025 | A Search to Distinguish Reduction for the Isomorphism Problem on Direct Sum Lattices · ASIACRYPT (3) 2025 |
Coding theory
lattice theory |
0.3 | 1 | 2025 | A Search to Distinguish Reduction for the Isomorphism Problem on Direct Sum Lattices · ASIACRYPT (3) 2025 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | A Search to Distinguish Reduction for the Isomorphism Problem on Direct Sum Lattices
Daniël M. H. van Gent, Wessel P. J. van Woerden |
ASIACRYPT (3) | 1 |
| 2020 | Order versus ChaosabstractThe positional game of Order versus Chaos can be considered a maker-breaker variant. The players Order and Chaos take turns placing circles or crosses on a board, in which the goal of Order is to create a consecutive line of identical symbols of a certain length, while Chaos aims to prevent this. In this paper, we provide some theoretical results on winning strategies for both players on finite boards of varying sizes, as well as on infinite boards. The composition of these strategies was aided by the use of Monte-Carlo Tree Search (MCTS) players, as well as a SAT solver. In addition to these theoretical results, we provide some more experimental results obtained using MCTS. Mark J. H. van den Bergh, Sipke T. Castelein, Daniël M. H. van Gent |
CoG | 3 |