H-Index & Metrics Best Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science D-index 33 Citations 6,256 93 World Ranking 6822 National Ranking 3267

Overview

What is he best known for?

The fields of study he is best known for:

  • 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.

His most cited work include:

  • 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)

What are the main themes of his work throughout his whole career to date?

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.

He most often published in these fields:

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

What were the highlights of his more recent work (between 2016-2021)?

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

In recent papers he was focusing on the following fields of study:

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.

Between 2016 and 2021, his most popular works were:

  • 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)

In his most recent research, the most cited papers focused on:

  • 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.

Best Publications

On the complexity of optimal K-anonymity

Adam Meyerson;Ryan Williams.
symposium on principles of database systems (2004)

1111 Citations

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

Ryan Williams.
international colloquium on automata, languages and programming (2005)

419 Citations

Backdoors to typical case complexity

Ryan Williams;Carla P. Gomes;Bart Selman.
international joint conference on artificial intelligence (2003)

415 Citations

Subcubic Equivalences between Path, Matrix and Triangle Problems

Virginia Vassilevska Williams;R. Ryan Williams.
foundations of computer science (2010)

265 Citations

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

Ryan Williams.
Information Processing Letters (2009)

263 Citations

Non-uniform ACC Circuit Lower Bounds

Ryan Williams.
conference on computational complexity (2011)

261 Citations

On the possibility of faster SAT algorithms

Mihai Pătraşcu;Ryan Williams.
symposium on discrete algorithms (2010)

229 Citations

Improving exhaustive search implies superpolynomial lower bounds

Ryan Williams.
symposium on the theory of computing (2010)

192 Citations

Faster all-pairs shortest paths via circuit complexity

R. Ryan Williams.
symposium on the theory of computing (2014)

188 Citations

Nonuniform ACC Circuit Lower Bounds

Ryan Williams.
Journal of the ACM (2014)

140 Citations

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

Contact us

Best Scientists Citing Ryan Williams

Fedor V. Fomin

Fedor V. Fomin

University of Bergen

Publications: 48

Saket Saurabh

Saket Saurabh

Institute of Mathematical Sciences

Publications: 43

Stefan Szeider

Stefan Szeider

TU Wien

Publications: 39

Daniel Lokshtanov

Daniel Lokshtanov

University of California, Santa Barbara

Publications: 31

Dániel Marx

Dániel Marx

Saarland University

Publications: 26

Rasmus Pagh

Rasmus Pagh

University of Copenhagen

Publications: 25

Monika Henzinger

Monika Henzinger

University of Vienna

Publications: 22

Lane A. Hemaspaandra

Lane A. Hemaspaandra

University of Rochester

Publications: 20

Russell Impagliazzo

Russell Impagliazzo

University of California, San Diego

Publications: 19

Gregory Gutin

Gregory Gutin

Royal Holloway University of London

Publications: 19

Hua Wang

Hua Wang

Victoria University

Publications: 18

Carla P. Gomes

Carla P. Gomes

Cornell University

Publications: 17

Jiuyong Li

Jiuyong Li

University of South Australia

Publications: 17

Fabrizio Grandoni

Fabrizio Grandoni

Dalle Molle Institute for Artificial Intelligence Research

Publications: 17

Danupon Nanongkai

Danupon Nanongkai

University of Copenhagen

Publications: 17

Dieter Kratsch

Dieter Kratsch

University of Lorraine

Publications: 16

Something went wrong. Please try again later.