An Operator Calculus Approach to the Evolution of Dynamic Data Structures
暂无分享,去创建一个
[1] Donald E. Knuth,et al. A Trivial Algorithm Whose Analysis Isn't , 1978, J. Comput. Syst. Sci..
[2] René Schott,et al. Analysis of Dynamic Algorithms in Knuth's Model , 1990, Theor. Comput. Sci..
[3] Guy Louchard,et al. Random Walks, Gaussian Processes and List Structures , 1987, Theor. Comput. Sci..
[4] Jean Françon,et al. Histoire de fichiers , 1978, RAIRO Theor. Informatics Appl..
[5] Jean Vuillemin,et al. Description and analysis of an efficient priority queue representation , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[6] Gary Don Knott,et al. Deletion in binary storage trees , 1975 .
[7] Guy Louchard,et al. Dynamic Algorithms in D.E. Knuth's Model: A Probabilistic Analysis , 1992, Theor. Comput. Sci..
[8] P. Feinsilver. Orthogonal Polynomials and Coherent States , 1991 .
[9] Robert S. Maier. A path integral approach to data structure evolution , 1991, J. Complex..
[10] Donald E. Knuth,et al. Deletions That Preserve Randomness , 1977, IEEE Transactions on Software Engineering.
[11] Philippe Flajolet,et al. Average-Case Analysis of Algorithms and Data Structures , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[12] Philippe Flajolet,et al. Analyse d'algorithmes de manipulation d'arbres et de fichiers , 1981 .