Imre B'ar'any
Computational Theory and Mathematics · 2017
A researcher in the Science corpus: 1 paper; trusts 3 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 6 citations into it
Whom Imre B'ar'any trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Imre B'ar'any's perspective
Ordered by how strongly the researchers Imre B'ar'any trusts endorse each paper. Same corpus, a different order for every researcher.
- Lectures on discrete geometry
- On the chromatic number of Kneser hypergraphs
- Kneser's Conjecture
- Graph Colouring and the Probabilistic Method
- Extensions of Lipschitz mappings into Hilbert space
- Empirical processes and random projections
- Generalized Kneser coloring theorems with combinatorial proofs
- Using The Borsuk-Ulam Theorem
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
- An elementary proof of a theorem of Johnson and Lindenstrauss
Their papers
- Tverberg’s theorem is 50 years old: A survey (2017) — 73 citations