Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Bader Almohammad

dblp:65/356 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1999
—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
Interconnection networks and networks-on-chip · 76% Electronic design automation · 19% Distributed systems · 6%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip › network reliability
fault-tolerant communication		 0.011999
Fault-Tolerant Communication Algorithms in Toroidal Networks · IEEE Trans. Parallel Distributed Syst. 1999
Interconnection networks and networks-on-chip
network topology		 0.011999
Fault-Tolerant Communication Algorithms in Toroidal Networks · IEEE Trans. Parallel Distributed Syst. 1999
Electronic design automation › physical design
routing		 0.011999
Fault-Tolerant Communication Algorithms in Toroidal Networks · IEEE Trans. Parallel Distributed Syst. 1999
Interconnection networks and networks-on-chip › network topology
torus network		 0.011999
Fault-Tolerant Communication Algorithms in Toroidal Networks · IEEE Trans. Parallel Distributed Syst. 1999
Interconnection networks and networks-on-chip › routing algorithms
wormhole routing		 0.011999
Fault-Tolerant Communication Algorithms in Toroidal Networks · IEEE Trans. Parallel Distributed Syst. 1999
Distributed systems › fault tolerance › resilience
node failure resilience		 0.011999
Fault-Tolerant Communication Algorithms in Toroidal Networks · IEEE Trans. Parallel Distributed Syst. 1999

Methods — techniques the papers use, named apart from their topics

communication complexity analysis · 0.0
YearPublicationVenuePosition
1999 Fault-Tolerant Communication Algorithms in Toroidal Networks
abstract
Fault-tolerant communication algorithms for k-ary n-cubes are introduced. These include: One-to-all broadcasting, all-to-all broadcasting, one-to-all personalized communication, and all-to-all personalized communication. Each of these algorithms can tolerate up to (2n-2) node failures provided that k>(2n-2) and k>3. Extensions of these algorithms with up to 2n-1 node failures are also described. The communication complexities of the proposed algorithms are derived when wormhole or store and forward packet routing is used.
Bader Almohammad, Bella Bose
 IEEE Trans. Parallel Distributed Syst.1