We looked inside some of the tweets by @wjmzbmr1 and here's what we found interesting.
Inside 100 Tweets
TR20-148 | Simple and fast derandomization from very hard functions: Eliminating randomness at almost no cost | Roei Tell, Lijie Chen https://t.co/NYqVnXOTtE
How fast can you derandomize a T(n)-time algorithm? In this work, Roei and I show that under some plausible conjectures, one can achieve an (n T(n))-time derandomization, and this is optimal assuming the Nondeterministic Strong Exponential-Time Hypothesis (NSETH). https://t.co/omdJ50HFGs
On Distributed Differential Privacy and Counting Distinct Elements https://t.co/oiCTAjRosI
An interesting work I did with my amazing coauthors (Badih, Ravi, and Pasin) on the (non-interactive) local and shuffle model of DP! TL;DR: CountDisticnt is extremely hard for local and 1-message shuffle DP, but surprisingly easy for shuffle DP with 1/2+o(1) expected messages. https://t.co/RDGXFkrNrB
The Limits of Pan Privacy and Shuffle Privacy for Learning and Estimation https://t.co/N4eUUug4s7
Very impressive! Resolved the multi-message shuffle complexity of selection/parity-learning without any restriction on the number of messages! (previously even the two-message case is open) https://t.co/oY0mNP1RRC
TR20-126 | Indistinguishability Obfuscation from Well-Founded Assumptions | Aayush Jain, Huijia Lin, Amit Sahai https://t.co/QZ3CRl7S8u
Found some very nice online lecture notes about proving information-theoretical lower bounds🥳https://t.co/lbFJKekN5Q
My CS Theory Toolkit course is finished. You can find the complete playlist of 99 videos here: https://t.co/70rqafhX9t
Cool result! If there is a univariate degree-d f s.t. any representation f = sum c_i (f_i)^2 requires ≥d^0.5001 monomials, then the algebraic version of P≠NP holds. Proof builds on classic https://t.co/LkW4jQtFCa https://t.co/7wnMlW37bw
A video of the STOC workshop on "MCSP and Hardness Magnification" can be found below. Many thanks to the speakers, as well as Josh and Marco for organizing! https://t.co/wkosCw9SUk
In the summer there will be an online complexity seminar hosted via zoom! https://t.co/ib5D7I59U2 The first talk (6/18 noon EST) is by Rahul Ilango about recent results on depth-d Boolean formulas obtained by a form of lifting and applications to MCSP and lower bounds.
If this conference version is too short for you, there is another 1-hour long talk for the same paper in IAS :) https://t.co/XoH31ZzJmp