Eric Allender
1992–2004
A researcher in the Science corpus: 2 papers; trusts 1 researcher and is trusted by 0 researchers here, as inferred from the citation graph.
Whom Eric Allender trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Eric Allender overall
Papers from Eric Allender's perspective
Ordered by how strongly the researchers Eric Allender trusts endorse each paper. Same corpus, a different order for every researcher.
- A personal communication
- The Complexity of Computing the Permanent
- Probabilistic checking of proofs: a new characterization of NP
- Proof verification and hardness of approximation problems
- PRIMES is in P
- Probabilistic algorithms for sparse polynomials
- I Computational Complexity
- IP = PSPACE
- Non-deterministic exponential time has two-prover interactive protocols (Computational Complexity)
- Fast Probabilistic Algorithms for Verification of Polynomial Identities