Shaofeng H.-C. Jiang

2015

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

Whom Shaofeng H.-C. Jiang trusts overall

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

  1. Kamal Kumar Jain
  2. Niv Buchbinder
  3. Mohit Singh

Who trusts Shaofeng H.-C. Jiang overall

  1. Susanne Albers

Papers from Shaofeng H.-C. Jiang's perspective

Ordered by how strongly the researchers Shaofeng H.-C. Jiang trusts endorse each paper. Same corpus, a different order for every researcher.

  1. Who Solved the Secretary Problem
  2. Secretary Problems via Linear Programming
  3. A multiple-choice secretary algorithm with applications to online auctions
  4. AdWords and generalized on-line matching (IEEE Annual Symposium on Foundations of Computer Science)
  5. Mathematical Games
  6. Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP (JACM)
  7. A Knapsack Secretary Problem with Applications
  8. The Budgeted Maximum Coverage Problem
  9. An Online Algorithm for Maximizing Submodular Functions (Neural Information Processing Systems)
  10. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? (45th Annual IEEE Symposium on Foundations of Computer Science)

Their papers