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

Trân Quôc Tê

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

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

Systems, architecture and hardware · 1 · 1 first-authorSoftware 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 · 50% Runtime systems and virtual machines · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 100%

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

TopicWeightPapersLastEvidence papers
Runtime systems and virtual machines › runtime memory management
memory bloat		 0.011976
An heuristic model for analysis of memory use under static partition allocation strategies · SIGMETRICS 1976
Operating systems › resource management
memory management		 0.011976
An heuristic model for analysis of memory use under static partition allocation strategies · SIGMETRICS 1976
Memory systems › memory management
memory allocation		 0.011976
An heuristic model for analysis of memory use under static partition allocation strategies · SIGMETRICS 1976

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

heuristic modeling · 0.0
YearPublicationVenuePosition
1976 An heuristic model for analysis of memory use under static partition allocation strategies
abstract
This paper examines minimum memory wastage strategies for partitioning and allocating main memory to a stream of jobs, in a context where each job resides throughout its execution in a frame to which it is assigned.
Trân Quôc Tê
 SIGMETRICS1