Demo Data from EDBT 2026 / reviewers in the wild / expert
Dongmyun Lee
dblp:98/1307
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 1992
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2 · 1 first-authorSystems, architecture and hardware · 1Theory of computation · 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 |
Parallel and multicore computing · 67% Distributed systems · 33% | |
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems › distributed scheduling
optimal task assignment |
0.0 | 1 | 1992 | Optimal Task Assignment in Linear Array Networks · IEEE Trans. Computers 1992 |
Parallel and multicore computing
task allocation |
0.0 | 1 | 1992 | Optimal Task Assignment in Linear Array Networks · IEEE Trans. Computers 1992 |
Graph algorithms and graph theory
minimum cut |
0.0 | 1 | 1992 | Optimal Task Assignment in Linear Array Networks · IEEE Trans. Computers 1992 |
Graph algorithms and graph theory › graph algorithms
network flow |
0.0 | 1 | 1992 | Optimal Task Assignment in Linear Array Networks · IEEE Trans. Computers 1992 |
Methods — techniques the papers use, named apart from their topics
network flow algorithm · 0.0goldberg-tarjan algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1992 | A distributed scheme for dynamic deadlock detection and resolution
Dongmyun Lee, Myunghwan Kim 0001 |
Inf. Sci. | 1 |
| 1992 | Optimal Task Assignment in Linear Array NetworksabstractThe problem of assigning tasks to the processors of a distributed computing system such that the sum of execution and communication costs is minimized is discussed. This problem is known to be NP-complete in the general case, and thus intractable for systems with a large number of processors. H.S. Stone's (1977) network flow approach for a two-processor system is extended to the case for a linear array of any number of processors. The task assignment problem for a linear array network is first transformed into the two-terminal network flow problem, and then solved by applying the Goldberg-Tarjan (1987) network flow algorithm in time no worse than O(n/sup 2/m/sup 3/ log n), where n and m are the number of processors and the number of tasks, respectively.> Cheol-Hoon Lee, Dongmyun Lee, Myunghwan Kim 0001 |
IEEE Trans. Computers | 2 |
| 1989 | A Distributed Deadlock Detection Algorithm: Distributed Graph Reconstruction Algorithm
Gyuyoun Song, Donghyeon Park, Dongmyun Lee, Myunghwan Kim 0001 |
Inf. Process. Lett. | 3 |