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

Neville M. Dor

dblp:179/4936 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1967
—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
Performance modeling and evaluation · 50% Electronic design automation · 50%
Computer networks
1 paper
Internet of things and sensor networks · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › physical design › buffer optimization
buffer sizing		 0.011967
Guide to the Length of Buffer Storage Required for Random (Poisson) Input and Constant Output Rates · IEEE Trans. Electron. Comput. 1967
Performance modeling and evaluation
queueing models		 0.011967
Guide to the Length of Buffer Storage Required for Random (Poisson) Input and Constant Output Rates · IEEE Trans. Electron. Comput. 1967
Internet of things and sensor networks
data compression		 0.011967
Guide to the Length of Buffer Storage Required for Random (Poisson) Input and Constant Output Rates · IEEE Trans. Electron. Comput. 1967

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

analytical study · 0.0
YearPublicationVenuePosition
1967 Guide to the Length of Buffer Storage Required for Random (Poisson) Input and Constant Output Rates
abstract
The required buffer size for a random (Poisson) input word rate with constant rate removal in the same order as arrival is considered. The method of computation rests on analytical study. Results are tabulated for a range of values and may be used as a design guide. Applications may be found in both the partitioning of computer stores and in the communications field of data compression.
Neville M. Dor
 IEEE Trans. Electron. Comput.1