Ryan Williams @rrwilliams.bsky.social
@rrwilliams
Professor @MITEECS and @MIT_CSAIL. Computational complexity, algorithm design, and related math. I'll let you know when P != NP is proved (and when it's not)
A number of people (grad students in particular) said they enjoyed my talk at ICALP. So maybe you'll like it too. A little unusual, it's about how/why I ended up working on circuit complexity. youtube.com/live/0DrFB2Cp7… (Skipping the ceremonial stuff that happened before the talk)
CCC’25 will take place August 5-8 at the Fields Institute in Toronto! Students/postdocs (from any institution) are eligible to apply for a travel allowance. For full consideration, please apply by June 20; awards to be announced on June 25. computationalcomplexity.org/travelAllowanc…
What are you still doing on X/Twitter? Go see my Bluesky or Mastodon account for some cool complexity theory news bsky.app/profile/rrwill… mastodon.social/@rrwilliams/11…
Nima Anari, Kuikui Liu, Shayan Oveis Gharan, and Cynthia Vinzant to receive the 2025 Michael and Sheila Held Prize. nasonline.org/award/michael-…
735 submissions to STOC ... 👀 (The previous high was apparently 592, from last year) I'm on the STOC PC this year, so expect some complaints on this channel (and possibly review requests)
Many congratulations to @firebat03 (!!!)
Assistant Professor of @ColumbiaCompSci Josh Alman has received the 2024 Packard Fellowship for Science and Engineering, joining 20 early-career researchers selected this year. The five-year $875k grant will support his research in advancing algorithm speed and efficiency.…
Having a great time at FOCS 2024. blog.computationalcomplexity.org/2024/10/focs-2…
Yeah, @ASMSDragons is a good school :)
This is exactly the LinkedIn you'd expect from someone who discovered the world's largest prime number.
PSA i can spoof any mit.edu email and it will pass all DKIM/SPF/etc. checks. here's an email i sent to myself pretending to be a famous MIT-affiliated podcaster - thanks gmail for auto-inserting the profile pic :) MIT may fix this someday but in the meantime…
Sounds like a super exciting opportunity! MIT EECS was such an invigorating environment, and I miss my days there. I've heard the soft deadline is October 15 (two weeks from now), but applications after may be considered. Can't miss for anyone searching for teaching positions!
MIT EECS is hiring a theory lecturer! Apply here: faculty-searches.mit.edu/eecs_lect4/reg…
MIT EECS is hiring a theory lecturer! Apply here: faculty-searches.mit.edu/eecs_lect4/reg…
Binge watch lectures from Frontiers in Complexity Theory over the holiday weekend! Metacomplexity (Rahul Ilango), algebraic complexity (@nutanlimaye), derandomization (Roei Tell), ECC (Swastik Kopparty), C^3 LTC (@wjmzbmr1), and keynote by @rrwilliams!! youtube.com/playlist?list=…
Fond memories of attending @CornellMHockey "away" games at Lynah East versus @HarvardMHockey in Boston. Pic with college friends and fellow Cornell alum @rrwilliams
Want to attend #FOCS2024 in Chicago this year? Travel grants are available for US-based students and postdocs! Apply by ⏰ Sep 13: focs.computer.org/2024/travel-su… Members of underrepresented groups encouraged to apply. Don't self-censor: also, you don't need a paper to be eligible!
Videos from the DIMACS Tutorial on Fine-grained Complexity have dropped!! You can access the Playlist on YouTube or you can access it together with presentation slides on this webpage: dimacs.rutgers.edu/ws-materials/f… youtube.com/playlist?list=… @karthikcs_
Today at the Frontiers in Complexity Theory workshop, @nutanlimaye introduced students to hardness vs randomness in the algebraic setting and @rrwilliams described how the study of exact exponential-time algorithms led him to study circuit complexity lower bounds.
The first lectures of Frontiers in Complexity Theory: Rahul Ilango introducing metacomplexity and Swastik Kopparty beginning his discussion of the Berlekamp-Welch algorithm for decoding Reed-Solomon codes. Both such engaging and inspiring lecturers!