Demo Data from EDBT 2026 / reviewers in the wild / expert
Andrew J. Palay
dblp:07/1799
· DBLP profile ↗
3ranked-venue papers
2as first author
0since 2021 · last 1984
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1Software engineering, systems software and programming languages · 1Databases, data management, data science and information retrieval · 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
1 paper |
Integrated circuit design · 50% Parallel and multicore computing · 50% | |
| Artificial intelligence
1 paper |
Planning, search and constraint satisfaction · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Database system architecture and tuning · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Parallel and multicore computing
parallel architecture |
0.0 | 1 | 1984 | The Design and Implementation of a VLSI Chess Move Generator · ISCA 1984 |
Integrated circuit design
VLSI design |
0.0 | 1 | 1984 | The Design and Implementation of a VLSI Chess Move Generator · ISCA 1984 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
heuristic search |
0.0 | 1 | 1982 | The B* Tree Search Algorithm - New Results · Artif. Intell. 1982 |
Database system architecture and tuning › database interface
database browsing |
0.0 | 1 | 1980 | Browsing Through Databases · SIGIR 1980 |
Methods — techniques the papers use, named apart from their topics
parallel architecture restructuring · 0.0VLSI design · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1984 | The Design and Implementation of a VLSI Chess Move GeneratorabstractCommunication is a basic problem when using VLSI technology to implement large parallel circuits. Valuable chip area must be used to run wires connecting components on a chip and current packaging technology restricts the amount of communication that can cross chip boundaries. This paper presents a large parallel architecture for generating moves in chess and shows how it can be restructured to reduce communication and permit a straightforward VLSI implementation without any performance loss. The result is a move generator comprising 64 identical custom chips performing at a rate of 500,000 moves per second, performance that is comparable to the best existing move generator. Carl Ebeling, Andrew J. Palay |
ISCA | 2 |
| 1982 | The B* Tree Search Algorithm - New Results
Andrew J. Palay |
Artif. Intell. | 1 |
| 1980 | Browsing Through Databases
Andrew J. Palay, Mark S. Fox |
SIGIR | 1 |