二分搜尋演算法 (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "二分搜尋演算法" in Chinese language version.

refsWebsite

Global rank Chinese rank

8doi.org

2^nd place

23^rd place

7web.archive.org

1^st place

4princeton.edu

741^st place

907^th place

1archive.org

6^th place

4^th place

1oeis.org

742^nd place

1,026^th place

1worldcat.org

5^th place

12^th place

1acm.org

1,185^th place

809^th place

1psu.edu

207^th place

628^th place

1googleresearch.blogspot.com

low place

acm.org

dl.acm.org

Chazelle, Bernard; Liu, Ding. Lower bounds for intersection searching and fractional cascading in higher dimension. 33rd ACM Symposium on Theory of Computing. ACM: 322–329. 2001-07-06 [2018-06-30]. ISBN 978-1-58113-349-3. doi:10.1145/380752.380818. （原始内容存档于2018-10-29）. 存档副本. [2019-10-06]. 原始内容存档于2018-10-29.

archive.org

Peterson, William Wesley. Addressing for random-access storage. IBM Journal of Research and Development. 1957, 1 (2): 130–146. doi:10.1147/rd.12.0130.

doi.org

dx.doi.org

Willams, Jr., Louis F. A modification to the half-interval search (binary search) method. Proceedings of the 14th ACM Southeast Conference: 95–101. 1975. doi:10.1145/503561.503582.
Peterson, William Wesley. Addressing for random-access storage. IBM Journal of Research and Development. 1957, 1 (2): 130–146. doi:10.1147/rd.12.0130.
Lehmer, Derrick. Teaching combinatorial tricks to a computer. Proceedings of Symposia in Applied Mathematics. 1960, 10: 180–181. doi:10.1090/psapm/010.
Bottenbruch, Hermann. Structure and use of ALGOL 60. Journal of the ACM. 1962-04-01, 9 (2): 161–221. ISSN 0004-5411. doi:10.1145/321119.321120. Procedure is described at p. 214 (§43), titled "Program for Binary Search".
Chazelle, Bernard; Liu, Ding. Lower bounds for intersection searching and fractional cascading in higher dimension. 33rd ACM Symposium on Theory of Computing. ACM: 322–329. 2001-07-06 [2018-06-30]. ISBN 978-1-58113-349-3. doi:10.1145/380752.380818. （原始内容存档于2018-10-29）. 存档副本. [2019-10-06]. 原始内容存档于2018-10-29.
Chazelle, Bernard; Guibas, Leonidas J. Fractional cascading: I. A data structuring technique (PDF). Algorithmica. 1986, 1 (1-4): 133–162 [2019-10-06]. CiteSeerX 10.1.1.117.8349 . doi:10.1007/BF01840440. （原始内容存档 (PDF)于2016-03-03）. （页面存档备份，存于互联网档案馆）
Chazelle, Bernard; Guibas, Leonidas J., Fractional cascading: II. Applications (PDF), Algorithmica, 1986, 1 (1-4): 163–191 [2019-10-06], doi:10.1007/BF01840441, （原始内容存档 (PDF)于2016-03-04）
Pattis, Richard E. Textbook errors in binary searching. SIGCSE Bulletin. 1988, 20: 190–194. doi:10.1145/52965.53012.

googleresearch.blogspot.com

Bloch, Joshua. Extra, extra – read all about it: nearly all binary searches and mergesorts are broken. Google Research Blog. 2006-06-02 [2016-04-21]. （原始内容存档于2016-04-01）. （页面存档备份，存于互联网档案馆）

oeis.org

"2ⁿ−1". OEIS A000225 （页面存档备份，存于互联网档案馆）. Retrieved 7 May 2016.

princeton.edu

algs4.cs.princeton.edu

Sedgewick & Wayne 2011，§3.1, subsection "Rank and selection". Sedgewick, Robert; Wayne, Kevin. Algorithms 4th. Upper Saddle River, New Jersey: Addison-Wesley Professional. 2011 [2019-05-15]. ISBN 978-0-321-57351-3. （原始内容存档于2014-07-15）. Condensed web version: ; book version .
Sedgewick & Wayne 2011，§3.1, subsection "Range queries". Sedgewick, Robert; Wayne, Kevin. Algorithms 4th. Upper Saddle River, New Jersey: Addison-Wesley Professional. 2011 [2019-05-15]. ISBN 978-0-321-57351-3. （原始内容存档于2014-07-15）. Condensed web version: ; book version .

cs.princeton.edu

Chazelle, Bernard; Guibas, Leonidas J. Fractional cascading: I. A data structuring technique (PDF). Algorithmica. 1986, 1 (1-4): 133–162 [2019-10-06]. CiteSeerX 10.1.1.117.8349 . doi:10.1007/BF01840440. （原始内容存档 (PDF)于2016-03-03）. （页面存档备份，存于互联网档案馆）
Chazelle, Bernard; Guibas, Leonidas J., Fractional cascading: II. Applications (PDF), Algorithmica, 1986, 1 (1-4): 163–191 [2019-10-06], doi:10.1007/BF01840441, （原始内容存档 (PDF)于2016-03-04）

psu.edu

citeseerx.ist.psu.edu

Chazelle, Bernard; Guibas, Leonidas J. Fractional cascading: I. A data structuring technique (PDF). Algorithmica. 1986, 1 (1-4): 133–162 [2019-10-06]. CiteSeerX 10.1.1.117.8349 . doi:10.1007/BF01840440. （原始内容存档 (PDF)于2016-03-03）. （页面存档备份，存于互联网档案馆）

web.archive.org

Sedgewick & Wayne 2011，§3.1, subsection "Rank and selection". Sedgewick, Robert; Wayne, Kevin. Algorithms 4th. Upper Saddle River, New Jersey: Addison-Wesley Professional. 2011 [2019-05-15]. ISBN 978-0-321-57351-3. （原始内容存档于2014-07-15）. Condensed web version: ; book version .
Sedgewick & Wayne 2011，§3.1, subsection "Range queries". Sedgewick, Robert; Wayne, Kevin. Algorithms 4th. Upper Saddle River, New Jersey: Addison-Wesley Professional. 2011 [2019-05-15]. ISBN 978-0-321-57351-3. （原始内容存档于2014-07-15）. Condensed web version: ; book version .
"2ⁿ−1". OEIS A000225 （页面存档备份，存于互联网档案馆）. Retrieved 7 May 2016.
Chazelle, Bernard; Liu, Ding. Lower bounds for intersection searching and fractional cascading in higher dimension. 33rd ACM Symposium on Theory of Computing. ACM: 322–329. 2001-07-06 [2018-06-30]. ISBN 978-1-58113-349-3. doi:10.1145/380752.380818. （原始内容存档于2018-10-29）. 存档副本. [2019-10-06]. 原始内容存档于2018-10-29.
Chazelle, Bernard; Guibas, Leonidas J. Fractional cascading: I. A data structuring technique (PDF). Algorithmica. 1986, 1 (1-4): 133–162 [2019-10-06]. CiteSeerX 10.1.1.117.8349 . doi:10.1007/BF01840440. （原始内容存档 (PDF)于2016-03-03）. （页面存档备份，存于互联网档案馆）
Chazelle, Bernard; Guibas, Leonidas J., Fractional cascading: II. Applications (PDF), Algorithmica, 1986, 1 (1-4): 163–191 [2019-10-06], doi:10.1007/BF01840441, （原始内容存档 (PDF)于2016-03-04）
Bloch, Joshua. Extra, extra – read all about it: nearly all binary searches and mergesorts are broken. Google Research Blog. 2006-06-02 [2016-04-21]. （原始内容存档于2016-04-01）. （页面存档备份，存于互联网档案馆）

worldcat.org

Bottenbruch, Hermann. Structure and use of ALGOL 60. Journal of the ACM. 1962-04-01, 9 (2): 161–221. ISSN 0004-5411. doi:10.1145/321119.321120. Procedure is described at p. 214 (§43), titled "Program for Binary Search".