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

Liu Lingzhong

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

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%
Theoretical computer science
1 paper
Distributed computing theory · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems › concurrency control
deadlock detection
0.011989
Comments on "A Distributed Scheme for Detecting Communication Deadlocks'' · IEEE Trans. Software Eng. 1989
Distributed systems
fault tolerance
0.011989
Comments on "A Distributed Scheme for Detecting Communication Deadlocks'' · IEEE Trans. Software Eng. 1989
Distributed computing theory › distributed algorithms
distributed algorithm correctness
0.011989
Comments on "A Distributed Scheme for Detecting Communication Deadlocks'' · IEEE Trans. Software Eng. 1989
YearPublicationVenuePosition
1989 Comments on "A Distributed Scheme for Detecting Communication Deadlocks''
abstract
A distributed scheme for detecting communication deadlocks and a correctness proof of the algorithm were given by N. Natarajan (see ibid., vol.SE-12, p.531-7 (1986)). It is shown in this correspondence that the proof is not strict.>
Liu Lingzhong
IEEE Trans. Software Eng.1