<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2013-05-31 10:50:03Data management Approximate counting algorithm Linearizability Counter Non-blocking algorithm Compare-and-swap CPU cache Floating point Lock Concurrency control Computing Computer architecture |
Add to Reading List |
Scalable Statistics Counters Dave Dice Yossi Lev Mark Moir | c 2005 Cambridge University Press Combinatorics, Probability and Computing, 737–754. DOI: S0963548305007005 Printed in the United Kingdom Approximate Counting and Quantum ComputationDocID: 1oB0X - View Document |
 | PARISTIC NOV 2006 Quantitative Algorithmics of Massive Data SetsDocID: 18Mxc - View Document |
| Scalable Statistics Counters Dave Dice Yossi Lev Mark MoirDocID: 16BoW - View Document |
![Counting by Coin Tossings Philippe Flajolet Algorithms Project, INRIA-Rocquencourt, 78153 Le Chesnay (France) [removed] Abstract. This text is an informal review of several randomized algorithms that ha](https://www.pdfsearch.io/img/c7b52777a34ba62d5283317306bc4ca8.jpg "Counting by Coin Tossings Philippe Flajolet Algorithms Project, INRIA-Rocquencourt, 78153 Le Chesnay (France) [removed] Abstract. This text is an informal review of several randomized algorithms that ha") | Counting by Coin Tossings Philippe Flajolet Algorithms Project, INRIA-Rocquencourt, 78153 Le Chesnay (France) [removed] Abstract. This text is an informal review of several randomized algorithms that haDocID: 11d4P - View Document |
 | PDF DocumentDocID: Y8Z - View Document |