gary hoppenworth
@garytho.bsky.social
Reposted by gary hoppenworth
The connection between distributed algorithms and descriptive set theory featured in Quanta:
www.quantamagazine.org/a-new-bridge...
www.quantamagazine.org/a-new-bridge...
A New Bridge Links the Strange Math of Infinity to Computer Science | Quanta Magazine
Descriptive set theorists study the niche mathematics of infinity. Now, they’ve shown that their problems can be rewritten in the concrete language of algorithms.
www.quantamagazine.org
November 22, 2025 at 8:54 PM
The connection between distributed algorithms and descriptive set theory featured in Quanta:
www.quantamagazine.org/a-new-bridge...
www.quantamagazine.org/a-new-bridge...
Reposted by gary hoppenworth
I used AI to create an easier-to-navigate schedule for SODA and SOSA 26 here:
soda26.netlify.app
The original one is hard to see the overview. meetings.siam.org/program.cfm?...
soda26.netlify.app
The original one is hard to see the overview. meetings.siam.org/program.cfm?...
SODA/SOSA 2026 Schedule
soda26.netlify.app
November 21, 2025 at 4:42 AM
I used AI to create an easier-to-navigate schedule for SODA and SOSA 26 here:
soda26.netlify.app
The original one is hard to see the overview. meetings.siam.org/program.cfm?...
soda26.netlify.app
The original one is hard to see the overview. meetings.siam.org/program.cfm?...
Reposted by gary hoppenworth
Kuowen Chen, Nicole Wein, Yiran Zhang: A Polynomial-Time Algorithm for the Next-to-Shortest Path Problem on Positively Weighted Directed Graphs https://arxiv.org/abs/2511.04345 https://arxiv.org/pdf/2511.04345 https://arxiv.org/html/2511.04345
November 7, 2025 at 6:31 AM
Kuowen Chen, Nicole Wein, Yiran Zhang: A Polynomial-Time Algorithm for the Next-to-Shortest Path Problem on Positively Weighted Directed Graphs https://arxiv.org/abs/2511.04345 https://arxiv.org/pdf/2511.04345 https://arxiv.org/html/2511.04345
Reposted by gary hoppenworth
📢 Our first TCS+ talk of the season will be Wednesday, Oct 8 (10amPT, 1pm ET, 19:00 CEST): Janani Sundaresan, from U Waterloo, will tell us how "Distributed Triangle Detection is Hard in Few Rounds"!
RSVP to receive the link (available one day prior to the talk): forms.gle/sHdV8uoKYVpq... #TCSSky
RSVP to receive the link (available one day prior to the talk): forms.gle/sHdV8uoKYVpq... #TCSSky
TCS+ RSVP: Janani Sundaresan (2025/10/08)
Title: Distributed Triangle Detection is Hard in Few Rounds
forms.gle
September 27, 2025 at 9:42 PM
📢 Our first TCS+ talk of the season will be Wednesday, Oct 8 (10amPT, 1pm ET, 19:00 CEST): Janani Sundaresan, from U Waterloo, will tell us how "Distributed Triangle Detection is Hard in Few Rounds"!
RSVP to receive the link (available one day prior to the talk): forms.gle/sHdV8uoKYVpq... #TCSSky
RSVP to receive the link (available one day prior to the talk): forms.gle/sHdV8uoKYVpq... #TCSSky
Reposted by gary hoppenworth
Some questions on spanners in my talk at the Simons Institute. Since the talk, progress has been made on a few questions, but most are open. minorfree.github.io/SpannerQues/
Some Questions on Spanners | Rambling on Graphs
minorfree.github.io
August 25, 2025 at 12:56 PM
Some questions on spanners in my talk at the Simons Institute. Since the talk, progress has been made on a few questions, but most are open. minorfree.github.io/SpannerQues/