Exact Distribution of Individual Displacements in Linear Probing Hashing

ACM Transactions on Algorithms

Volumn 1, Issue 2, 2005, Pages 214-242

  Viola, Alfredo ^a  

^a UNIVERSIDAD DE LA REPÚBLICA   (Uruguay)

Author keywords

Algorithms; Distributional analysis; Individual displacements; Linear probing; Performance; Theory

Indexed keywords

EID: 47249130992     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1103963.1103965     Document Type: Article

References (14)

1. Avanzi, R. M. 2005. The complexity of certain multi-exponentiation techniques in cryptography. J. Crypt. (http://dx.doi.org/10.1007/s00145-004-0229-5).
2. Gordon, D. M. 1998. A survey of fast exponentiation methods. J. Algorithms 27, 1, 129-146.
3. Grabner, P. J., Heuberger, C., and Prodinger, H. 2004. Distribution results for low-weight binary representations for pairs of integers. Theor. Comput. Sci. 319, 307-331.
4. Grabner, P. J., Heuberger, C., Prodinger, H., and Thuswaldner, J. 2003. Analysis of linear combination algorithms in cryptography-online resources, http://www.opt.math.tu-graz.ac.at/cheub/publications/ECLinComb/.
5. Graham, R. L., Knuth, D. E., and Patashnik, O. 1994. Concrete Mathematics. A Foundation for Computer Science, 2nd ed. Addison-Wesley, Reading, Mass.
6. Heuberger, C. 2004. Minimal expansions in redundant number systems: Fibonacci bases and greedy algorithms. Period. Math. Hangar. 49, 65-89.
7. Hwang, H.-K. 1998. On convergence rates in the central limit theorems for combinatorial structures. Europ. J. Combin. 19, 329-343.
8. Joye, M., and Yen, S.-M. 2000. Optimal left-to-right binary signed digit recoding. IEEE Trans. Comput. 49, 740-748.
9. Koblitz, N., Menezes, A., and Vanstone, S. 2000. The state of elliptic curve cryptography. Des. Codes Cryptogr 19, 173-193.
10. Morain, F., and Olivos, J. 1990. Speeding up the computations on an elliptic curve using addition-subtraction chains. RAIRO Inf. Theor. Appl. 24, 531-543.
11. Reitwiesner, G. W. 1960. Binary arithmetic. In Advances in Computers, Vol. 1. Academic Press, New York, pp. 231-308.
12. Solinas, J. A. 2001. Low-weight binary representations for pairs of integers. Tech. Rep. CORR 200141. Univ. Waterloo (available at http://www.cacr.math.uwaterloo.ca/techreports/2001/corr2001-41.ps).
13. Thuswaldner, J. M. 1999. Summatory functions of digital sums occurring in cryptography. Period. Math. Hangar. 38, 111-130.
14. Von Zur Gathen, J., and Gerhard, J. 1999. Modern Computer Algebra, Cambridge University Press, New York.