My survey on the Complexity of the Shortest Vector Problem is now up and available at eccc.weizmann.ac.il/report/2022/17…! (Full version to appear in the SIGACT News Open Problems Column.) Comments and error reports (including typos) welcome!

This Thu, Dec 1 at 4:30pm EST we will have Ashrujit Ghoshal (homes.cs.washington.edu/~ashrujit/) speaking on "Time-Space tradeoffs for short collisions in Sponge and Merkle-Damgard hashing". Looking forward to seeing you there via Zoom or in person! More details at sites.google.com/view/crypto-se….

This Thur, Dec 8 at 4:30pm EST we will have Erica Blum (cs.umd.edu/~erblum/) speaking on "Ready for anything: designing consensus algorithms for variable networks". Looking forward to seeing you there via Zoom or in person! More details at sites.google.com/view/crypto-se….

And, on Friday, Dec 9 at 10:30am EST we will have Henry Corrigan-Gibbs (people.csail.mit.edu/henrycg/) speaking on "Simple and Fast Private Information Retrieval". Looking forward to seeing you there via Zoom or in person! More details at sites.google.com/view/crypto-se….

Hi, I'm sitting in a CMU School of Computer Science meeting, and the problem of women having no community is being discussed This is a Real Problem The one single thing that we have to help this is a weekly "empowering women" lunch BUT THE PROBLEM IS THAT THERE IS NOT FUNDING FOR THIS WTF

Congratulations to Gonçalo, senior researcher at Priberam, for winning the Vencer o Adamastor Prize by INESC and Público! Gonçalo was awarded for his work on sparsifying ML models used for machine translation and latent variable modelling. publico.pt/2022/12/18/cie…

Gonçalo Correia, a former IT Ph.D. student wins the 1st Edition of "Vencer o Adamastor" Award, with one research that aims to reduce the size of AI networks and their ecological footprint.🏆 #Award INESC-ID Instituto Superior Técnico #VencerAdamastor #AI More: it.pt/News/NewsPost/…

I've some exciting news! Like much of my recent work, also inspired by Uri Feige's conjectures. With Rares Buhai & David Steurer (during a beautiful Zurich summer), we found new algos for semirandom planted clique at thresholds approaching "usual" PC. arxiv.org/abs/2212.05619

Very sad to share a painful personal update. I cannot return to the US because my student visa renewal has been pending for close to 8 months now, despite having valid status and work authorization. Please retweet, to urge the U.S. Embassy Islamabad to process my case 1/3

Videos from the Tel Aviv University theory fest are all online youtube.com/playlist?list=…! Includes another version of my talk on the Kikuchi matrix method, this time long enough to also include a discussion of CSP refutation and Locally Decodable Codes: youtube.com/watch?v=NFbQES…

Very excited to have alexー as a colleague at Faculdade de Ciências e Tecnologia | NOVA FCT!

(1/2) Sruthi Sekar received an ACM India Doctoral Dissertation Honorable Mention for her dissertation titled “Near-Optimal Non-Malleable Codes and Leakage Resilient Secret Sharing Schemes”.

After 3 years of work, I wanted to share the personal story behind my latest paper, going from a random problem I got from a Facebook group all the way to getting congratulated by my absolute hero Donald Knuth. :) feedback and comments are welcome! bsubercaseaux.github.io/blog/2023/pack…

Delighted to see many familiar names on the #SloanFellow list: Rashmi Vinayak and Yuanzhi Li at CMU School of Computer Science, and CS theory colleagues Sepehr Assadi, @Eshan_chattopad, Sushant Sachdeva, and Xiaodi Wu. Congratulations all!

Really excited to share here our survey on Unconditional Pseudorandom Generators, a joint work with William Hoza. Link to ECCC: eccc.weizmann.ac.il/report/2023/01…

And in English, for my scientific feed: Some of you know Prof. Amit Daniely—an expert on the foundations of ML from the Hebrew University. Yesterday he was arrested in a protest for allegedly assaulting an officer. Watch the video of his arrest and judge for yourselves.

Exciting breakthrough by Xin Li on the entropy requirement for many deterministic extractors! :)

Congrats to the three Guggenheim Fellows in Computer science: Prof. Anima Anandkumar, Venkat Guruswami, and Ronitt Rubinfeld! All very well deserved.

Huck is awesome :)

Excited about this work w. Peter Manohar who's on job market & you should hire him. :) the short: Kikuchi matrix method + "long chain derivations" (XOR resolution for proof complexity afficionados) = exp LBs for 3-query locally correctable codes.