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.
EDBT 2026 Demo / reviewers in the wild / expert

Rafael O. Fontao

dblp:32/2862 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1971
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-authorSoftware 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
Operating systems · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Operating systems › resource management
deadlock avoidance		 0.011971
A Concurrent Algorithm for Avoiding Deadlocks · SOSP 1971
Cloud and datacenter computing
resource allocation		 0.011971
A Concurrent Algorithm for Avoiding Deadlocks · SOSP 1971

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

deadlock avoidance algorithm · 0.0
YearPublicationVenuePosition
1971 A Concurrent Algorithm for Avoiding Deadlocks
abstract
In computer systems in which resources are allocated dynamically, algorithms must be executed whenever resources are assigned to determine if the allocation of these resources could possibly result in a deadlock, a situation in which two or more processes remain in an idle or blocked state indefinitely.
Rafael O. Fontao
 SOSP1
1971 A Graphical Method for Checking Complete Monotonicity
abstract
Complete monotonicity is a necessary condition for linear separability of a switching function and it is equivalent to the 2-asummable property. A test for this property using a tabular representation of a switching function and an easily generated test card is given. This method may be used reasonably well up to six variables.
Rafael O. Fontao
 IEEE Trans. Computers1