- Home
- Best Scientists - Computer Science
- Ryan Williams

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
35
Citations
6,772
164
World Ranking
7517
National Ranking
3536

- Algorithm
- Combinatorics
- Computational complexity theory

His primary scientific interests are in Combinatorics, Discrete mathematics, 3SUM, Matrix multiplication and Circuit complexity. The Combinatorics study combines topics in areas such as Matrix, NEXPTIME and Polynomial. Ryan Williams combines subjects such as Upper and lower bounds and Longest common subsequence problem with his study of NEXPTIME.

Ryan Williams interconnects Time complexity and Circuit satisfiability problem in the investigation of issues within Polynomial. His Discrete mathematics study combines topics in areas such as Computational complexity theory, Exponential function and Constant. Ryan Williams has included themes like Binary logarithm and Randomized algorithm in his Circuit complexity study.

- On the complexity of optimal K-anonymity (690 citations)
- A new algorithm for optimal 2-constraint satisfaction and its implications (335 citations)
- Backdoors to typical case complexity (289 citations)

The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Circuit complexity, Time complexity and Algorithm. He has researched Combinatorics in several fields, including Satisfiability, Polynomial and Matrix multiplication. Ryan Williams works mostly in the field of Matrix multiplication, limiting it down to topics relating to Directed graph and, in certain cases, Path, as a part of the same area of interest.

His Discrete mathematics study integrates concerns from other disciplines, such as Computational complexity theory, NEXPTIME, Quadratic equation and Upper and lower bounds. His Circuit complexity research incorporates themes from Boolean circuit, Boolean function, Complexity class, Nondeterministic algorithm and Function. His work deals with themes such as Theoretical computer science, Exponential function, Constant, Symmetric function and Integer, which intersect with Algorithm.

- Combinatorics (63.82%)
- Discrete mathematics (53.29%)
- Circuit complexity (21.05%)

- Combinatorics (63.82%)
- Discrete mathematics (53.29%)
- Binary logarithm (13.16%)

Combinatorics, Discrete mathematics, Binary logarithm, Randomized algorithm and Algorithm are his primary areas of study. His Combinatorics study combines topics from a wide range of disciplines, such as Function and Product. His Discrete mathematics research is multidisciplinary, relying on both System of polynomial equations, Polynomial, Quadratic equation and Brute-force search.

His Binary logarithm research includes elements of Matching and Upper and lower bounds. His Randomized algorithm research incorporates elements of Satisfiability and Deterministic algorithm. His study on Algorithm also encompasses disciplines like

- Symmetric function that intertwine with fields like Linear programming,
- Integer, which have a strong connection to Constant.

- Subcubic Equivalences Between Path, Matrix, and Triangle Problems (64 citations)
- Tight hardness for shortest cycles and paths in sparse graphs (35 citations)
- Distributed PCP Theorems for Hardness of Approximation in P (34 citations)

- Algorithm
- Combinatorics
- Computational complexity theory

Ryan Williams spends much of his time researching Combinatorics, Discrete mathematics, Matrix multiplication, Circuit complexity and Shortest path problem. His work on Combinatorics deals in particular with Minimum weight, Complexity class, Exponential time hypothesis, Binary logarithm and Reduction. Ryan Williams studies Discrete mathematics, namely Independent set.

His Matrix multiplication research includes themes of Multiplication, Logical matrix, Semiring and Conjecture. His Circuit complexity study incorporates themes from Satisfiability and Nondeterministic algorithm. In his work, Product is strongly intertwined with Graph algorithms, which is a subfield of Shortest path problem.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

On the complexity of optimal K-anonymity

Adam Meyerson;Ryan Williams.

symposium on principles of database systems **(2004)**

1169 Citations

A new algorithm for optimal 2-constraint satisfaction and its implications

Ryan Williams.

international colloquium on automata, languages and programming **(2005)**

461 Citations

Backdoors to typical case complexity

Ryan Williams;Carla P. Gomes;Bart Selman.

international joint conference on artificial intelligence **(2003)**

433 Citations

Subcubic Equivalences between Path, Matrix and Triangle Problems

Virginia Vassilevska Williams;Ryan Williams.

foundations of computer science **(2010)**

286 Citations

Non-uniform ACC Circuit Lower Bounds

Ryan Williams.

conference on computational complexity **(2011)**

279 Citations

Finding paths of length k in O∗(2k) time

Ryan Williams.

Information Processing Letters **(2009)**

272 Citations

On the possibility of faster SAT algorithms

Mihai Pătraşcu;Ryan Williams.

symposium on discrete algorithms **(2010)**

237 Citations

Improving exhaustive search implies superpolynomial lower bounds

Ryan Williams.

symposium on the theory of computing **(2010)**

201 Citations

Faster all-pairs shortest paths via circuit complexity

Ryan Williams.

symposium on the theory of computing **(2014)**

188 Citations

Faster all-pairs shortest paths via circuit complexity

R. Ryan Williams.

symposium on the theory of computing **(2014)**

188 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

University of Haifa

University of Illinois at Urbana-Champaign

University of California, San Diego

University of California, San Diego

University of Michigan–Ann Arbor

University of Rochester

Stanford University

Cornell University

Cornell University

University of California, San Diego

Deakin University

University of Hannover

University of Sydney

Hunan University

University of Oslo

Fuzhou University

Stanford University

City University of Hong Kong

University of Tokyo

Centers for Disease Control and Prevention

Carnegie Institution for Science

University of Arizona

University of California, San Francisco

Cornell University

University College London

Duke University

Something went wrong. Please try again later.