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

Colin M. Davidson

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

Software engineering, system software, and programming languages
1 paper
Concurrent programming · 100%
Theoretical computer science
1 paper
Distributed computing theory · 100%

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

TopicWeightPapersLastEvidence papers
Concurrent programming › synchronization
mutual exclusion
0.011987
A Note on Concurrent Programming Control · IEEE Trans. Software Eng. 1987
YearPublicationVenuePosition
1987 A Note on Concurrent Programming Control
abstract
An extension to Dijkstra's solution [1], of the problem of limiting access by multiple processors to a single resource, is described. The solution has similar delay characteristics to Ferguson's solution [3] while using less complex data structures. Some claims in [3] are examined.
Colin M. Davidson
IEEE Trans. Software Eng.1