How to sum a large array of floats while keeping errors in check

This is a tale of two approaches to regular expression matching. One of them is in widespread use in the standard interpreters for many languages, including Perl. The other is used only in a few places, notably most implementations of awk and grep. The two approaches have wildly different performance characteristics

This implementation uses the algorithms outlined in the original paper on the R-Tree [Guttman 1984].

R-trees are tree data structures that are similar to B-trees, but are used for spatial access methods, i.e., for indexing multi-dimensional information

A space-efficient probabilistic data structure that is used to test whether an element is a member of a set.

MapReduce is a programming model and an associated implementation for processing and generating large data sets. Users specify a map function that processes a key/value pair to generate a set of intermediate key/value pairs, and a reduce function that merges all intermediate values associated with the same intermediate key. Many real world tasks are expressible in this model, as shown in the paper.

How to "do relatively obscure low-level things very efficiently". ie, bithacks! :D

Including Problems on Algorithms, Parallel Complexity Theory and Lecture Notes on Algorithm Analysis and Complexity Theory

Computing reciprocal square roots is necessary in many
applications, such as vector normalization in video games. Often,
some loss of precision is acceptable for a large increase in speed.
This note examines and improves a fast method found in source-
code for several online libraries, and provides the ideas to derive
similar methods for other functions

CORDIC (digit-by-digit method, Volder's algorithm) (for COordinate Rotation DIgital Computer) is a simple and efficient algorithm to calculate hyperbolic and trigonometric functions.

Really cool Java Applet depicting the working internals of many binary tree algorithms

The "evolution" of bit-twiddling: awesome book with tons of hackerish routines

SEPA: A Simple, Efficient Permutation Algorithm

Collection of hackish snippets of code dealing with bit operations

Designed by Bruce Schneier and John Kelsey - Result of several years' research - Renders information security systems far less vulnerable - Unpatented and royalty-free - No license required

Integer Hash Function

This paper explains the basic elements of an approach to physically-based modeling which is well suited for interactive use. It is simple, fast, and quite stable, and in its basic version the method does not require knowledge of advanced mathematical subj

Computer Programming Algorithms Directory

Designing and Building Parallel Programs, by Ian Foster

"In computer science, a Fibonacci heap is a data structure similar to a binomial heap but with a better amortized running time. A Fibonacci heap can be used to improve the asymptotic running time of Dijkstra's algorithm for computing shortest paths in a g

Interactive simulation of the inner workings of a Fibonacci Heap

"News, knowledge and discussion for the AI enthusiast."

This is a dictionary of algorithms, algorithmic techniques, data structures, archetypical problems, and related definitions. Algorithms include common functions, such as Ackermann's function. Problems include traveling salesman and Byzantine generals. Som

Visualizations of some comparison based sorting algorithms.

The 15 submissions to the AES challenge.

Google's all famous algorithm explained