/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

 kevinventullo.com
Fast Exact Integer Roots - Kevin Ventullo
| | qchu.wordpress.com
The man who knew partition asymptotics | Annoying Precision
3.6 parsecs away

Travel
| | (Part I of this post ishere) Let $latex p(n)$ denote the partition function, which describes the number of ways to write $latex n$ as a sum of positive integers, ignoring order. In 1918 Hardy and Ramanujan proved that $latex p(n)$ is given asymptotically by $latex \displaystyle p(n) \approx \frac{1}{4n \sqrt{3}} \exp \left( \pi \sqrt{ \frac{2n}{3}...
| | www.bearssl.org
BearSSL - Big Integer Design
3.2 parsecs away

Travel
| |
| | cp-algorithms.com
Continued fractions - Algorithms for Competitive Programming
4.2 parsecs away

Travel
| | The goal of this project is to translate the wonderful resource http://e-maxx.ru/algo which provides descriptions of many algorithms and data structures especially popular in field of competitive programming. Moreover we want to improve the collected knowledge by extending the articles and adding new articles to the collection.
| | blog.lexfo.fr
Lexfo's security blog - CVE-2017-11176: A step-by-step Linux Kernel exploitation (part 1/4)
86.0 parsecs away

Travel
| The first article covers an in-depth CVE/bug analysis, designs an attack scenario and starts implementing a PoC in ring-0 with SystemTap. The core concept section focuses on file/socket related data structures, netlink and refcounters.