Jozef Skokan
Random Struct. Algorithms · 2004
A researcher in the Science corpus: 1 paper; trusts 1 researcher and is trusted by 16 researchers here, as inferred from the citation graph.
Whom Jozef Skokan trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Jozef Skokan overall
- William T. Gowers
- L. Lov'asz
- Terence Tao
- David Conlon
- Ben Joseph Green
- Yoshiharu Kohayakawa
- Gábor Elek
- Peter Keevash
- Vojtech Rödl
- Hamed Hatami
Papers from Jozef Skokan's perspective
Ordered by how strongly the researchers Jozef Skokan trusts endorse each paper. Same corpus, a different order for every researcher.
- A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment
- Solvable Model of a Spin-Glass
- A survey of max-type recursive distributional equations
- An optimal lower bound on the number of variables for graph identification
- Gaussian approximation theorems for urn models and their applications
- The Diameter of a Scale-Free Random Graph (Comb.)
- Counting independent sets up to the tree threshold (Symposium on the Theory of Computing)
- The evolution of random graphs
- Spin glasses : a challenge for mathematicians : cavity and mean field models
- The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence
Their papers
- Regularity Lemma for k‐uniform hypergraphs (2004) — 301 citations