×

zbMATH — the first resource for mathematics

A principle of independence for binary tree searching. (English) Zbl 0321.68030

MSC:
68W99 Algorithms in computer science
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Arora, S., Dent, W.: Randomized binary search technique. Comm. ACM 12, 77-80 (1969) · Zbl 0167.45901
[2] Feller, W.: An introduction to probability theory and its applications, Vol. 1. New York-London: John Wiley 1968 · Zbl 0155.23101
[3] Knuth, D. E.: The art of computer programming, Vol. 1: Fundamental algorithms. Reading (Mass.): Addison-Wesley 1973, p. 75 · Zbl 0191.17903
[4] Knuth, D. E.: The art of computer programming, Vol. 1: Fundamental algorithms. Reading (Mass.): Addison-Wesley 1973, p. 176 · Zbl 0191.17903
[5] Knuth, D. E.: The art of computer programming, Vol. 3, sorting and searching. Reading (Mass.): Addison-Wesley 1973, p. 424 · Zbl 0191.17903
[6] Knuth, D. E.: The art of computer programming, Vol. 3, sorting and searching, Reading (Mass.): Addison-Wesley 1973, Exercise 6.2.2-7 · Zbl 0191.17903
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.