|
14
|
Resizable Arrays in Optimal Time and Space
– Andrej Brodnik, Svante Carlsson, Erik D. Demaine, J. Ian Munro, Robert Sedgewick
- 1999
|
|
7
|
Dynamic rank-select structures with applications to run-length encoded texts
– S Lee, K Park
- 2007
|
|
11
|
An estimate of the store size necessary for dynamic storage allocation
– J M Robson
- 1971
|
|
9
|
S.M.: Statistical properties of the buddy system
– P W P Jr, Stigler
- 1970
|
|
3
|
R.: An efficient quasidictionary
– T Hagerup, Raman
- 2002
|
|
2
|
Fast Allocation and Deallocation with an Improved Buddy System
– Gerth Stølting Brodal, Erik D. Demaine, J. Ian Munro
- 2003
|
|
1
|
Dynamic succinct ordered trees
– A Farzan, J I Munro
- 2009
|
|
1
|
G.: Operating System Concepts, 7e
– A Silberschatz, P B Galvin, Gagne
- 2004
|
|
11
|
Bounds for some function concerning dynamic storage allocation
– J M Robson
- 1974
|
|
7
|
Tight Bounds For Dynamic Storage Allocation
– MichaelG. Luby, JOSEPH (SEFFI) NAOR, ARIEL ORDA, Michael G. Luby
- 1994
|
|
14
|
Dynamic ordered sets with exponential search trees
– Arne Andersson, Mikkel Thorup
- 2002
|
|
557
|
Data Structures and Network Algorithms
– R E Tarjan
- 1983
|
|
66
|
The art of computer programming, Volume I: Fundamental Algorithms
– D E Knuth
- 1968
|
|
26
|
Succinct Dynamic Data Structures
– Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
|
|
20
|
Succinct dynamic dictionaries and trees
– R Raman, S S Rao
- 2003
|
|
14
|
Representing dynamic binary trees succinctly
– J I Munro, V Raman, A J Storm
- 2001
|
|
4
|
Introduction to Algorithms. McGraw Hill and The
– T Cormen, C Leiserson, R Rivest
- 1990
|
|
14
|
Private information storage with logarithmic-space secure hardware
– Alexander Iliev, Sean Smith
- 2004
|
|
4
|
Randomized Shellsort: A simple oblivious sorting algorithm
– Michael T. Goodrich
- 2010
|
