EDBT 2026 Demo / reviewers in the wild / expert
Heger Arfaoui
dblp:116/4885
· DBLP profile ↗
5ranked-venue papers
5as first author
0since 2021 · last 2020
0009-0003-4897-2044ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 2 first-authorTheory of computation · 2 · 2 first-authorSecurity 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
1 paper |
Distributed computing theory · 39% Algorithmic game theory and mechanism design · 30% Quantum computing and quantum information · 30% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithmic game theory and mechanism design › non-cooperative game
boolean games |
0.1 | 1 | 2012 | Brief announcement: what can be computed without communication? · PODC 2012 |
Distributed computing theory
distributed verification |
0.1 | 1 | 2012 | Brief announcement: what can be computed without communication? · PODC 2012 |
Quantum computing and quantum information › quantum information theory
quantum correlations |
0.1 | 1 | 2012 | Brief announcement: what can be computed without communication? · PODC 2012 |
Methods — techniques the papers use, named apart from their topics
quantum entanglement · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Deciding and verifying network properties locally with few output bits
Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu, Andrzej Pelc |
Distributed Comput. | 1 |
| 2014 | Distributedly Testing Cycle-Freeness
Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu |
WG | 1 |
| 2013 | Local Decision and Verification with Bounded-Size Outputs
Heger Arfaoui, Pierre Fraigniaud, Andrzej Pelc |
SSS | 1 |
| 2012 | Brief announcement: what can be computed without communication?abstractWhen playing the boolean game (δ,f), two players, upon reception of respective inputs x and y, must respectively output a and b satisfying δ(a, b)=f(x, y), in absence of any communication. It is known that, for δ(a, b)=a ⊕ b, the ability for the players to use entangled quantum bits (qbits) helps. In this paper, we show that, for δ different from the exclusive-or operator, quantum correlations do not help. This result is an invitation to revisit the theory of distributed checking, a.k.a. distributed verification, currently sticked to the usage of decision functions δ based on the AND-operator, hence potentially preventing us from using the potential benefit of quantum effects. Heger Arfaoui, Pierre Fraigniaud |
PODC | 1 |
| 2012 | What Can Be Computed without Communications?
Heger Arfaoui, Pierre Fraigniaud |
SIROCCO | 1 |