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 VLDB 2026 / reviewers in the wild / expert

J. Gaches

dblp:97/6692 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1967
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 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
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures
numerical linear algebra		 0.011967
On the Compatibility of a Given Solution With the Data of a Linear System · J. ACM 1967
Algorithms and data structures › similarity search › nearest neighbor search
uncertain data		 0.011967
On the Compatibility of a Given Solution With the Data of a Linear System · J. ACM 1967
YearPublicationVenuePosition
1967 On the Compatibility of a Given Solution With the Data of a Linear System
abstract
Some new theorems generalizing a result of Oettli and Prager are applied to the a posteriori analysis of the compatibility of a computed solution to the uncertain data of a linear system (or of a polynomial equation).
J. L. Rigal, J. Gaches
 J. ACM2