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

Pei Yuan Yan

dblp:26/6604 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1994
—ORCID · none

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

Theory of computation · 2 · 1 first-authorSystems, 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.

Theoretical computer science
2 papers
Computational complexity · 94% Coding theory · 6%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

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

TopicWeightPapersLastEvidence papers
Computational complexity
circuit complexity		 0.011994
Exponential Size Lower Bounds for Some Depth Three Circuits · Inf. Comput. 1994
Computational complexity › algebraic complexity › arithmetic circuit complexity
depth-3 circuit		 0.011994
Exponential Size Lower Bounds for Some Depth Three Circuits · Inf. Comput. 1994
Computational complexity
lower bounds		 0.021994
Improved Upper and Lower Time Bounds for Parallel Random Access Machines Without Simultaneous Writes · SIAM J. Comput. 1991
Exponential Size Lower Bounds for Some Depth Three Circuits · Inf. Comput. 1994
Parallel and multicore computing › parallel computation models
parallel machine model		 0.011991
Improved Upper and Lower Time Bounds for Parallel Random Access Machines Without Simultaneous Writes · SIAM J. Comput. 1991
Parallel and multicore computing › parallel computation models
PRAM		 0.011991
Improved Upper and Lower Time Bounds for Parallel Random Access Machines Without Simultaneous Writes · SIAM J. Comput. 1991
Coding theory
boolean functions		 0.011991
Improved Upper and Lower Time Bounds for Parallel Random Access Machines Without Simultaneous Writes · SIAM J. Comput. 1991

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

adversarial analysis · 0.0
YearPublicationVenuePosition
1994 Exponential Size Lower Bounds for Some Depth Three Circuits
Pei Yuan Yan, Ian Parberry
 Inf. Comput.1
1991 Improved Upper and Lower Time Bounds for Parallel Random Access Machines Without Simultaneous Writes
abstract
The time required by a variant of the PRAM (a parallel machine model which consists of sequential processors which communicate by reading and writing into a common shared memory) to compute a certain class of functions called critical functions (which include the Boolean OR of n bits) is studied. Simultaneous reads from individual cells of the shared memory are permitted, but simultaneous writes are not. It is shown that any PRAM which computes a critical function must take at least $0.5\log n - O(1)$ steps, and that there exists a critical function which can be computed in $0.57\log n - O(1)$ steps. These bounds represent an improvement in the constant factor over those previously known.
Ian Parberry, Pei Yuan Yan
 SIAM J. Comput.2
1989 Improved Upper and Lower Time Bounds for Parallel Random Access Machines Without Simultaneous Writes
Ian Parberry, Pei Yuan Yan
 ICPP (3)2