Demo Data from EDBT 2026 / reviewers in the wild / expert
A. W. Colijn
dblp:42/6200
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 1981
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 1 · 1 first-authorApplied, 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.
| 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 |
|---|---|---|---|---|
Algorithms and data structures › search algorithms
binary search |
0.0 | 1 | 1974 | A Modified List Technique Allowing Binary Search · J. ACM 1974 |
Algorithms and data structures › dynamic data structures
linked list |
0.0 | 1 | 1974 | A Modified List Technique Allowing Binary Search · J. ACM 1974 |
Algorithms and data structures
search algorithms |
0.0 | 1 | 1974 | A Modified List Technique Allowing Binary Search · J. ACM 1974 |
Methods — techniques the papers use, named apart from their topics
memory layout · 0.0list modification · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1981 | A Note on the Multics Command Language
A. W. Colijn |
Softw. Pract. Exp. | 1 |
| 1974 | A Modified List Technique Allowing Binary SearchabstractA modification of linked lists is presented which permits searching almost as efficiently as a pure binary search. The method depends on using consecutive memory locations for consecutive list elements whenever possible. Gerald Berman, A. W. Colijn |
J. ACM | 2 |