Ryan Williams | Academic Influence

Ryan Williams 's AcademicInfluence.com Rankings

Ryan Williams

Computer Science

#2188

World Rank

#2277

Historical Rank

#990

USA Rank

Database

#9836

World Rank

#10422

Historical Rank

#1439

USA Rank

computer-science Degrees

Download Badge

Computer Science

Ryan Williams 's Degrees

PhD Computer Science Stanford University
Masters Computer Science Stanford University

Similar Degrees You Can Earn

Why Is Ryan Williams Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Richard Ryan Williams, known as Ryan Williams , is an American theoretical computer scientist working in computational complexity theory and algorithms. Education Williams graduated from the Alabama School of Mathematics and Science before receiving his bachelor's degree in math and computer science from Cornell University in 2001 and his Ph.D in computer science in 2007 from Carnegie Mellon University under the supervision of Manuel Blum. From 2010 to 2012, he was a member of the Theory Group of IBM Almaden Research Center. From Fall 2011 to Fall 2016, he was a professor at Stanford University. In January 2017, he joined the faculty at MIT.

(See a Problem?)

Ryan Williams 's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

More Applications of the Polynomial Method to Algorithm Design (2015) (133)
Distributed PCP Theorems for Hardness of Approximation in P (2017) (87)
Tight Hardness for Shortest Cycles and Paths in Sparse Graphs (2017) (84)
On the (Non) NP-Hardness of Computing Circuit Complexity (2015) (68)
Identifying vulnerabilities of consumer Internet of Things (IoT) devices: A scalable approach (2017) (68)
Finding Four-Node Subgraphs in Triangle Time (2015) (64)
On the connections between backdoors, restarts, and heavy-tailedness in combinatorial search (2003) (55)
Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation (2016) (52)
Completeness for First-order Properties on Sparse Structures with Algorithmic Applications (2017) (48)
Probabilistic rank and matrix rigidity (2016) (47)
Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP (2018) (47)
Beating Brute Force for Systems of Polynomial Equations over Finite Fields (2017) (45)
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers (2007) (43)
Assessing medical device vulnerabilities on the Internet of Things (2017) (34)
The Polynomial Method in Circuit Complexity Applied to Algorithm Design (Invited Talk) (2014) (33)
Weak lower bounds on resource-bounded compression imply strong separations of complexity classes (2019) (31)
Deterministic Time-Space Tradeoffs for k-SUM (2016) (31)
Limits on representing Boolean functions by linear combinations of simple functions: thresholds, ReLUs, and low-degree polynomials (2018) (20)
Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity (2019) (20)
Incremental Hacker Forum Exploit Collection and Classification for Proactive Cyber Threat Intelligence: An Exploratory Study (2018) (19)
Learning Multi-Agent Communication through Structured Attentive Reasoning (2020) (17)
Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma (2020) (16)
Relations and equivalences between circuit lower bounds and karp-lipton theorems (2019) (15)
Finding Bugs Using Your Own Code: Detecting Functionally-similar yet Inconsistent Code (2021) (14)
Beating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit Complexity (2015) (13)
Some Estimated Likelihoods for Computational Complexity (2019) (12)
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants (2018) (12)
Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms (2020) (9)
Counting Solutions to Polynomial Systems via Reductions (2018) (9)
The Orthogonal Vectors Conjecture for Branching Programs and Formulas (2017) (9)
On Super Strong ETH (2019) (7)
Deterministic APSP, Orthogonal Vectors, and More (2020) (6)
Faster Deterministic and Las Vegas Algorithms for Offline Approximate Nearest Neighbors in High Dimensions (2020) (5)
Lower bounds for the depth of modular squaring (2020) (5)
Exact Algorithms and Strong Exponential Time Hypothesis (2016) (5)
Automated Proofs of Time Lower Bounds (2007) (5)
”Naked and on Fire”: Examining Player Agency Experiences in Narrative-Focused Gameplay (2021) (4)
Context-aware system synthesis, task assignment, and routing (2017) (4)
Evaluation of Visualization Heuristics (2018) (3)
Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random Oracle (2019) (2)
Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions (2021) (2)
Some ways of thinking algorithmically about impossibility (2017) (2)
Moby: A Blackout-Resistant Anonymity Network for Mobile Devices (2022) (1)
Feasibility of using piezohydraulic pumps as motors for pediatric ventricular assist devices (2012) (1)
From Circuit Complexity to Faster All-Pairs Shortest Paths (2021) (1)
Lower Bounds by Algorithm Design: A Progress Report (Invited Paper) (2018) (0)
Black-Box Hypotheses and Lower Bounds (2021) (0)
Easiness Amplification and Uniform Circuit Lower Bounds (2017) (0)
Time-Space Lower Bounds for Simulating Proof Systems with Quantum and Randomized Verifiers (2020) (0)
Thinking Algorithmically About Impossibility (2015) (0)
Thinking Algorithmically About Impossibility (Invited Talk) (2015) (0)
Complexity Lower Bounds from Algorithm Design (2021) (0)

This paper list is powered by the following services:

Other Resources About Ryan Williams

en.wikipedia.org

What Schools Are Affiliated With Ryan Williams ?

Ryan Williams is affiliated with the following schools:

Image Attributions

Image Source for Ryan Williams