Demo Data from EDBT 2026 / reviewers in the wild / expert
Douglas K. Wyatt
dblp:14/1849
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 1982
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 1Graphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous 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.
| Computer graphics and multimedia
1 paper |
Rendering · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Programming languages and type systems · 100% |
Topics — the 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Programming languages and type systems › very high level languages
APL |
0.0 | 1 | 1978 | Compilation and Delayed Evaluation in APL · POPL 1978 |
Methods — techniques the papers use, named apart from their topics
rasterization · 0.0operational semantics · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1982 | A device independent graphics imaging model for use with raster devicesabstractIn building graphic systems for use with raster devices, it is difficult to develop an intuitive, device independent model of the imaging process, and to preserve that model over a variety of device implementations. This paper describes an imaging model and an associated implementation strategy that: John E. Warnock, Douglas K. Wyatt |
SIGGRAPH | 2 |
| 1978 | Compilation and Delayed Evaluation in APLabstractMost existing APL implementations are interpretive in nature, that is, each time an APL statement is encountered it is executed by a body of code that is perfectly general, i.e. capable of evaluating any APL expression, and is in no way tailored to the statement on hand. This costly generality is said to be justified because APL variables are typeless and thus can vary arbitrarily in type, shape, and size during the execution of a program. What this argument overlooks is that the operational semantics of an APL statement are not modified by the varying storage requirements of its variables. Leonidas J. Guibas, Douglas K. Wyatt |
POPL | 2 |