Luca Trevisan

Discrete Mathematics and Combinatorics · International Workshop Randomization and Approximation Techniques in Computer Science · 2000–2009

A researcher in the Science corpus: 6 papers; trusts 2 researchers and is trusted by 39 researchers here, as inferred from the citation graph.

Subfields

Whom Luca Trevisan trusts overall

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

  1. Aravind Srinivasan
  2. Omer Reingold
  3. Ben Joseph Green
  4. Oded Goldreich
  5. Terence Tao
  6. Shafi Goldwasser
  7. William T. Gowers
  8. Sanjeev Arora

Who trusts Luca Trevisan overall

  1. Roger Colbeck
  2. David Conlon
  3. Vitaly Feldman
  4. Marco Tomamichel
  5. Renato Renner
  6. Adrian Kent
  7. Amos Beimel
  8. Ilias Diakonikolas
  9. Yuval Ishai
  10. Anupam Gupta

Papers from Luca Trevisan's perspective

Ordered by how strongly the researchers Luca Trevisan trusts endorse each paper. Same corpus, a different order for every researcher.

  1. The primes contain arbitrarily long arithmetic progressions
  2. Dense Subsets of Pseudorandom Sets
  3. How to construct random functions
  4. Computing with very weak random sources
  5. Size-Estimation Framework with Applications to Transitive Closure and Reachability
  6. Reductions in streaming algorithms, with an application to counting triangles in graphs (ACM-SIAM Symposium on Discrete Algorithms)
  7. Probabilistic checking of proofs: a new characterization of NP
  8. Proof verification and hardness of approximation problems
  9. A theory of the learnable
  10. Probabilistic Encryption

Their papers