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.
EDBT 2026 Demo / reviewers in the wild / expert

J. G. Van Bosse

dblp:180/6419 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1974
—ORCID · none

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

Systems, architecture and hardware · 2Computer networks · 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 networks
1 paper
Routing and switching · 50% Transport protocols and congestion control · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Integrated circuit design · 100%
Theoretical computer science
1 paper
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control
congestion control evaluation		 0.011974
On an Inequality for the Congestion in Switching Networks · IEEE Trans. Commun. 1974
Routing and switching
switching networks		 0.011974
On an Inequality for the Congestion in Switching Networks · IEEE Trans. Commun. 1974
Integrated circuit design
digital circuit design		 0.011965
NAND-AND Circuits · IEEE Trans. Electron. Comput. 1965
Integrated circuit design › digital circuit design › threshold logic
threshold logic circuits		 0.011965
NAND-AND Circuits · IEEE Trans. Electron. Comput. 1965
Information theory
pattern recognition		 0.011965
NAND-AND Circuits · IEEE Trans. Electron. Comput. 1965

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

mathematical analysis · 0.0
YearPublicationVenuePosition
1974 On an Inequality for the Congestion in Switching Networks
abstract
A basic inequality of le Gall, involving the congestion in four-stage switching networks, is generalized. The basic inequality remains valid in the case of arbitrary occupancy distributions on all link groups in the network.
J. G. Van Bosse
 IEEE Trans. Commun.1
1965 Correction [to "Some techniques of state assignment for synchronous sequential machines"]
abstract
R.M. Karp, author of "Some Techniques of State Assignment for Synchronous Sequential Machines," which appeared on pages 507-518 of the October, 1964, issue of these Transactions, notes corrections on page 511, column 1, line 36, and on page 517, "(2a)-(2d)" should be replaced by "a, b, c, and d" in the following places: column 1, 5 lines from the bottom, column 2, lines 1-2, line 25, and line 28.
R. E. Burke, J. G. Van Bosse
 IEEE Trans. Electron. Comput.2
1965 NAND-AND Circuits
abstract
Threshold functions and statistical recognition have been the subjects of many papers and, although the threshold functions have frequently been used as a logic implementation in empirical studies of pattern recognition [1], most, if not all, of the reported theoretical investigations treat these two subjects separately. The purpose of this paper is to present an equivalence between threshold functions and statistical recognition with independent distributions.
R. E. Burke, J. G. Van Bosse
 IEEE Trans. Electron. Comput.2