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

Ivan Erdelyi

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

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

Applied, interdisciplinary, general and emerging computing · 2 · 2 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.

Theoretical computer science
1 paper
Algorithms and data structures · 87% Combinatorics and discrete mathematics · 13%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures › numerical linear algebra
generalized inverse		 0.011966
On the "Reverse Order Law" Related to the Generalized Inverse of Matrix Products · J. ACM 1966
Algorithms and data structures
numerical linear algebra		 0.011966
On the "Reverse Order Law" Related to the Generalized Inverse of Matrix Products · J. ACM 1966
Combinatorics and discrete mathematics
matrix theory		 0.011966
On the "Reverse Order Law" Related to the Generalized Inverse of Matrix Products · J. ACM 1966
YearPublicationVenuePosition
1966 On the "Reverse Order Law" Related to the Generalized Inverse of Matrix Products
abstract
The “reverse order law” related to ordinary inverses of matrix products, i.e., ( AB ) -1 = B -1 A -1 , is generally not transferable to the generalized inverse. There are, however, applications in which the reverse order law related to the generalized inverse reveals interesting properties in certain classes of matrices. In this paper, some necessary and sufficient conditions for the reverse order property to hold are given.
Ivan Erdelyi
 J. ACM1
1965 On speeding convergence of an iterative eigenvalue process
abstract
This paper describes a practical procedure suitable for accelerating convergence to the dominant latent root of matrices reducible to diagonal form. The adaptation of the technique for an automatic computer required a very limited working store. Some examples illustrate the method, and certain particularities are discussed.
Ivan Erdelyi
 Comput. J.1