Sergey Norin
Computational Theory and Mathematics · with Baker · 2006–2010
A researcher in the Science corpus: 4 papers; trusts 6 researchers and is trusted by 10 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 9 citations into it; #4,039 of 12,182 by trust here, #5,465 by citations
- Geometry and Topology — 6 citations into it; #1,250 of 7,422 by trust here, #1,249 by citations
Whom Sergey Norin trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Sergey Norin overall
Papers from Sergey Norin's perspective
Ordered by how strongly the researchers Sergey Norin trusts endorse each paper. Same corpus, a different order for every researcher.
- Introduction to toric varieties
- Limits of dense graph sequences (J. Comb. Theory B)
- Zeta Functions of Finite Graphs
- A Decision Method for Elementary Algebra and Geometry
- Trees, parking functions, syzygies, and deformations of monomial ideals
- Algebraic Geometry (Wiley Encyclopedia of Computer Science and Engineering)
- Algebraic Graph Theory
- The Complexity of Computing the Permanent
- Introduction To Quadratic Forms Over Fields
- Biharmonic Maps Between Riemannian Manifolds
Their papers
- Harmonic morphisms and hyperelliptic graphs (2007) — 192 citations
- Undecidability of linear inequalities in graph homomorphism densities (2010) — 61 citations
- Exponentially many perfect matchings in cubic graphs (2010) — 63 citations
- Riemann–Roch and Abel–Jacobi theory on a finite graph (2006) — 512 citations