Imre Bárány

Applied Mathematics · 2001–2011

A researcher in the Science corpus: 7 papers; trusts 5 researchers and is trusted by 12 researchers here, as inferred from the citation graph.

Subfields

Whom Imre Bárány trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. Matthias Reitzner
  2. Bradley Efron
  3. Christos H. Papadimitriou
  4. Alexander I. Barvinok
  5. Daniel A. Spielman
  6. Xi Chen

Who trusts Imre Bárány overall

  1. Zakhar Kabluchko
  2. Daniel Temesvari
  3. C. Thaele
  4. Subhash Khot
  5. Mark Rudelson
  6. Misha Gromov
  7. Shlomo Hoory
  8. Johan Wästlund
  9. Alex Iosevich
  10. Pang Wei Koh

Papers from Imre Bárány's perspective

Ordered by how strongly the researchers Imre Bárány trusts endorse each paper. Same corpus, a different order for every researcher.

  1. A bound for the error in the normal approximation to the distribution of a sum of dependent random variables
  2. The combinatorial structure of random polytopes
  3. The Jackknife Estimate of Variance
  4. Playing large games using simple strategies
  5. Algorithms, games, and the internet (Symposium on the Theory of Computing)
  6. On equilibrium points in bimatrix games
  7. Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time (Symposium on the Theory of Computing)
  8. The Probabilistic Method
  9. A course in convexity (Graduate Studies in Mathematics)
  10. Settling the Complexity of Two-Player Nash Equilibrium (IEEE Annual Symposium on Foundations of Computer Science)

Their papers