Demo Data from EDBT 2026 / reviewers in the wild / expert
T. Lassagne
dblp:84/4052
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1975
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 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.
| Software engineering, system software, and programming languages
1 paper |
Compilers and program optimization · 100% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Compilers and program optimization
code generation |
0.0 | 1 | 1975 | The Generation of Optimal Code for Stack Machines · J. ACM 1975 |
Compilers and program optimization › code generation
optimal code generation |
0.0 | 1 | 1975 | The Generation of Optimal Code for Stack Machines · J. ACM 1975 |
Algorithms and data structures
dynamic programming |
0.0 | 1 | 1975 | The Generation of Optimal Code for Stack Machines · J. ACM 1975 |
Methods — techniques the papers use, named apart from their topics
dynamic programming · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1975 | The Generation of Optimal Code for Stack MachinesabstractThe problem of generating "optimal" programs for the evaluation of arithmetic expressions on a machine with a finite depth stack is studied.Efficient algorithms are given for constructing optimal programs in the case where the expressions are trees, there are no data dependencies, and the operators have limited algebraic properties. John L. Bruno, T. Lassagne |
J. ACM | 2 |