Madhur Tulsiani
Discrete Mathematics and Combinatorics · 2008–2009
A researcher in the Science corpus: 2 papers; trusts 2 researchers and is trusted by 18 researchers here, as inferred from the citation graph.
Subfields
- Discrete Mathematics and Combinatorics — 7 citations into it; #1,162 of 2,017 by trust here, #713 by citations
Whom Madhur Tulsiani trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Madhur Tulsiani overall
- David Conlon
- Vitaly Feldman
- Ilias Diakonikolas
- Anupam Gupta
- Anindya De
- William T. Gowers
- Úrsula Hébert-Johnson
- Michael P. Kim
- Jacob Fox
- Salil P. Vadhan
Papers from Madhur Tulsiani's perspective
Ordered by how strongly the researchers Madhur Tulsiani trusts endorse each paper. Same corpus, a different order for every researcher.
- Dense Subsets of Pseudorandom Sets
- The primes contain arbitrarily long arithmetic progressions
- An analog of Freiman's theorem in groups (Astérisque)
- Foundations of a Structural Theory of Set Addition
- Freiman's theorem in an arbitrary abelian group
- On the size of k-fold sum and product sets of integers
- A NEW PROOF OF SZEMER ´ EDI'S THEOREM
- Multiple recurrence and nilsequences
- A non-conventional ergodic theorem for a nilsystem (Ergodic Theory and Dynamical Systems)
- Combinatorial Group Theory
Their papers
- Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution (2009) — 88 citations
- Dense Subsets of Pseudorandom Sets (2008) — 141 citations