A New Data Structure for Cumulative Frequency Tables (1994)

Cached

Download Links

by Peter M. Fenwick
Venue:Software: Practice and Experience
Citations:14 - 1 self

Documents Related by Co-Citation

1137 A universal algorithm for sequential data compression – Jacob Ziv, Abraham Lempel - 1977
331 Data Compression Using Adaptive Coding and Partial String Matching – John G. Cleary, Ian, Ian H. Witten - 1984
99 Dynamic Huffman coding – D E Knuth - 1985
269 Introduction to Data Compression – K Sayood - 1996
662 Arithmetic coding for data compression – I H Witten, R M Neal, J G Cleary - 1987
8 New Lower Bound Techniques For Dynamic Partial Sums and Related Problems – Thore Husfeldt, Theis Rauhe - 2003
25 Succinct Dynamic Data Structures – Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
43 Complexity Models for Incremental Computation – Peter Bro Miltersen, Sairam Subramanian, Jeffrey Scott Vitter, Roberto Tamassia - 1994
41 The complexity of maintaining an array and computing its partial sums – M L Fredman - 1982
305 A Data Structure for Dynamic Trees – D D Sleator, R E Tarjan - 1983
36 Optimal algorithms for list indexing and subset rank – P F Dietz - 1989
16 Optimal Biweighted Binary Trees And The Complexity Of Maintaining Partial Sums – Haripriyan Hampapuram, Michael, Michael L. Fredman, Siam J. Comput C - 1998
43 Near-optimal fully-dynamic graph connectivity. Proc. 32nd Ann – M Thorup
29 Cell probe complexity - a survey – Peter Bro Miltersen
54 Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation – Monika Rauch Henzinger, Valerie King - 1999
125 Poly-logarithmic deterministic fully-dynamic graph algorithms I: connectivity and minimum spanning tree – Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup - 1997
128 The cell probe complexity of dynamic data structures – M L Fredman, M E Saks - 1989
55 Optimal Bounds for the Predecessor Problem and Related Problems – Paul Beame, Faith E. Fich - 2001
122 Variations on a theme by Huffman – R G Gallager