Ray P. Tai

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

dblp:04/6582 · DBLP profile ↗

← Back

1ranked-venue papers

0as first author

0since 2021 · last 1997

—ORCID · none

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

Theory 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.

Theoretical computer science

1 paper

Graph algorithms and graph theory · 50% Approximation and online algorithms · 50%

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

Topic	Weight	Papers	Last	Evidence papers
Approximation and online algorithms approximation schemes	0.0	1	1997	Implementing a Fully Polynomial Time Approximation Scheme for All Terminal Network Reliability · SODA 1997
Graph algorithms and graph theory › network analysis network reliability	0.0	1	1997	Implementing a Fully Polynomial Time Approximation Scheme for All Terminal Network Reliability · SODA 1997

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

fully polynomial time approximation scheme · 0.0

Year	Publication	Venue	Position
1997	Implementing a Fully Polynomial Time Approximation Scheme for All Terminal Network Reliability David R. Karger, Ray P. Tai	SODA	2