Demo Data from VLDB 2026 / reviewers in the wild / expert
Zhao Q. Chen
dblp:29/3100
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 1999
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2
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 |
Algorithms and data structures · 67% Computational complexity · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity
algebraic complexity |
0.0 | 1 | 1999 | The Complexity of the Matrix Eigenproblem · STOC 1999 |
Algorithms and data structures › numerical linear algebra
eigenvalue computation |
0.0 | 1 | 1999 | The Complexity of the Matrix Eigenproblem · STOC 1999 |
Algorithms and data structures
numerical linear algebra |
0.0 | 1 | 1999 | The Complexity of the Matrix Eigenproblem · STOC 1999 |
Methods — techniques the papers use, named apart from their topics
arithmetic complexity bounds · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1999 | Superfast Computations with Singular Structured Matrices over Abstract Fields
Victor Y. Pan, Ailong Zheng, M. Abu Tabanjeh, Zhao Q. Chen, S. Providence |
CASC | 4 |
| 1999 | The Complexity of the Matrix EigenproblemabstractThe eigenproblem for an n-by-n matrix A is the problem of the approximation (within a relative error bound 2-') of all the eigenvalues of the matrix A and computing the associated eigenspaces of all these eigenvalues.We show that the arithmetic complexity of this problem is bounded by O(n3 + (nlog'n)log b).If the characteristic and mini- Victor Y. Pan, Zhao Q. Chen |
STOC | 2 |