Ryan Williams. Professor of Electrical Engineering and Computer Science MIT CSAIL and EECS 32 Vassar St, Cambridge, MA 02139 . Email: first and middle initials + my last name at gmail.com I was a professor at Stanford from 2011-2016. I got a PhD from Carnegie Mellon under the marvelous Manuel Blum, and I was an undergrad at Cornell. For more ...

L. Chen, C. Jin, R. R. Williams, and H. Wu. Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions In 32nd ACM-SIAM Symposium on Discrete Algorithms (SODA 2022).

Richard Ryan Williams MIT CSAIL, 32 Vassar St., Cambridge, MA 02139 Email: [email protected] POSITIONS Massachusetts Institute of Technology (Cambridge, MA) Professor of Electrical Engineering and Computer Science, July 2020 – present. Associate Professor (with tenure) of EECS, Jan. 2017 – Jun. 2020. University of California, Berkeley

Instructor: Ryan Williams, Office 32-G638, Email rrw@mit Office Hours Wednesday 3-4pm, and by appointment. TAs: Ce Jin, Email cejin@mit, Office Hours Wednesday 10-12 24-319; Timothy Gomez, Email tagomez7@mit, Office Hours Friday 11am-1pm, 24-319; Zixuan Xu, Email zixuanxu@mit, Office Hours Monday 11am-1pm

R. Ryan Williams MIT CSAIL & EECS, Cambridge MA 02139, USA Abstract. The editors of this LNCS volume asked me to speculate on open problems: out of the prominent conjectures in computational com-plexity, which of them might be true, and why? I hope the reader is entertained. 1 Introduction

Ryan's notes for 11/5 (CircuitSAT implies Lower Bounds, Gap-CircuitSAT implies Lower Bounds) are here. Scribe notes by Sidhanth Mohanty are coming soon. Lecture on Friday 11/9 (Natural Proofs) notes are here .

Ryan Williams∗ Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213 Abstract We present a novel method for exactly solving (in fact, counting solutions to) general con-straint satisfaction optimization with at most two variables per constraint (e.g. MAX-2-CSP

R. Ryan Williams Abstract. We prove the first time-space tradeoffs for counting the number of solu-tions to an NP problem modulo small integers, and also improve upon known time-space tradeoffs for Sat. Let m > 0 be an integer, and de-fine MODm-Sat to be the problem of determining if a given Boolean

Finding Heaviest H-Subgraphs in Real Weighted Graphs, with Applications, V. Vassilevska, Ryan Williams, Raphael Yuster. ACM Transactions on Algorithms [ACM] [ps] [pdf]

Virginia Vassilevska Williamsy Ryan Williamsz Abstract We say an algorithm on n nmatrices with integer entries in [ M;M] (or n-node graphs with edge weights from [ M;M]) is truly subcubic if it runs in O(n3 poly(logM)) time for some > 0. We define a notion of subcubic reducibility, and show that many important problems on graphs and