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

Eric Beyer

dblp:11/2750 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1979
—ORCID · none

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

Software engineering, systems software and programming languages · 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.

Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Operating systems › resource management › memory management
dynamic memory allocation		 0.011979
A Space Efficient Dynamic Allocation Algorithm for Queuing Messages · ACM Trans. Program. Lang. Syst. 1979
Operating systems › resource management
memory management		 0.011979
A Space Efficient Dynamic Allocation Algorithm for Queuing Messages · ACM Trans. Program. Lang. Syst. 1979

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

dynamic allocation algorithm · 0.0
YearPublicationVenuePosition
1979 A Space Efficient Dynamic Allocation Algorithm for Queuing Messages
abstract
A simple dynamic allocation algorithm is described for queuing variable length messages in memory. The algorithm makes use of the ability of many operating system to increase and decrease available memory as required. Some results describing its efficiency are presented.
Eric Beyer, Peter Buneman
 ACM Trans. Program. Lang. Syst.1