Personal information

Websites & social links

Website at MIT CSAIL

Other IDs

Scopus Author ID: 7409605661
Scopus Author ID: 57210115671

Activities

Collapse all

Employment (4)

Massachusetts Institute of Technology: Cambridge, MA, US

2017-01-01 to present | Professor (Electrical Engineering and Computer Science)
Employment
Source: Self-asserted source
Richard Ryan Williams

Stanford University: Stanford, CA, US

2011-09-01 to 2016-12-31 | Assistant Professor (Computer Science)
Employment
Source: Self-asserted source
Richard Ryan Williams

IBM Almaden Research Center: San Jose, CA, US

2009-09-01 to 2011-08-31 | Josef Raviv Postdoctoral Fellow (Principles and Methodologies (Theory Group))
Employment
Source: Self-asserted source
Richard Ryan Williams

Institute for Advanced Study: Princeton, US

2008-09-01 to 2009-08-31 | Member (Mathematics)
Employment
Source: Self-asserted source
Richard Ryan Williams

Education and qualifications (1)

Carnegie Mellon University: Pittsburgh, PA, US

2002-08-15 to 2007-07-31 | PhD (Computer Science)
Education
Source: Self-asserted source
Richard Ryan Williams

Works (50 of 133)

Items per page:
Page 1 of 3

Towards Stronger Depth Lower Bounds

2024 | Conference paper
DOI: 10.4230/LIPICS.ITCS.2024.10
Contributors: Gabriel Bathie; R. Ryan Williams
Source: Self-asserted source
Richard Ryan Williams

Beating Brute Force for Compression Problems

2024-06-10 | Conference paper
DOI: 10.1145/3618260.3649778
Contributors: Shuichi Hirahara; Rahul Ilango; R. Ryan Williams
Source: check_circle
Crossref

Self-Improvement for Circuit-Analysis Problems

2024-06-10 | Conference paper
DOI: 10.1145/3618260.3649723
Contributors: R. Ryan Williams
Source: check_circle
Crossref

On Oracles and Algorithmic Methods for Proving Lower Bounds

2023 | Conference paper
DOI: 10.4230/LIPICS.ITCS.2023.99
Contributors: Nikhil Vyas; Ryan Williams
Source: Self-asserted source
Richard Ryan Williams

Derandomization vs Refutation: A Unified Framework for Characterizing Derandomization

2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)
2023-11-06 | Conference paper
DOI: 10.1109/focs57990.2023.00062
Contributors: Lijie Chen; Roei Tell; Ryan Williams
Source: Self-asserted source
Richard Ryan Williams

Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic

Proceedings of the 55th Annual ACM Symposium on Theory of Computing
2023-06-02 | Conference paper
DOI: 10.1145/3564246.3585187
Contributors: Rahul Ilango; Jiatu Li; R. Ryan Williams
Source: Self-asserted source
Richard Ryan Williams

Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms

Theory of Computing Systems
2023-02 | Journal article
DOI: 10.1007/s00224-022-10106-8
Contributors: Nikhil Vyas; R. Ryan Williams
Source: check_circle
Crossref

Constructive Separations and Their Consequences

2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
2022-02 | Conference paper
DOI: 10.1109/focs52979.2021.00069
Contributors: Lijie Chen; Ce Jin; Rahul Santhanam; R. Ryan Williams
Source: Self-asserted source
Richard Ryan Williams

Black-Box Hypotheses and Lower Bounds

Leibniz International Proceedings in Informatics, LIPIcs
2021 | Conference paper
DOI: 10.4230/LIPIcs.MFCS.2021.29
EID:

2-s2.0-85115363103

ISBN: 9783959772013
Part of ISSN: 18688969
Contributors: Chapman, B.K.; Williams, R.R.
Source: Self-asserted source
Richard Ryan Williams via Scopus - Elsevier

Circuit depth reductions

Leibniz International Proceedings in Informatics, LIPIcs
2021 | Conference paper
DOI: 10.4230/LIPIcs.ITCS.2021.24
EID:

2-s2.0-85111184675

ISBN: 9783959771771
Part of ISSN: 18688969
Contributors: Golovnev, A.; Kulikov, A.S.; Ryan Williams, R.
Source: Self-asserted source
Richard Ryan Williams via Scopus - Elsevier

From circuit complexity to faster all-pairs shortest paths

SIAM Review
2021 | Journal article
DOI: 10.1137/21M1418654
EID:

2-s2.0-85112864056

Part of ISSN: 00361445
Contributors: Williams, R.R.
Source: Self-asserted source
Richard Ryan Williams via Scopus - Elsevier

On Super Strong ETH

Journal of Artificial Intelligence Research
2021-01-27 | Journal article | Author
DOI: 10.1613/jair.1.11859
Part of ISSN: 1076-9757
Contributors: Nikhil Vyas; Richard Ryan Williams
Source: Self-asserted source
Richard Ryan Williams
grade
Preferred source (of 2)‎

Circuit lower bounds for nondeterministic quasi-polytime from a new easy witness lemma

SIAM Journal on Computing
2020 | Journal article
DOI: 10.1137/18M1195887
EID:

2-s2.0-85096182587

Part of ISSN: 10957111 00975397
Contributors: MURRAY, C.D.; WILLIAMS, R.R.
Source: Self-asserted source
Richard Ryan Williams via Scopus - Elsevier

Lower bounds against sparse symmetric functions of ACC circuits: Expanding the reach of #SAT algorithms

Leibniz International Proceedings in Informatics, LIPIcs
2020 | Conference paper
DOI: 10.4230/LIPIcs.STACS.2020.59
EID:

2-s2.0-85082115467

ISBN: 9783959771405
Part of ISSN: 18688969
Contributors: Vyas, N.; Ryan Williams, R.
Source: Self-asserted source
Richard Ryan Williams via Scopus - Elsevier

Time-space lower bounds for simulating proof systems with quantum and randomized verifiers

arXiv
2020 | Other
DOI: 10.48550/arxiv.2012.00330
EID:

2-s2.0-85170923477

Part of ISSN: 23318422
Contributors: Mudigonda, A.S.; Williams, R.R.
Source: Self-asserted source
Richard Ryan Williams via Scopus - Elsevier

Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization

2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
2020-11 | Conference paper
DOI: 10.1109/focs46700.2020.00009
Contributors: Lijie Chen; Xin Lyu; R. Ryan Williams
Source: Self-asserted source
Richard Ryan Williams

Hardness magnification for all sparse np languages

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
2019 | Conference paper
DOI: 10.1109/FOCS.2019.00077
EID:

2-s2.0-85077984413

ISBN: 9781728149523
Part of ISSN: 02725428
Contributors: Chen, L.; Jin, C.; Ryan Williams, R.
Source: Self-asserted source
Richard Ryan Williams via Scopus - Elsevier

New algorithms and lower bounds for circuits with linear threshold gates

Theory of Computing
2019 | Journal article
DOI: 10.4086/toc.2018.v014a017
EID:

2-s2.0-85062164640

Part of ISSN: 15572862
Contributors: Ryan Williams, R.
Source: Self-asserted source
Richard Ryan Williams via Scopus - Elsevier

Some estimated likelihoods for computational complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2019 | Book chapter
DOI: 10.1007/978-3-319-91908-9_2
EID:

2-s2.0-85087457823

Part of ISSN: 16113349 03029743
Contributors: Williams, R.R.
Source: Self-asserted source
Richard Ryan Williams via Scopus - Elsevier

The orthogonal vectors conjecture for branching programs and formulas

Leibniz International Proceedings in Informatics, LIPIcs
2019 | Conference paper
DOI: 10.4230/LIPIcs.ITCS.2019.48
EID:

2-s2.0-85069510871

ISBN: 9783959770958
Part of ISSN: 18688969
Contributors: Kane, D.M.; Williams, R.R.
Source: Self-asserted source
Richard Ryan Williams via Scopus - Elsevier

Weak lower bounds on resource-bounded compression imply strong separations of complexity classes

Proceedings of the Annual ACM Symposium on Theory of Computing
2019 | Conference paper
DOI: 10.1145/3313276.3316396
EID:

2-s2.0-85068772640

ISBN: 9781450367059
Part of ISSN: 07378017
Contributors: McKay, D.M.; Murray, C.D.; Williams, R.R.
Source: Self-asserted source
Richard Ryan Williams via Scopus - Elsevier

Circuit depth reductions

arXiv
2018 | Other
DOI: 10.48550/arxiv.1811.04828
EID:

2-s2.0-85170736845

Part of ISSN: 23318422
Contributors: Golovnev, A.; Kulikov, A.S.; Williams, R.R.
Source: Self-asserted source
Richard Ryan Williams via Scopus - Elsevier

Counting solutions to polynomial systems via reductions

OpenAccess Series in Informatics
2018 | Conference paper
DOI: 10.4230/OASIcs.SOSA.2018.6
EID:

2-s2.0-85040694044

ISBN: 9783959770644
Part of ISSN: 21906807
Contributors: Williams, R.R.
Source: Self-asserted source
Richard Ryan Williams via Scopus - Elsevier

Faster all-pairs shortest paths via circuit complexity

SIAM Journal on Computing
2018 | Conference paper
DOI: 10.1137/15M1024524
EID:

2-s2.0-85056086973

Part of ISSN: 10957111 00975397
Contributors: Ryan Williams, R.
Source: Self-asserted source
Richard Ryan Williams via Scopus - Elsevier

Limits on representing boolean functions by linear combinations of simple functions: Thresholds, relus, and low-degree polynomials

Leibniz International Proceedings in Informatics, LIPIcs
2018 | Conference paper
DOI: 10.4230/LIPIcs.CCC.2018.6
EID:

2-s2.0-85048961559

ISBN: 9783959770699
Part of ISSN: 18688969
Contributors: Williams, R.R.
Source: Self-asserted source
Richard Ryan Williams via Scopus - Elsevier

Limits on representing Boolean functions by linear combinations of simple functions: thresholds, ReLUs, and low-degree polynomials

arXiv
2018 | Other
DOI: 10.48550/arxiv.1802.09121
EID:

2-s2.0-85170807681

Part of ISSN: 23318422
Contributors: Williams, R.R.
Source: Self-asserted source
Richard Ryan Williams via Scopus - Elsevier

On the Difference Between Closest, Furthest, and Orthogonal Pairs: Nearly-Linear vs Barely-Subquadratic Complexity

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
2018-01 | Other
DOI: 10.1137/1.9781611975031.78
Part of ISBN: 9781611975031
Contributors: Ryan Williams
Source: Self-asserted source
Richard Ryan Williams via Crossref Metadata Search

Tight Hardness for Shortest Cycles and Paths in Sparse Graphs

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
2018-01 | Other
DOI: 10.1137/1.9781611975031.80
Part of ISBN: 9781611975031
Contributors: Andrea Lincoln; Virginia Vassilevska Williams; Ryan Williams
Source: Self-asserted source
Richard Ryan Williams via Crossref Metadata Search

Beating brute force for systems of polynomial equations over finite fields

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
2017 | Conference paper
EID:

2-s2.0-85016209017
Contributors: Lokshtanov, D.; Paturi, R.; Tamaki, S.; Williams, R.; Yu, H.
Source: Self-asserted source
Richard Ryan Williams via Scopus - Elsevier

Completeness for first-order properties on sparse structures with algorithmic applications

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
2017 | Conference paper
EID:

2-s2.0-85016167587
Contributors: Gao, J.; Impagliazzo, R.; Kolokolova, A.; Williams, R.
Source: Self-asserted source
Richard Ryan Williams via Scopus - Elsevier

Easiness amplification and uniform circuit lower bounds

Leibniz International Proceedings in Informatics, LIPIcs
2017 | Conference paper
DOI: 10.4230/LIPIcs.CCC.2017.8
EID:

2-s2.0-85028750150
Contributors: Murray, C.D.; Williams, R.R.
Source: Self-asserted source
Richard Ryan Williams via Scopus - Elsevier

Faster online matrix-vector multiplication

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
2017 | Conference paper
EID:

2-s2.0-85016200096
Contributors: Larsen, K.G.; Williams, R.
Source: Self-asserted source
Richard Ryan Williams via Scopus - Elsevier

On the (non) NP-hardness of computing circuit complexity

Theory of Computing
2017 | Journal article
DOI: 10.4086/toc.2017.v013a004
EID:

2-s2.0-85041682196
Contributors: Murray, C.D.; Williams, R.R.
Source: Self-asserted source
Richard Ryan Williams via Scopus - Elsevier

Probabilistic rank and matrix rigidity

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017
2017 | Conference paper
DOI: 10.1145/3055399.3055484
Part of ISBN: 9781450345286
Contributors: Josh Alman; Ryan Williams
Source: Self-asserted source
Richard Ryan Williams via Crossref Metadata Search

Distributed PCP Theorems for Hardness of Approximation in P

2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
2017-10 | Conference paper
DOI: 10.1109/focs.2017.12
Part of ISBN: 9781538634646
Contributors: Amir Abboud; Aviad Rubinstein; Ryan Williams
Source: Self-asserted source
Richard Ryan Williams via Crossref Metadata Search
grade
Preferred source (of 2)‎

Beating Brute Force for Systems of Polynomial Equations over Finite Fields

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
2017-01 | Conference paper
DOI: 10.1137/1.9781611974782.143
Part of ISBN: 9781611974782
Contributors: Daniel Lokshtanov; Ramamohan Paturi; Suguru Tamaki; Ryan Williams; Huacheng Yu
Source: Self-asserted source
Richard Ryan Williams via Crossref Metadata Search

Completeness for First-Order Properties on Sparse Structures with Algorithmic Applications

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
2017-01 | Conference paper
DOI: 10.1137/1.9781611974782.141
Part of ISBN: 9781611974782
Contributors: Jiawei Gao; Russell Impagliazzo; Antonina Kolokolova; Ryan Williams
Source: Self-asserted source
Richard Ryan Williams via Crossref Metadata Search

Faster Online Matrix-Vector Multiplication

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
2017-01 | Conference paper
DOI: 10.1137/1.9781611974782.142
Part of ISBN: 9781611974782
Contributors: Kasper Green Larsen; Ryan Williams
Source: Self-asserted source
Richard Ryan Williams via Crossref Metadata Search

Deterministic APSP, orthogonal vectors, and more: Quickly derandomizing razborov-smolensky

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
2016 | Conference paper
EID:

2-s2.0-84963654042
Contributors: Chan, T.M.; Williams, R.
Source: Self-asserted source
Richard Ryan Williams via Scopus - Elsevier

Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016
2016 | Conference paper
DOI: 10.1145/2897518.2897653
Part of ISBN: 9781450341325
Contributors: Amir Abboud; Thomas Dueholm Hansen; Virginia Vassilevska Williams; Ryan Williams
Source: Self-asserted source
Richard Ryan Williams via Crossref Metadata Search

Strong ETH breaks with Merlin and Arthur: Short non-interactive proofs of batch evaluation

Leibniz International Proceedings in Informatics, LIPIcs
2016 | Conference paper
DOI: 10.4230/LIPIcs.CCC.2016.2
EID:

2-s2.0-84973300782

ISBN: 9783959770088
Part of ISSN: 18688969
Contributors: Williams, R.R.
Source: Self-asserted source
Richard Ryan Williams via Scopus - Elsevier

Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016
2016 | Conference paper
DOI: 10.1145/2897518.2897636
Part of ISBN: 9781450341325
Contributors: Daniel M. Kane; Ryan Williams
Source: Self-asserted source
Richard Ryan Williams via Crossref Metadata Search

Polynomial Representations of Threshold Functions and Algorithmic Applications

2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
2016-10 | Conference paper
DOI: 10.1109/focs.2016.57
Part of ISBN: 9781509039333
Contributors: Josh Alman; Timothy M. Chan; Ryan Williams
Source: Self-asserted source
Richard Ryan Williams via Crossref Metadata Search
grade
Preferred source (of 2)‎

LIMITS and Applications of Group Algebras for Parameterized Problems

ACM Transactions on Algorithms
2016-05 | Journal article
DOI: 10.1145/2885499
Part of ISSN: 1549-6325
Contributors: Ioannis Koutis; Ryan Williams
Source: Self-asserted source
Richard Ryan Williams via Crossref Metadata Search

Natural Proofs versus Derandomization

SIAM Journal on Computing
2016-01 | Journal article
DOI: 10.1137/130938219
Part of ISSN: 0097-5397
Contributors: R. Ryan Williams
Source: Self-asserted source
Richard Ryan Williams via Crossref Metadata Search

Algebraic fingerprints for faster algorithms

Communications of the ACM
2015 | Journal article
DOI: 10.1145/2742544
Part of ISSN: 0001-0782
Contributors: Ioannis Koutis; Ryan Williams
Source: Self-asserted source
Richard Ryan Williams via Crossref Metadata Search

Beating exhaustive search for quantified Boolean formulas and connections to circuit complexity

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
2015 | Conference paper
EID:

2-s2.0-84938246684
Contributors: Santhanam, R.; Williams, R.
Source: Self-asserted source
Richard Ryan Williams via Scopus - Elsevier

Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms
2015 | Conference paper
DOI: 10.1137/1.9781611974331.ch87
Part of ISBN: 9781611974331
Contributors: Timothy M. Chan; Ryan Williams
Source: Self-asserted source
Richard Ryan Williams via Crossref Metadata Search

Exact Algorithms and Strong Exponential Time Hypothesis

Encyclopedia of Algorithms
2015 | Other
DOI: 10.1007/978-3-642-27848-8_519-1
Part of ISBN: 9783642278488
Contributors: Joshua R. Wang; Ryan Williams
Source: Self-asserted source
Richard Ryan Williams via Crossref Metadata Search

Exact Algorithms for Maximum Two-Satisfiability

Encyclopedia of Algorithms
2015 | Other
DOI: 10.1007/978-3-642-27848-8_227-2
Part of ISBN: 9783642278488
Contributors: Ryan Williams
Source: Self-asserted source
Richard Ryan Williams via Crossref Metadata Search
Items per page:
Page 1 of 3
How many people are using ORCID?