Peter G. Jeavons
SIAM journal on computing (Print) · 2001–2005
A researcher in the Science corpus: 2 papers; trusts 2 researchers and is trusted by 1 researcher here, as inferred from the citation graph.
Whom Peter G. Jeavons trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Peter G. Jeavons overall
Papers from Peter G. Jeavons's perspective
Ordered by how strongly the researchers Peter G. Jeavons trusts endorse each paper. Same corpus, a different order for every researcher.
- I Computational Complexity
- Complexity classifications of Boolean constraint satisfaction problems (SIAM monographs on discrete mathematics and applications)
- Constraints
- On the learnability of Boolean formulae
- Efficient noise-tolerant learning from statistical queries
- A theory of the learnable
- Queries and concept learning
- Learning decision trees using the Fourier spectrum
- Differentially-private network trace analysis
- Differential Privacy – A Primer for the Perplexed
Their papers
- Classifying the Complexity of Constraints Using Finite Algebras (2005) — 604 citations
- Algebraic structures in combinatorial problems (2001) — 81 citations