Helmut Prodinger
Mathematical Physics · 2007
A researcher in the Science corpus: 1 paper; trusts 7 researchers and is trusted by 1 researcher here, as inferred from the citation graph.
Subfields
- Mathematical Physics — 9 citations into it
- Statistical and Nonlinear Physics — 7 citations into it
- Statistics and Probability — 5 citations into it
Whom Helmut Prodinger trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Helmut Prodinger overall
Papers from Helmut Prodinger's perspective
Ordered by how strongly the researchers Helmut Prodinger trusts endorse each paper. Same corpus, a different order for every researcher.
- Emergence of scaling in random networks
- The phase transition in inhomogeneous random graphs (Random Struct. Algorithms)
- Structure of large random hypergraphs
- Organization of growing random networks. (Physical review. E, Statistical, nonlinear, and soft matter physics)
- The degree sequence of a scale‐free random graph process (Random Struct. Algorithms)
- On random trees
- Analytic and Algorithmic Solution of Random Satisfiability Problems (Science)
- Excluded permutation matrices and the Stanley-Wilf conjecture (Journal of Combinatorial Theory)
- Cutting down very simple trees
- Generalizations of Polya's urn Problem
Their papers
- An almost-bijective proof of an asymptotic property of partitions (2007) — 80 citations