Twitter Beğeni Hilesi

The ACM-SIAM Symposium on Discrete Algorithms (SODA 2025) submission server is now accepting submissions: soda25.hotcrp.com Submission deadline: Friday Jul 5, 2024

I found this recording of a research meeting between James Maynard and his postdoc, Lasse Grimmelt, fascinating. We typically learn to advise through our own experiences as students/postdocs; it's nice to get a glimpse of how the process works for others. youtube.com/watch?v=MAEBiA…

STOC 2024 talk videos are now online: youtube.com/playlist?list=… If you'd like to dip in, a nice one to start with is "Tree Evaluation is in Space O(log n log log n)" by James Cook & Ian Mertz (presented by Ian): youtube.com/watch?v=pWT4kr…

Venkatesan Guruswami gave a stellar talk at Cambridge Computer Science about when and why efficient algorithms exist (for CSP and beyond) via the perspective of symmetry. It was quite inspiring. The talk wasn't recorded, but I found a similar version online: youtube.com/watch?v=wYOsUx…

I was asked by the organisers of STOC to share that Avi Wigderson is giving his Turing Lecture today (Thursday, June 27) at 6:00pm PT. Exciting! The link to livestreaming can be found here: acm.org/media-center/2…

A fantastic result using a general framework powered by the Kikuchi method!

Oded Goldreich posted an alternative exposition of the beautiful Cook-Mertz (Ian Mertz) Tree Evaluation in Space O(logn*loglogn) result, with an insightful digest and an improvement. All in less than 8 self-contained pages. An interesting read! eccc.weizmann.ac.il/report/2024/10…

I thoroughly enjoyed Chinmay Nirkhe's talk about making the leap to quantum PCPs. It gives a good survey of where things stand, an overview of the proof of the NLTS conjecture, and an appealing path towards making process on this hard open problem. youtube.com/watch?v=nt0VEh…

Doing TCS at Warwick is *amazing*.

Mor Harchol-Balter's excellent book Introduction to Probability for Computing is out and available online for free here: cs.cmu.edu/~harchol/Proba…

Greg Valiant's talk, Matrix Multiplication in Quadratic Time and Energy, provides a fascinating proof-of-concept of leveraging classical physics to create a more efficient computing paradigm. It also includes a real-world demonstration! youtube.com/watch?v=BHTFxY…

We're excited to announce a workshop on Algorithms & Complexity at Warwick on September 23-24. The event features an incredible lineup of speakers, with more to be confirmed soon. We hope to see many of you there! sites.google.com/view/algorithm…

Binge watch lectures from Frontiers in Complexity Theory over the holiday weekend! Metacomplexity (Rahul Ilango), algebraic complexity (Nutan Limaye), derandomization (Roei Tell), ECC (Swastik Kopparty), C^3 LTC (Lijie Chen), and keynote by Ryan Williams @[email protected]!! youtube.com/playlist?list=…

A fabulous result by Max Hopkins, extending Bourgain’s symmetrisation theorem to high dimensional expanders, yielding optimal global hypercontractivity for partite HDX. This resolves the main open problem in my paper with Lifshitz&Liu. Congrats Max! arxiv.org/pdf/2408.16687…

I’m grateful to the ERC for their support and excited to pursue this project! Special thanks to my students, postdocs, and colleagues Cambridge University; it would have never happened without you. I’ll be hiring postdocs and PhD students. Strong candidates are welcome to email me.

Greg wrote an excellent, detailed summary. In one sentence, we show an inherent limitation of property testing of quantum channels (which capture general quantum dynamics) and then bypass it by considering testing with respect to an average-case analogue of the diamond norm.

Perhaps the best introduction to quantum computing out there. Can’t recommend it enough!