loguntsov

1. General Background and Overview

• Probabilistic Data Structures for Web Analytics and Data Mining : A great overview of the space of probabilistic data structures and how they are used in approximation algorithm implementation.
• Models and Issues in Data Stream Systems
• Philippe Flajolet’s contribution to streaming algorithms : A presentation by Jérémie Lumbroso that visits some of the hostorical perspectives and how it all began with Flajolet
• Approximate Frequency Counts over Data Streams by Gurmeet Singh Manku & Rajeev Motwani : One of the early papers on the subject.
• [Methods for Finding Frequent Items in Data Streams](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.187.9800&rep

loguntsov

Header 
"%%"
"%% @Author: Sergey Loguntsov <loguntsov@gmail.com>"
"%%"
"%%".

Nonterminals
    main_program exp_el
    expression
    func_call args

loguntsov

% Fuad Tabba (cs.auckland.ac.nz at fuad OR altabba.org at fuad)
% June, 2008
% Posted at http://www.altabba.org/2008/06/full-red-black-tree-implementation-in.html

% In case anyone might actually want to use this code, I've decided to make it
% public domain, unless there are portions of it that infringe on other people's
% copyrights, in that case those people's permissions must be sought.

% References:-
% http://semanticvector.blogspot.com/2008/05/red-black-tree-in-2-hours.html