EDBT 2026 Demo / reviewers in the wild / expert
Aidan Roy
dblp:36/1193
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2Security and privacy · 1 · 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
2 papers |
Automated reasoning and model checking · 57% Quantum computing and quantum information · 25% Coding theory · 9% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Quantum computing and quantum information › quantum computational models
quantum annealing |
0.4 | 1 | 2020 | Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results · Inf. Comput. 2020 |
Automated reasoning and model checking
satisfiability |
0.4 | 1 | 2020 | Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results · Inf. Comput. 2020 |
Automated reasoning and model checking › satisfiability
SAT solving |
0.4 | 1 | 2020 | Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results · Inf. Comput. 2020 |
Mathematical optimization
combinatorial optimization |
0.1 | 1 | 2020 | Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results · Inf. Comput. 2020 |
Automated reasoning and model checking › satisfiability
maximum satisfiability |
0.1 | 1 | 2020 | Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results · Inf. Comput. 2020 |
Coding theory › error-correcting codes › block codes
linear code |
0.1 | 1 | 2008 | Two Characterizations of Crooked Functions · IEEE Trans. Inf. Theory 2008 |
Graph algorithms and graph theory
graph theory |
0.0 | 1 | 2008 | Two Characterizations of Crooked Functions · IEEE Trans. Inf. Theory 2008 |
Methods — techniques the papers use, named apart from their topics
quantum annealing · 0.4code distance analysis · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results
Zhengbing Bian, Fabián A. Chudak, William G. Macready, Aidan Roy, Roberto Sebastiani, Stefano Varotti |
Inf. Comput. | 4 |
| 2009 | Unitary designs and codes
Aidan Roy, A. J. Scott |
Des. Codes Cryptogr. | 1 |
| 2008 | Two Characterizations of Crooked FunctionsabstractIn this correspondence, we give two characterizations of crooked functions: one based on the minimum distance of a Preparata-like code, and the other based on the distance-regularity of a crooked graph. Chris D. Godsil, Aidan Roy |
IEEE Trans. Inf. Theory | 2 |