Jiri Rohn
2000–2009
A researcher in the Science corpus: 5 papers; trusts 6 researchers and is trusted by 6 researchers here, as inferred from the citation graph.
Whom Jiri Rohn trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Jiri Rohn overall
- Barintag Saheya
- Cheng’en Yu
- Dennis S. Bernstein
- Milan Hladı´k
- Siegfried M. Rump
- Miroslav Fiedler
- Jein-Shan Chen
Papers from Jiri Rohn's perspective
Ordered by how strongly the researchers Jiri Rohn trusts endorse each paper. Same corpus, a different order for every researcher.
- HOW GOOD IS THE SIMPLEX ALGORITHM
- Linear Programming and Extensions
- Computing the norm ∥A∥∞,1 is NP-hard
- ACTIVITY ANALYSIS OF PRODUCTION AND ALLOCATION
- Matrix Analysis and Applied Linear Algebra
- accuracy and stability of numerical algorithms
- Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
- Linear Optimization Problems with Inexact Data
- Graph structure in the Web (Comput. Networks)
- Comparing top k lists (ACM-SIAM Symposium on Discrete Algorithms)
Their papers
- Computing the norm ∥A∥∞,1 is NP-hard (2000) — 54 citations
- An algorithm for solving the absolute value equation (2009) — 104 citations
- Solvability of systems of interval linear equations and inequalities (2006) — 70 citations
- Forty necessary and sufficient conditions for regularity of interval matrices: A survey (2009) — 61 citations
- Linear Optimization Problems with Inexact Data (2006) — 346 citations