Jürgen Eckhoff

2003

A researcher in the Science corpus: 1 paper; trusts 1 researcher and is trusted by 0 researchers here, as inferred from the citation graph.

Whom Jürgen Eckhoff trusts overall

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

  1. Jirí Matousek

Papers from Jürgen Eckhoff's perspective

Ordered by how strongly the researchers Jürgen Eckhoff trusts endorse each paper. Same corpus, a different order for every researcher.

  1. Lectures on discrete geometry
  2. Extensions of Lipschitz mappings into Hilbert space
  3. Kneser's Conjecture
  4. Empirical processes and random projections
  5. Generalized Kneser coloring theorems with combinatorial proofs
  6. Using The Borsuk-Ulam Theorem
  7. Graph Colouring and the Probabilistic Method
  8. Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
  9. An elementary proof of a theorem of Johnson and Lindenstrauss
  10. Settling the Complexity of Two-Player Nash Equilibrium (IEEE Annual Symposium on Foundations of Computer Science)

Their papers