VLDB 2026 Research / reviewers in the wild / expert
M. Ashraf Chughtai
dblp:63/5789
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1985
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 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 |
Parallel and multicore computing · 36% Interconnection networks and networks-on-chip · 28% Distributed systems · 28% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Interconnection networks and networks-on-chip
network topology |
0.0 | 1 | 1985 | Complete Binary Spanning Trees of the Eight Nearest Neighbor Array · IEEE Trans. Computers 1985 |
Parallel and multicore computing
parallel algorithms |
0.0 | 1 | 1985 | Complete Binary Spanning Trees of the Eight Nearest Neighbor Array · IEEE Trans. Computers 1985 |
Distributed systems › distributed algorithms
spanning tree construction |
0.0 | 1 | 1985 | Complete Binary Spanning Trees of the Eight Nearest Neighbor Array · IEEE Trans. Computers 1985 |
Parallel and multicore computing
array processor |
0.0 | 1 | 1985 | Complete Binary Spanning Trees of the Eight Nearest Neighbor Array · IEEE Trans. Computers 1985 |
Processor architecture and microarchitecture
multicore design |
0.0 | 1 | 1985 | Complete Binary Spanning Trees of the Eight Nearest Neighbor Array · IEEE Trans. Computers 1985 |
Methods — techniques the papers use, named apart from their topics
graph theory · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1985 | Complete Binary Spanning Trees of the Eight Nearest Neighbor ArrayabstractComplete binary spanning trees of an n x n array of processors with an eight nearest neighbor interconnection pattern exist for a limited value of n. These spanning trees provide a fast route to accumulate information from all processors of the array, and allow certain problems to be solved as efficiently on an eight-neighbor array as on a tree-structured array. The condition under which complete binary spanning trees of a square array may exist is determined. This condition shows that complete binary spanning trees of an n x n eight-neighbor array exist only for n ≪ = 13. It is also observed that for n ≪ = 6, leaf nodes of these spanning trees lie on the periphery of the array. M. Ashraf Chughtai |
IEEE Trans. Computers | 1 |