Measuring How Cost Scales by Counting Instead of Timing
Code: Megapixel99/countfn Every empirical complexity tool I could find on either registry measures elapsed time. PyPI's big-O estimates the class from execution time, and npm's b...
Search fresh public links, source activity, and ready-to-use post angles for Algorithmic Performance.
Fresh curated links around Algorithmic Performance are collected here so marketers can spot useful updates and turn timely ideas into posts faster.
Recent items include:
Recent curated links from global sources. Generate one free draft from any story, then use SocialBu to schedule and refine your content calendar.
Code: Megapixel99/countfn Every empirical complexity tool I could find on either registry measures elapsed time. PyPI's big-O estimates the class from execution time, and npm's b...
5 октября американские исследователи Вирджиния Василевска-Уильямс, известная своими быстрыми (и безумно сложными) алгоритмами перемножения матриц за вместо и её бывший аспирант Д...
Almost every slow Polars script lacks in terms of one of these two: its expression engine written and executing in Rust across every core at its disposal, and its query optimizer t...
Now that CPython 3.15 has been released, I decided to do a historical performance comparison similar in spirit to Sixteen Years of Python Performance. Obviously I wanted to include...
The Julia package ESRIcascade.jl reproduced established systemic-risk calculations while reducing runtime by as much as 300-fold in synthetic-network benchmarks.
One RTX 5090, 128 GB of RAM, and four open models from 125B to 748B parameters. Over the past weeks I got each of them running on the same workstation, on three different runtimes....
In a study focusing on hiring decisions, MIT researchers found the use of a single algorithm by many firms could benefit job seekers in certain situations.
Matthew Green has a new site that tries to estimate the number of cryptanalyst-hours that have been spent analyzing different public-key algorithms: Abstract: We estimate how much...
Bryan Shan / SemiAnalysis: Vera Rubin NVL72 inference tests show up to 7x better token throughput per MW vs. Blackwell on a 1.6T DeepSeek model, above Huang's 3x claim for 1T-3T LL...
The Fast Fourier Transform (FFT) algorithm can compute the discrete Fourier transform of a sequence of length n in time O(n log n). OpenAI recently posted a paper saying there is a...
This article walks through what each technique actually does, why skipping them costs real money and real latency, and then gets hands-on with five specific methods people are runn...
Use SocialBu to discover ideas, generate post drafts, and schedule them across your social channels.