Author:
Flajolet Philippe,Steyaert Jean-Marc
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Cantor D.G. and Zassenhaus H.: “On Algorithms for Factoring Polynomials over Finite Fields”, Math. of Comp. 36 (1981)pp 587–592
2. De Bruijn N.G.: Asymptotic Methods in Analysis, North-Holland P.C., Amsterdam (1961)
3. David F.N. and Barton D.E., Combinatorial Chance, Charles Griffin, London (1962).
4. Fagin R., Nievergelt J., Pippenger N. and Strong H.R., “Extendible Hashing — A Fast Access Method for Dynamic Files”, ACM Trans. on Database System, 4 (1979) pp. 315–344.
5. Flajolet P. and Odlyzko A.: “The Average Height of Binary Trees and Other Simple Trees”, JCSS to appear
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Univariate polynomial factorization over finite fields with large extension degree;Applicable Algebra in Engineering, Communication and Computing;2022-01-03
2. Arbres digitaux;Arbres pour l’Algorithmique;2018
3. Randomized Root Finding over Finite FFT-fields using Tangent Graeffe Transforms;Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation;2015-06-24
4. On the Smoothed Heights of Trie and Patricia Index Trees;Lecture Notes in Computer Science;2014
5. An Analysis of the Height of Tries with Random Weights on the Edges;Combinatorics, Probability and Computing;2008-03