Jirí Matousek
Applied Mathematics · 1996–2009
A researcher in the Science corpus: 11 papers; trusts 14 researchers and is trusted by 86 researchers here, as inferred from the citation graph.
Subfields
- Applied Mathematics — 9 citations into it
- Computational Theory and Mathematics — 8 citations into it; #629 of 12,489 by trust here, #2,211 by citations
- Discrete Mathematics and Combinatorics — 7 citations into it; #607 of 2,084 by trust here, #1,618 by citations
- Numerical Analysis — 7 citations into it
- Computer Graphics and Computer-Aided Design — 5 citations into it; #63 of 1,641 by trust here, #346 by citations
Whom Jirí Matousek trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Bruce A. Reed
- Günter M. Ziegler
- David Haussler
- Henryk Wozniakowski
- William B. Johnson
- Sanjoy Dasgupta
- Nir Ailon
- Bo'az Klartag
- Vladimir Naumovich Vapnik
- Maxim Skriganov
Who trusts Jirí Matousek overall
- Günter M. Ziegler
- Dmitry N. Kozlov
- Imre B'ar'any
- Rosen Diankov
- Jacob Fox
- Alekh Agarwal
- Sanjeev Arora
- S. Muthu Muthukrishnan
- Martin J. Wainwright
- Sahand N. Negahban
Papers from Jirí Matousek's perspective
Ordered by how strongly the researchers Jirí Matousek trusts endorse each paper. Same corpus, a different order for every researcher.
- Kneser's Conjecture
- Graph Colouring and the Probabilistic Method
- Lectures on discrete geometry
- An elementary proof of a theorem of Johnson and Lindenstrauss
- 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
- The Probabilistic Method
Their papers
- On variants of the Johnson–Lindenstrauss lemma (2008) — 300 citations
- Using The Borsuk-Ulam Theorem (2007) — 840 citations
- On the chromatic number of Kneser hypergraphs (2002) — 94 citations
- Geometric Discrepancy: An Illustrated Guide (2009) — 368 citations
- Understanding and using linear programming (2007) — 447 citations
- Topics in Discrete Mathematics (2006) — 52 citations
- A fractional Helly theorem for convex lattice sets (2003) — 50 citations
- Topological lower bounds for the chromatic number: A hierarchy (2002) — 116 citations
- Intersection Patterns of Convex Sets (2002) — 73 citations
- Lectures on discrete geometry (2002) — 1,603 citations
- On linear-time deterministic algorithms for optimization problems in fixed dimension (1996)