VLDB 2026 Research / reviewers in the wild / expert
L. J. Russell
dblp:58/263
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1964
—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 · 81% Programming languages and type systems · 19% |
Topics — the 3 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Compilers and program optimization
code generation |
0.0 | 1 | 1964 | Single-Scan Techniques for the Translation of Arithmetic Expressions into ALGOL 60 · J. ACM 1964 |
Programming languages and type systems › language design
ALGOL 60 |
0.0 | 1 | 1964 | Single-Scan Techniques for the Translation of Arithmetic Expressions into ALGOL 60 · J. ACM 1964 |
Compilers and program optimization › compiler optimization › local optimization
constant folding |
0.0 | 1 | 1964 | Single-Scan Techniques for the Translation of Arithmetic Expressions into ALGOL 60 · J. ACM 1964 |
Methods — techniques the papers use, named apart from their topics
stack-based translation · 0.0reverse polish notation · 0.0pushdown store · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1964 | Single-Scan Techniques for the Translation of Arithmetic Expressions into ALGOL 60abstractThe first section of the paper contains a brief description of the well-known technique of using a stack, or pushdown store, to re-order the operators of an arithmetic expression, as defined in ALGOL 60, in order to transform the expression into Reverse Polish parenthesis-free form. It is shown that improvements to this Reverse Polish form can be made quite simply, by extending the use of the stack to include information about the operands of the expression. Firstly, information gained from the declarations of the operands can be used to control the generation of real-integer conversion instructions. Secondly, operators whose operands are numerical constants can be computed during translation, using the partially generated Reverse Polish object program as a second stack. Brian Randell, L. J. Russell |
J. ACM | 2 |