Demo Data from EDBT 2026 / reviewers in the wild / expert
Diep Luong-Le
dblp:412/6933
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0005-3291-010XORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 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 |
Distributed computing theory · 50% Computational complexity · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity
computability theory |
1.0 | 1 | 2026 | Brief Announcement: Is a LOCAL Algorithm Computable? · PODC 2026 |
Distributed computing theory › distributed graph algorithms
LOCAL model |
1.0 | 1 | 2026 | Brief Announcement: Is a LOCAL Algorithm Computable? · PODC 2026 |
Methods — techniques the papers use, named apart from their topics
local algorithms · 1.0computable function · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Brief Announcement: Is a LOCAL Algorithm Computable?abstractCommon definitions of the “standard” LOCAL model tend to be sloppy and even self-contradictory on one point: do the nodes update their state using an arbitrary function or a computable function? So far, this distinction has been safe to neglect, since problems where it matters seem contrived and quite different from e.g. typical local graph problems studied in this context. Antonio Cruciani, Avinandan Das, Massimo Equi, Henrik Lievonen, Diep Luong-Le, Augusto Modanese, Jukka Suomela |
PODC | 5 |