The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of R. Ryan Williams Richard Ryan Williams Ryan Williams 0001 ( http://dblp.L3S.de/Authors/R._Ryan_Williams )

URL (Homepage):  http://people.csail.mit.edu/rrw/  Author page on DBLP  Author page in RDF  Community of R. Ryan Williams in ASPL-2

Publication years (Num. hits)
2002-2006 (15) 2007-2009 (19) 2010-2011 (20) 2012-2013 (21) 2014-2015 (25) 2016 (17) 2017-2018 (24) 2019 (14)
Publication types (Num. hits)
article(70) incollection(4) inproceedings(81)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 20 occurrences of 17 keywords

Results
Found 156 publication records. Showing 155 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Lijie Chen, Dylan M. McKay, Cody Murray, R. Ryan Williams Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1R. Ryan Williams Some Estimated Likelihoods for Computational Complexity. Search on Bibsonomy Computing and Software Science The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nikhil Vyas 0001, R. Ryan Williams On Super Strong ETH. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dylan M. McKay, Cody D. Murray, R. Ryan Williams Weak lower bounds on resource-bounded compression imply strong separations of complexity classes. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Lijie Chen, Dylan M. McKay, Cody D. Murray, R. Ryan Williams Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems. Search on Bibsonomy CCC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Lijie Chen, R. Ryan Williams Stronger Connections Between Circuit Analysis and Circuit Lower Bounds, via PCPs of Proximity. Search on Bibsonomy CCC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Daniel M. Kane, Richard Ryan Williams The Orthogonal Vectors Conjecture for Branching Programs and Formulas. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dylan M. McKay, Richard Ryan Williams Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random Oracle. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jiawei Gao 0001, Russell Impagliazzo, Antonina Kolokolova, Ryan Williams 0001 Completeness for First-order Properties on Sparse Structures with Algorithmic Applications. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Andreas Björklund, Petteri Kaski, Ryan Williams 0001 Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Lijie Chen, Ce Jin, Ryan Williams 0001 Hardness Magnification for all Sparse NP Languages. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Lijie Chen, Ryan Williams 0001 An Equivalence Class for Orthogonal Vectors. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Andreas Björklund, Petteri Kaski, Ryan Williams 0001 Solving Systems of Polynomial Equations over GF(2) by a Parity-Counting Self-Reduction. Search on Bibsonomy ICALP The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Andreas Björklund, Ryan Williams 0001 Computing Permanents and Counting Hamiltonian Cycles by Listing Dissimilar Vectors. Search on Bibsonomy ICALP The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1R. Ryan Williams New Algorithms and Lower Bounds for Circuits With Linear Threshold Gates. Search on Bibsonomy Theory of Computing The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Virginia Vassilevska Williams, R. Ryan Williams Subcubic Equivalences Between Path, Matrix, and Triangle Problems. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1R. Ryan Williams Limits on representing Boolean functions by linear combinations of simple functions: thresholds, ReLUs, and low-degree polynomials. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1R. Ryan Williams Faster All-Pairs Shortest Paths via Circuit Complexity. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Andrea Lincoln, Virginia Vassilevska Williams, R. Ryan Williams Tight Hardness for Shortest Cycles and Paths in Sparse Graphs. Search on Bibsonomy SODA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1R. Ryan Williams Counting Solutions to Polynomial Systems via Reductions. Search on Bibsonomy SOSA@SODA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Cody Murray, R. Ryan Williams Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Richard Ryan Williams Lower Bounds by Algorithm Design: A Progress Report (Invited Paper). Search on Bibsonomy ICALP The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Richard Ryan Williams Limits on Representing Boolean Functions by Linear Combinations of Simple Functions: Thresholds, ReLUs, and Low-Degree Polynomials. Search on Bibsonomy CCC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Lijie Chen, Ryan Williams 0001 An Equivalence Class for Orthogonal Vectors. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Ryan Williams 0001 On the Difference Between Closest, Furthest, and Orthogonal Pairs: Nearly-Linear vs Barely-Subquadratic Complexity. Search on Bibsonomy SODA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1R. Ryan Williams Some ways of thinking algorithmically about impossibility. Search on Bibsonomy SIGLOG News The full citation details ... 2017 DBLP  BibTeX  RDF
1Cody D. Murray, R. Ryan Williams On the (Non) NP-Hardness of Computing Circuit Complexity. Search on Bibsonomy Theory of Computing The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Cody Murray, R. Ryan Williams Circuit Lower Bounds for Nondeterministic Quasi-Polytime: An Easy Witness Lemma for NP and NQP. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2017 DBLP  BibTeX  RDF
1Andrea Lincoln, Virginia Vassilevska Williams, R. Ryan Williams Tight Hardness for Shortest Cycles and Paths in Sparse Graphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Daniel M. Kane, R. Ryan Williams The Orthogonal Vectors Conjecture for Branching Programs and Formulas. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1R. Ryan Williams On the Difference Between Closest, Furthest, and Orthogonal Pairs: Nearly-Linear vs Barely-Subquadratic Complexity in Computational Geometry. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Jiawei Gao 0001, Russell Impagliazzo, Antonina Kolokolova, R. Ryan Williams Completeness for First-Order Properties on Sparse Structures with Algorithmic Applications. Search on Bibsonomy SODA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Kasper Green Larsen, R. Ryan Williams Faster Online Matrix-Vector Multiplication. Search on Bibsonomy SODA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Ramamohan Paturi, Suguru Tamaki, R. Ryan Williams, Huacheng Yu Beating Brute Force for Systems of Polynomial Equations over Finite Fields. Search on Bibsonomy SODA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Amir Abboud, Aviad Rubinstein, R. Ryan Williams Distributed PCP Theorems for Hardness of Approximation in P. Search on Bibsonomy FOCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Josh Alman, R. Ryan Williams Probabilistic rank and matrix rigidity. Search on Bibsonomy STOC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Cody D. Murray, R. Ryan Williams Easiness Amplification and Uniform Circuit Lower Bounds. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Andreas Björklund, Petteri Kaski, R. Ryan Williams Generalized Kakeya Sets for Polynomial Evaluation and Faster Computation of Fermionants. Search on Bibsonomy IPEC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Andrea Lincoln, Virginia Vassilevska Williams, Joshua R. Wang, R. Ryan Williams Deterministic Time-Space Tradeoffs for k-SUM. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1R. Ryan Williams Natural Proofs versus Derandomization. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Josh Alman, Timothy M. Chan, R. Ryan Williams Polynomial Representations of Threshold Functions and Algorithmic Applications. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Andrea Lincoln, Virginia Vassilevska Williams, Joshua R. Wang, R. Ryan Williams Deterministic Time-Space Trade-Offs for k-SUM. Search on Bibsonomy ICALP The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Joshua R. Wang, Richard Ryan Williams Exact Algorithms and Strong Exponential Time Hypothesis. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Richard Ryan Williams Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation. Search on Bibsonomy Conference on Computational Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ryan Williams 0001 Exact Algorithms for Maximum Two-Satisfiability. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ioannis Koutis, Ryan Williams 0001 LIMITS and Applications of Group Algebras for Parameterized Problems. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ryan Williams 0001 Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2016 DBLP  BibTeX  RDF
1Ryan Williams 0001 Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Josh Alman, Ryan Williams 0001 Probabilistic Rank and Matrix Rigidity. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Kasper Green Larsen, Ryan Williams 0001 Faster Online Matrix-Vector Multiplication. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Josh Alman, Timothy M. Chan, Ryan Williams 0001 Polynomial Representations of Threshold Functions and Algorithmic Applications. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Ioannis Koutis, Ryan Williams 0001 Algebraic fingerprints for faster algorithms. Search on Bibsonomy Commun. ACM The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Timothy M. Chan, Ryan Williams 0001 Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky. Search on Bibsonomy SODA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Daniel M. Kane, Ryan Williams 0001 Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits. Search on Bibsonomy STOC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Amir Abboud, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Ryan Williams 0001 Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made. Search on Bibsonomy STOC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1R. Ryan Williams Thinking Algorithmically About Impossibility (Invited Talk). Search on Bibsonomy CSL The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Rahul Santhanam, Richard Ryan Williams Beating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit Complexity. Search on Bibsonomy SODA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Amir Abboud, Richard Ryan Williams, Huacheng Yu More Applications of the Polynomial Method to Algorithm Design. Search on Bibsonomy SODA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Virginia Vassilevska Williams, Joshua R. Wang, Richard Ryan Williams, Huacheng Yu Finding Four-Node Subgraphs in Triangle Time. Search on Bibsonomy SODA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Cody D. Murray, Richard Ryan Williams On the (Non) NP-Hardness of Computing Circuit Complexity. Search on Bibsonomy Conference on Computational Complexity The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Armin Biere, Vijay Ganesh, Martin Grohe, Jakob Nordström, Ryan Williams 0001 Theory and Practice of SAT Solving (Dagstuhl Seminar 15171). Search on Bibsonomy Dagstuhl Reports The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Samuel R. Buss, Ryan Williams 0001 Limits on Alternation Trading Proofs for Time-Space Lower Bounds. Search on Bibsonomy Computational Complexity The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Daniel M. Kane, Ryan Williams 0001 Super-Linear Gate and Super-Quadratic Wire Lower Bounds for Depth-Two and Depth-Three Threshold Circuits. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2015 DBLP  BibTeX  RDF
1Daniel M. Kane, Ryan Williams 0001 Super-Linear Gate and Super-Quadratic Wire Lower Bounds for Depth-Two and Depth-Three Threshold Circuits. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Josh Alman, Ryan Williams 0001 Probabilistic Polynomials and Hamming Nearest Neighbors. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Amir Abboud, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Ryan Williams 0001 Simulating Branching Programs with Edit Distance and Friends or: A Polylog Shaved is a Lower Bound Made. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Brynmor Chapman, Ryan Williams 0001 The Circuit-Input Game, Natural Proofs, and Testing Circuits With Data. Search on Bibsonomy ITCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Josh Alman, Ryan Williams 0001 Probabilistic Polynomials and Hamming Nearest Neighbors. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Dirk Van Gucht, Ryan Williams 0001, David P. Woodruff, Qin Zhang 0001 The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication. Search on Bibsonomy PODS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Richard Ryan Williams The Polynomial Method in Circuit Complexity Applied to Algorithm Design (Invited Talk). Search on Bibsonomy FSTTCS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Rahul Santhanam, Ryan Williams 0001 On Uniformity and Circuit Lower Bounds. Search on Bibsonomy Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ryan Williams 0001 Nonuniform ACC Circuit Lower Bounds. Search on Bibsonomy J. ACM The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Cody Murray, Ryan Williams 0001 On the (Non) NP-Hardness of Computing Circuit Complexity. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2014 DBLP  BibTeX  RDF
1Ryan Williams 0001 New algorithms and lower bounds for circuits with linear threshold gates. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Ryan Williams 0001, Huacheng Yu Finding orthogonal vectors in discrete structures. Search on Bibsonomy SODA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Amir Abboud, Kevin Lewi, Ryan Williams 0001 Losing Weight by Gaining Edges. Search on Bibsonomy ESA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ryan Williams 0001 Faster all-pairs shortest paths via circuit complexity. Search on Bibsonomy STOC The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ryan Williams 0001 New algorithms and lower bounds for circuits with linear threshold gates. Search on Bibsonomy STOC The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ryan Williams 0001 Faster decision of first-order graph properties. Search on Bibsonomy CSL-LICS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ryan Williams 0001 Algorithms for Circuits and Circuits for Algorithms. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Thore Husfeldt, Ramamohan Paturi, Gregory B. Sorkin, Ryan Williams 0001 Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331). Search on Bibsonomy Dagstuhl Reports The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Richard J. Lipton, Ryan Williams 0001 Amplifying circuit lower bounds against polynomial time, with applications. Search on Bibsonomy Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Rahul Santhanam, Ryan Williams 0001 New Algorithms for QBF Satisfiability and Implications for Circuit Complexity. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2013 DBLP  BibTeX  RDF
1Amir Abboud, Kevin Lewi, Ryan Williams 0001 On the parameterized complexity of k-SUM. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Ryan Williams 0001 Faster all-pairs shortest paths via circuit complexity. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Ryan Williams 0001 Alternation-Trading Proofs, Linear Programming, and Lower Bounds. Search on Bibsonomy TOCT The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Ryan Williams 0001 Improving Exhaustive Search Implies Superpolynomial Lower Bounds. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Virginia Vassilevska Williams, Ryan Williams 0001 Finding, Minimizing, and Counting Weighted Subgraphs. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Brendan Juba, Ryan Williams 0001 Massive online teaching to bounded learners. Search on Bibsonomy ITCS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Ryan Williams 0001 Towards NEXP versus BPP? Search on Bibsonomy CSR The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Ryan Williams 0001 Natural proofs versus derandomization. Search on Bibsonomy STOC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Rahul Santhanam, Ryan Williams 0001 On Medium-Uniformity and Circuit Lower Bounds. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Ryan Williams 0001 Regularity Lemmas and Combinatorial Algorithms. Search on Bibsonomy Theory of Computing The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Rahul Santhanam, Ryan Williams 0001 Uniform Circuits, Lower Bounds, and QBF Algorithms. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Brendan Juba, Ryan Williams 0001 Massive Online Teaching to Bounded Learners. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Lane A. Hemaspaandra, Ryan Williams 0001 An Atypical Survey of Typical-Case Heuristic Algorithms Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Ryan Williams 0001 Natural Proofs Versus Derandomization Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Lane A. Hemaspaandra, Ryan Williams 0001 SIGACT News Complexity Theory Column 76: an atypical survey of typical-case heuristic algorithms. Search on Bibsonomy SIGACT News The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Benny Kimelfeld, Jan Vondrák, Ryan Williams 0001 Maximizing Conjunctive Views in Deletion Propagation. Search on Bibsonomy ACM Trans. Database Syst. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Samuel R. Buss, Ryan Williams 0001 Limits on Alternation-Trading Proofs for Time-Space Lower Bounds. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 155 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license