Demo Data from EDBT 2026 / reviewers in the wild / expert
Adin D. Falkoff
dblp:80/438
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 1965
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author
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 architecture, parallel and distributed computing, and storage systems
2 papers |
Memory systems · 44% Distributed systems · 44% Parallel and multicore computing · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Memory systems
content-addressable memory |
0.0 | 1 | 1962 | Algorithms for Parallel-Search Memories · J. ACM 1962 |
Distributed systems
search algorithms |
0.0 | 1 | 1962 | Algorithms for Parallel-Search Memories · J. ACM 1962 |
Parallel and multicore computing › parallel algorithms
sorting |
0.0 | 1 | 1962 | Algorithms for Parallel-Search Memories · J. ACM 1962 |
Methods — techniques the papers use, named apart from their topics
formal description · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1965 | Formal description of processes - the first step in design automationabstractThe formal description of objects is well known and has long been standard practice in many fields. Machine parts, for example, are commonly described by engineering drawings made according to standards which have nearly universal acceptance. The problem of design automation is to take such a description of an object, combine it with information about manufacturing methods and facilities, and automatically generate a formal description of a process which will produce the desired object. In a simple case this may mean no more than generating a tape for a numerically controlled machine tool, while in more complex cases it may require, as intermediate steps, the generation of parts lists and the design of subassemblies. Adin D. Falkoff |
DAC | 1 |
| 1962 | Algorithms for Parallel-Search MemoriesabstractThe underlying logical structure of parallel-search memories is described; the characteristic operation of three major types is displayed in the execution of searches based on equality; and algorithms are presented for searches based on other specifications including maximum, miniTnum, greater than, less than, nearest to, between limits, and ordering (sorting). It is shown that there is a hierarchy of dependency among these algorithms, that they appear in pairs with each member of a pair belonging to one or the other of two distinct classes, and that every type of search can be executed within each class. Adin D. Falkoff |
J. ACM | 1 |