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

Edmund K. Lai

dblp:33/2857 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1979
—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.

Software engineering, system software, and programming languages
1 paper
Concurrent programming · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Concurrent programming › concurrency bugs
deadlock		 0.011979
On Minimum Cost Recovery from System Deadlock · IEEE Trans. Computers 1979
Mathematical optimization
combinatorial optimization		 0.011979
On Minimum Cost Recovery from System Deadlock · IEEE Trans. Computers 1979
Performance modeling and evaluation
simulation		 0.011979
On Minimum Cost Recovery from System Deadlock · IEEE Trans. Computers 1979

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

worst-case analysis · 0.0simulation · 0.0heuristic · 0.0
YearPublicationVenuePosition
1979 On Minimum Cost Recovery from System Deadlock
abstract
In this paper we consider the problem of finding a minimum cost deadlock recovery. We show that the problem is NP-complete and hence an efficient algorithm is unlikely to exist for this problem. We propose three fast heuristics and analyze their worst case performance relative to optimal solutions. Finally, we perform some simulation tests to get a feel for the average performance of these heuristics.
Joseph Y.-T. Leung, Edmund K. Lai
 IEEE Trans. Computers2