Christopher J. Smyth

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:66/1992 · DBLP profile ↗

← Back

2ranked-venue papers

1as first author

0since 2021 · last 1992

—ORCID · none

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

Computer networks · 1 · 1 first-authorTheory of computation · 1

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 networks 1 paper		Optical networks · 50% Routing and switching · 50%
Computer architecture, parallel and distributed computing, and storage systems 1 paper		Performance modeling and evaluation · 50% Interconnection networks and networks-on-chip · 50%

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

Topic	Papers	Last	Evidence papers
Routing and switching › switching networks nonblocking networks	1	1988	Nonblocking photonic switch networks · IEEE J. Sel. Areas Commun. 1988
Optical networks › optical switching photonic switching	1	1988	Nonblocking photonic switch networks · IEEE J. Sel. Areas Commun. 1988
Performance modeling and evaluation › queueing analysis blocking	1	1988	Nonblocking photonic switch networks · IEEE J. Sel. Areas Commun. 1988
Interconnection networks and networks-on-chip nonblocking networks	1	1988	Nonblocking photonic switch networks · IEEE J. Sel. Areas Commun. 1988

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

graph-theoretic analysis · 0.0

Year	Publication	Venue	Position
1992	A Classification of Minimal Standard-Path 2x2 Switching Networks Liam Halpenny, Christopher J. Smyth	Theor. Comput. Sci.	2
1988	Nonblocking photonic switch networks abstract A practical algorithm is described, with examples, for deciding whether or not a given network of 22 photonic switches is truly unblocking. Nonblocking photonic networks with specific additional properties, e.g. planarity, short path length, are also discussed, and specific networks, which have advantages over the square networks so far fabricated, are described. It is also shown that a correspondence can be set up between classical switch networks and networks of 22 switches, so that the classical results on blocking can be carried over to these networks.> Christopher J. Smyth	IEEE J. Sel. Areas Commun.	1