Michael Elkin

IEEE Annual Symposium on Foundations of Computer Science · 2012

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 Michael Elkin trusts

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

  1. Gábor Tardos (in Computational Theory and Mathematics)

Papers from Michael Elkin's perspective

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

  1. A constructive proof of the general lovász local lemma (JACM)
  2. Balls and Bins: A Study in Negative Dependence
  3. Concentration of measure for the analysis of randomized algorithms by Devdatt P. Dubhashi and Alessandro Panconesi Cambridge University Press, 2009 (SIGA)
  4. Fast subtree kernels on graphs
  5. Comparison of descriptor spaces for chemical compound retrieval and classification
  6. Efficient Non-parametric Estimation of Multiple Embeddings per Word in Vector Space
  7. Visualizing Data using t-SNE
  8. Coupling, stationarity, and regeneration
  9. Improving Word Representations via Global Context and Multiple Word Prototypes
  10. Concentration Inequalities: A Nonasymptotic Theory of Independence

Their papers