When she’s bored, Maeve O’Connor will scroll through Bumble or Hinge, sometimes with the intention of going on a date. Sometimes, just window shopping. But because “nobody actually likes Hinge,” she ...

Principal Software Engineer, specializing in petabyte-scale data platforms, ML, and entity resolution systems. And that is usually where the trouble starts. Union-Find is elegant. It is fast. It is ...

After 30 months of fast-paced innovation in quantum algorithms, six research groups are hoping to hit paydirt. But there can be only one big winner—if there is a winner at all. I’m standing in front ...

Rep. Al Green, D-Texas, was escorted from the chamber after protesting Trump’s address and holding up a sign during the speech. Trump greeted four Supreme Court justices at his address, including ...

What would you like to Propose? I propose adding a clean and optimized implementation of Kruskal’s Minimum Spanning Tree (MST) algorithm using Union–Find (Disjoint Set Union - DSU) data structure to ...

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. All of modern mathematics is built on ...

The original version of this story appeared in Quanta Magazine. If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle ...

If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle the easiest pieces first. But this kind of sorting has a cost.