#stoc2024 — Public Fediverse posts
Live and recent posts from across the Fediverse tagged #stoc2024, aggregated by home.social.
-
the videos for stoc are out. i heartily recommend checking out ian's talk:
https://www.youtube.com/watch?v=pWT4krti5bMthe two of us work in different subfields of cs theory but we spent a long time chatting about ways to make paper talk videos more engaging. i made an attempt at this with my own video last year, but ian takes it to an enviable new level. absolutely knocked it out of the park
-
the videos for stoc are out. i heartily recommend checking out ian's talk:
https://www.youtube.com/watch?v=pWT4krti5bMthe two of us work in different subfields of cs theory but we spent a long time chatting about ways to make paper talk videos more engaging. i made an attempt at this with my own video last year, but ian takes it to an enviable new level. absolutely knocked it out of the park
-
#STOC2024 recorded talks are online. My coauthor Ian Mertz did a bang-up job on our surprisingly low-space algorithm for the Tree Evaluation Problem: https://m.youtube.com/watch?v=pWT4krti5bM
The full list: https://m.youtube.com/playlist?list=PL2200vk1q4pnoZJZphNyvIFzB3UnUZEmj
-
Day 1 of #STOC2024: an excellent talk by my recently deceased PhD advisor, Luca Trevisan, about spectral graph theory and his own experiences of being an outsider in three different ways: joining the field of theoretical CS from outside the normal pipeline, being gay, and most recently having a visible illness. Pravesh Kothari and Salil Vadhan did an amazing job presenting his final talk.
-
I'm settled in to my ho(s)tel room for the week for #STOC2024. I just wish I could get both screens into a reasonable position at eye level. With pillows on the chair, the monitor on the shelf is about right.
(I'm staying in a dorm room at the University of British Columbia marketed as a hostel for visitors over the summer. Much cheaper than a normal hotel. I was a bit worried, but so far I love the room.)
-
I'm proud to say "Tree Evaluation is in Space O(log n · log log n)", my paper with Ian Mertz, was accepted to #STOC2024.
Tree Evaluation [0] was supposed to require way more than O(log n) space. The problem was designed specifically in the hope that someone could prove that's the case, thus proving L ≠ P, i.e. that there are problems that can be solved in polynomial time but not with O(log n) space.
[0] https://arxiv.org/abs/1005.2642
(1/4)