Ryan Williams
Artificial Intelligence · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems · 2003–2011
A researcher in the Science corpus: 5 papers; trusts 14 researchers and is trusted by 35 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 14 citations into it; #6,398 of 35,345 by trust here, #12,761 by citations
- Computational Theory and Mathematics — 12 citations into it; #1,902 of 12,182 by trust here, #5,954 by citations
Whom Ryan Williams trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Uri Zwick
- Latanya Sweeney
- Donald Ervin Knuth
- Pierangela Samarati
- Sanjeev Arora
- Valentine Kabanets
- Frédéric Magniez
- Andreas Björklund
- J. Håstad
- Don Coppersmith
Who trusts Ryan Williams overall
- Amir Abboud
- Arturs Backurs
- Fedor V. Fomin
- Virginia Vassilevska Williams
- Charu C. Aggarwal
- Piotr Indyk
- Petteri Kaski
- Richard Ryan Williams
- Kristen LeFevre
- Josep Domingo-Ferrer
Papers from Ryan Williams's perspective
Ordered by how strongly the researchers Ryan Williams trusts endorse each paper. Same corpus, a different order for every researcher.
- On the design and quantification of privacy preserving data mining algorithms
- All pairs shortest paths using bridging sets and rectangular matrix multiplication (JACM)
- k-Anonymity: A Model for Protecting Privacy
- Quantum algorithms for the triangle problem (ACM-SIAM Symposium on Discrete Algorithms)
- Exact Algorithms for NP-Hard Problems: A Survey (Combinatorial Optimization)
- Generalizing data to provide anonymity when disclosing information (abstract)
- Multiplying matrices faster than coppersmith-winograd (Symposium on the Theory of Computing)
- Revealing information while preserving privacy
- Limiting privacy breaches in privacy preserving data mining
- Probabilistic Machines Can Use Less Running Time
Their papers
- A new algorithm for optimal 2-constraint satisfaction and its implications (2005) — 546 citations
- Subcubic Equivalences between Path, Matrix and Triangle Problems (2010) — 488 citations
- Non-uniform ACC Circuit Lower Bounds (2011) — 314 citations
- On the complexity of optimal K-anonymity (2004) — 920 citations
- Backdoors to typical case complexity (2003) — 389 citations