EDBT 2026 Demo / reviewers in the wild / expert
A. Medepalli
dblp:50/3653
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1993
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 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 architecture, parallel and distributed computing, and storage systems
1 paper |
Electronic design automation · 50% Parallel and multicore computing · 50% | |
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 77% Mathematical optimization · 23% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Parallel and multicore computing › task allocation
module allocation |
0.0 | 1 | 1993 | Parametric Module Allocation on Partial k-Trees · IEEE Trans. Computers 1993 |
Electronic design automation › high-level synthesis
scheduling |
0.0 | 1 | 1993 | Parametric Module Allocation on Partial k-Trees · IEEE Trans. Computers 1993 |
Mathematical optimization
parametric optimization |
0.0 | 1 | 1993 | Parametric Module Allocation on Partial k-Trees · IEEE Trans. Computers 1993 |
Methods — techniques the papers use, named apart from their topics
tree decomposition · 0.0dynamic programming · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1993 | Parametric Module Allocation on Partial k-TreesabstractThe problem of allocating modules to processors in a distributed system to minimize total costs when the underlying communication graph is a partial k-tree and all costs are linear functions of a real parameter t is considered. It is shown that if the number of processors is fixed, the sequence of optimum assignments that are obtained as t varies from zero to infinity can be constructed in polynomial time. As an auxiliary result, a linear time separator algorithm for k-trees is developed. The implications of the results for parametric versions of the weighted vertex cover, independent set, and 0-1 quadratic programming problems on partial k-trees are discussed.> David Fernández-Baca, A. Medepalli |
IEEE Trans. Computers | 2 |