Demo Data from EDBT 2026 / reviewers in the wild / expert
Remi Delannoy
dblp:326/0297
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 1 first-author · 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 |
Algorithms and data structures · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithms and data structures
counting and sampling |
0.6 | 1 | 2022 | On Almost-Uniform Generation of SAT Solutions: The power of 3-wise independent hashing · LICS 2022 |
Algorithms and data structures
randomized algorithms |
0.6 | 1 | 2022 | On Almost-Uniform Generation of SAT Solutions: The power of 3-wise independent hashing · LICS 2022 |
Methods — techniques the papers use, named apart from their topics
SAT oracle · 0.63-wise independent hashing · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | On Almost-Uniform Generation of SAT Solutions: The power of 3-wise independent hashingabstractGiven a Boolean formula φ and a distribution parameter ε, the problem of almost-uniform generation seeks to design a randomized generator such that every solution of φ is output with probability within (1 + ε)-factor of where sol(φ) is the set of all the solutions of φ. The prior state of the art scheme due to Jerrum, Valiant, and Vazirani, makes calls to a SAT oracle and employs 2 − wise independent hash functions. Remi Delannoy, Kuldeep S. Meel |
LICS | 1 |