Robert A. Rowley

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

dblp:24/6388 · DBLP profile ↗

← Back

4ranked-venue papers

4as first author

0since 2021 · last 1997

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 4 · 4 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

Interconnection networks and networks-on-chip · 70% Distributed systems · 30%

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

Topic	Papers	Last	Evidence papers
Interconnection networks and networks-on-chip › network topology › low-diameter topology de bruijn network	2	1997	Distributed Ring Embedding in Faulty De Bruijn Networks · IEEE Trans. Computers 1997 Fault-Tolerant Ring Embedding in de Bruijn Networks · IEEE Trans. Computers 1993
Interconnection networks and networks-on-chip network topology	2	1997	Distributed Ring Embedding in Faulty De Bruijn Networks · IEEE Trans. Computers 1997 Fault-Tolerant Ring Embedding in de Bruijn Networks · IEEE Trans. Computers 1993
Distributed systems distributed algorithms	1	1997	Distributed Ring Embedding in Faulty De Bruijn Networks · IEEE Trans. Computers 1997
Interconnection networks and networks-on-chip › graph embedding fault-tolerant network embedding	1	1993	Fault-Tolerant Ring Embedding in de Bruijn Networks · IEEE Trans. Computers 1993
Distributed systems › fault tolerance › failure models node and link failures	1	1993	Fault-Tolerant Ring Embedding in de Bruijn Networks · IEEE Trans. Computers 1993

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

graph embedding · 0.0distributed network-level algorithm · 0.0hamiltonian cycle construction · 0.0edge-disjoint cycles · 0.0

Year	Publication	Venue	Position
1997	Distributed Ring Embedding in Faulty De Bruijn Networks abstract We present a distributed network-level algorithm that constructs a cycle in a d-ary De Bruijn multiprocessor network in the presence of an arbitrary number of node failures. When the number of faults f does not exceed d-1 a cycle of length at least d/sup n/-nf-1 can always be found in O(n) steps in a network of size d/sup n/. Robert A. Rowley, Bella Bose	IEEE Trans. Computers	1
1993	Fault-Tolerant Ring Embedding in de Bruijn Networks abstract A method of embedding a ring in a d-ary de Bruijn multiprocessor network in the event of multiple node (processor) failures is presented. In particular, the algorithm guarantees that a (2/sup n/-n-1)-node ring will be found in a binary de Bruijn network with a single faulty node, where 2/sup n/ is the total number of nodes in the network. It is also shown that a (d/sup n/-1)-node ring can always be found in the presence of d-1 link failures, when d is a prime power and the network contains d/sup n/ nodes. The latter is accomplished by constructing d-1 edge-disjoint cycles each of length d/sup n/-1. A modification of the graph that allows it to admit a Hamiltonian cycle in the event of d-1 edge failures is also discussed.> Robert A. Rowley, Bella Bose	IEEE Trans. Computers	1
1991	Fault-Tolerant Ring Embedding in de Bruijn Networks Robert A. Rowley, Bella Bose	ICPP (1)	1
1990	On Necklaces in Shuffle-Exchange and de Bruign Networks Robert A. Rowley, Bella Bose	ICPP (1)	1