Demo Data from VLDB 2026 / reviewers in the wild / expert
Zaid A. Hussain
dblp:142/0371
· DBLP profile ↗
8ranked-venue papers
7as first author
2since 2021 · last 2024
0000-0002-1955-2871ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 8 · 7 first-author · 2 since 2021
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 |
Interconnection networks and networks-on-chip · 100% | |
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 50% Coding theory · 50% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Interconnection networks and networks-on-chip › hypercube network
generalized hypercube |
0.2 | 1 | 2014 | Generalized Hypercubes: Edge-Disjoint Hamiltonian Cycles and Gray Codes · IEEE Trans. Computers 2014 |
Interconnection networks and networks-on-chip
hypercube network |
0.2 | 1 | 2014 | Generalized Hypercubes: Edge-Disjoint Hamiltonian Cycles and Gray Codes · IEEE Trans. Computers 2014 |
Coding theory › error-correcting codes › combinatorial coding theory
gray codes |
0.2 | 1 | 2014 | Generalized Hypercubes: Edge-Disjoint Hamiltonian Cycles and Gray Codes · IEEE Trans. Computers 2014 |
Graph algorithms and graph theory › graph theory › hamiltonicity
hamiltonian cycle |
0.2 | 1 | 2014 | Generalized Hypercubes: Edge-Disjoint Hamiltonian Cycles and Gray Codes · IEEE Trans. Computers 2014 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Completely independent spanning trees in Eisenstein-Jacobi networks
Zaid A. Hussain, Fawaz Alazemi, Bader F. AlBdaiwi |
J. Supercomput. | 1 |
| 2022 | Independent spanning trees in Eisenstein-Jacobi networks
Zaid A. Hussain, Hosam M. F. AboElFotoh, Bader F. AlBdaiwi |
J. Supercomput. | 1 |
| 2017 | Node-independent spanning trees in Gaussian networks
Zaid A. Hussain, Bader F. AlBdaiwi, Anton Cerný |
J. Parallel Distributed Comput. | 1 |
| 2017 | Higher dimensional Eisenstein-Jacobi networks
Zaid A. Hussain, Arash Shamaei |
J. Parallel Distributed Comput. | 1 |
| 2016 | Edge-disjoint node-independent spanning trees in dense Gaussian networks
Bader F. AlBdaiwi, Zaid A. Hussain, Anton Cerný, Robert E. L. Aldred |
J. Supercomput. | 2 |
| 2015 | Edge disjoint Hamiltonian cycles in Eisenstein-Jacobi networks
Zaid A. Hussain, Bella Bose, Abdullah Al-Dhelaan |
J. Parallel Distributed Comput. | 1 |
| 2015 | Better traffic distribution one-to-all broadcast in higher dimensional Gaussian networks
Zaid A. Hussain |
J. Supercomput. | 1 |
| 2014 | Generalized Hypercubes: Edge-Disjoint Hamiltonian Cycles and Gray CodesabstractSome new classes of Hamming metric Gray codes over Zpn, where p is a prime and n is an integer power of 2, are described; then, how these Gray codes can be used to generate the maximum number of edge-disjoint Hamiltonian cycles in an n-dimensional generalized hypercube (GHC), Qpn, is shown. For Qpn, the number of edge-disjoint Hamiltonian cycles generated using these methods is n(p -1)/2 which is the maximum possible since the degree of each node in Qpnis n(p - 1). In addition, for any integers p and n, p not necessarily a prime and n not necessarily a power of 2, how to generate the maximum number of edge-disjoint Hamiltonian cycles in Qnp is also described. Zaid A. Hussain, Bella Bose, Abdullah Al-Dhelaan |
IEEE Trans. Computers | 1 |