C. Umans
Artificial Intelligence · 2007–2011
A researcher in the Science corpus: 3 papers; trusts 3 researchers and is trusted by 4 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 5 citations into it; #19,827 of 35,345 by trust here, #25,040 by citations
Whom C. Umans trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts C. Umans overall
Papers from C. Umans's perspective
Ordered by how strongly the researchers C. Umans trusts endorse each paper. Same corpus, a different order for every researcher.
- Computing with very weak random sources
- Randomness is Linear in Space
- Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds (Symposium on the Theory of Computing)
- Modern computer algebra (SIGA)
- A theory of the learnable
- Efficient noise-tolerant learning from statistical queries
- On the learnability of Boolean formulae
- Learning decision trees using the Fourier spectrum
- The JPEG still picture compression standard
- On Computable Numbers, with an Application to the Entscheidungsproblem.
Their papers
- Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes (2007) — 467 citations
- Fast Polynomial Factorization and Modular Composition (2011) — 259 citations
- Completeness in the Polynomial-Time Hierarchy A Compendium ∗ (2008) — 145 citations