Demo Data from VLDB 2026 / reviewers in the wild / expert
Gilles Deslauriers
dblp:15/5992
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1992
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 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 |
Coding theory · 75% Information theory · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory › probability theory › stochastic processes › markov processes
branching process |
0.0 | 1 | 1992 | A branching process analysis of the stack algorithm for variable channel conditions · IEEE Trans. Inf. Theory 1992 |
Coding theory
channel coding |
0.0 | 1 | 1992 | A branching process analysis of the stack algorithm for variable channel conditions · IEEE Trans. Inf. Theory 1992 |
Coding theory › error-correcting codes › decoding
sequential decoding |
0.0 | 1 | 1992 | A branching process analysis of the stack algorithm for variable channel conditions · IEEE Trans. Inf. Theory 1992 |
Coding theory › error-correcting codes › decoding › sequential decoding
stack decoding |
0.0 | 1 | 1992 | A branching process analysis of the stack algorithm for variable channel conditions · IEEE Trans. Inf. Theory 1992 |
Methods — techniques the papers use, named apart from their topics
branching process analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1992 | A branching process analysis of the stack algorithm for variable channel conditionsabstractA branching process analysis in a random environment is presented for bounding the average number of computations of sequential decoding over a finite state channel. Closed-form expressions applicable to specific cases are derived and evaluated. These unique bounds substantially reduce the need for lengthy simulations.> Marie-José Montpetit, David Haccoun, Gilles Deslauriers |
IEEE Trans. Inf. Theory | 3 |