Content deleted Content added
→Sublinear data structures: count-min-sketch approximate medians |
→References: the ref |
||
Line 132:
<ref name=clrs>{{Introduction to Algorithms|edition=3|chapter=Chapter 9: Medians and order statistics|pages=213–227}}; "Section 14.1: Dynamic order statistics", pp. 339–345</ref>
<ref name=cormut>{{citation
| last1 = Cormode | first1 = Graham
| last2 = Muthukrishnan | first2 = S. | author2-link = S. Muthukrishnan (computer scientist)
| doi = 10.1016/j.jalgor.2003.12.001
| issue = 1
| journal = Journal of Algorithms
| mr = 2132028
| pages = 58–75
| title = An improved data stream summary: the count-min sketch and its applications
| volume = 55
| year = 2005}}</ref>
<ref name=cunmun>{{cite journal
|