Tootfinder

Q&A with Asana co-founder Dustin Moskovitz on Facebook, starting Asana, SaaS companies, enterprise AI, the "empty seat problem", AI modesty, AI safety, and more (Ben Thompson/Stratechery)
https://stratechery.com/2025/an-interv

An Interview with Asana Founder Dustin Moskovitz about AI, SaaS, and Safety
An interview with Asana founder and Chariman Dustin Moskovitz about Asana, AI’s impact on SaaS, and the debate about AI Safety

The Fate of Travis Kelce? Chiefs TE to wait on '26 https://www.espn.com/nfl/story/_/id/47050784/travis-kelce-not-deciding-chiefs-return-season

from my link log —
Fast calculation of the distance to cubic Bezier curves on the GPU.
https://blog.pkh.me/p/46-fast-calculation-of-the-distance-to-cubic-bezier-curves-on-the-gpu.html
saved 2025-10-18

Fast calculation of the distance to cubic Bezier curves on the GPU

RE: https://infosec.exchange/@dustinfinn/115242724607344546
So @… is talking at @…

🇺🇦 #NowPlaying on KEXP's #MorningShow
Kitchens of Distinction:
🎵 Drive That Fast
#KitchensofDistinction
https://kitchens-of-distinction.bandcamp.com/track/drive-that-fast
https://open.spotify.com/track/1zLP0BzKDOeQ26AtQ6UBjm

Matching Algorithm with Recursively Implemented StorAge (MARISA) is a space-efficient, fairly fast, and static trie data structure. MARISA serves as a dictionary structure, and by definition, it supports exact match lookup, which is the basic operation of dictionary. In addition, MARISA supports reverse lookup, common prefix search, and predictive search.
Thanks to @…

Todays #EngelskeGloser is a thought: The Norwegian Language would be severely threatened if a government University did not get paid to maintain it [2] , and a gift link to the Atlantic [1]
[1]

‘Het boerenbedrijf heeft geen grondrecht om de leefomgeving ongezond te maken’ | Opinie | De Stentor.nl
https://www.destentor.nl/opinie/het-boerenbedrijf-heeft-geen-grondrecht-om-de-leefomgeving-ongezond-te-maken~a2c4b277…

Efficient Heuristic Algorithms for Interleaving Distance between Merge Trees
Elena Farahbakhsh Touli, Talha Bin Masood
https://arxiv.org/abs/2509.15687 https://

Efficient Heuristic Algorithms for Interleaving Distance between Merge Trees
Merge trees are fundamental structures in topological data analysis. Interleaving distance is a widely accepted metric for comparing merge trees, with applications in visualization and scientific computing. While a greedy algorithm exists for finding the interleaving distance between labeled merge trees with overlapping labels, computing the interleaving distance between unlabeled trees or labeled trees with disjoint labels remains a significant challenge. In this work, we introduce a novel h…

The NFL's long-distance kicking revolution: '70 will be the new 60' https://www.nytimes.com/athletic/6814741/2025/11/19/nfl-kicking-distance-yards-field-goals/