二分搜尋 (Chinese Wikipedia)

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

refsWebsite

Global rank Chinese rank

27doi.org

2^nd place

23^rd place

17web.archive.org

1^st place

16wikipedia.org

low place

10semanticscholar.org

11^th place

332^nd place

8princeton.edu

741^st place

907^th place

5arxiv.org

69^th place

254^th place

4ghostarchive.org

32^nd place

657^th place

4psu.edu

207^th place

628^th place

3cnki.net

3,420^th place

133^rd place

3worldcat.org

5^th place

12^th place

2oracle.com

1,514^th place

1,383^rd place

2apple.com

67^th place

154^th place

1edb.gov.hk

low place

757^th place

1fcu.edu.tw

low place

2,252^nd place

1wolfram.com

513^th place

358^th place

1cglab.ca

low place

1sourceforge.net

1,669^th place

1,456^th place

1acm.org

1,185^th place

809^th place

1mit.edu

415^th place

500^th place

1ams.org

451^st place

935^th place

1harvard.edu

18^th place

57^th place

1oeis.org

742^nd place

1,026^th place

1googleresearch.blogspot.com

low place

1unipi.it

low place

1opengroup.org

3,671^st place

3,893^rd place

1dlang.org

low place

1golang.org

8,118^th place

8,002^nd place

1microsoft.com

153^rd place

238^th place

1python.org

2,232^nd place

1,779^th place

1rust-lang.org

low place

8,973^rd 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（英语：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）（英语）.

ams.org

Rényi, Alfréd. On a problem in information theory. Magyar Tudományos Akadémia Matematikai Kutató Intézetének Közleményei. 1961, 6: 505–516. MR 0143666 （匈牙利语）.

apple.com

developer.apple.com

NSArray. Mac Developer Library. Apple Inc. [2016-05-01]. （原始内容存档于2016-04-17）（英语）.
CFArray. Mac Developer Library. Apple Inc. [2016-05-01]. （原始内容存档于2016-04-20）（英语）.

arxiv.org

Khuong, Paul-Virak; Morin, Pat. Array Layouts for Comparison-Based Searching. Journal of Experimental Algorithmics. 2017, 22. Article 1.3. S2CID 23752485. arXiv:1509.05053 . doi:10.1145/3053370 （英语）.
Emamjomeh-Zadeh, Ehsan; Kempe, David; Singhal, Vikrant. Deterministic and probabilistic binary search in graphs. 48th ACM Symposium on Theory of Computing（英语：Symposium on Theory of Computing）: 519–532. 2016. arXiv:1503.00805 . doi:10.1145/2897518.2897656 （英语）.
Høyer, Peter; Neerbek, Jan; Shi, Yaoyun. Quantum complexities of ordered searching, sorting, and element distinctness. Algorithmica（英语：Algorithmica）. 2002, 34 (4): 429–448. S2CID 13717616. arXiv:quant-ph/0102078 . doi:10.1007/s00453-002-0976-3 （英语）.
Childs, Andrew M.; Landahl, Andrew J.; Parrilo, Pablo A. Quantum algorithms for the ordered search problem via semidefinite programming. Physical Review A. 2007, 75 (3). 032335. Bibcode:2007PhRvA..75c2335C. S2CID 41539957. arXiv:quant-ph/0608161 . doi:10.1103/PhysRevA.75.032335 （英语）.
Grover, Lov K. A fast quantum mechanical algorithm for database search. 28th ACM Symposium on Theory of Computing（英语：Symposium on Theory of Computing）. Philadelphia, PA: 212–219. 1996. arXiv:quant-ph/9605043 . doi:10.1145/237814.237866 （英语）.

cglab.ca

Morin, Pat. Hash tables (PDF): 1. [2016-03-28]. （原始内容存档 (PDF)于2022-10-09）（英语）.

cnki.net

kns.cnki.net

韦纯福. 基于分治思想的二分搜索技术研究. 大众科技. 2008, (3): 58-59. CNKI DZJI200803022 （中文（中国大陆））.
骆剑锋. 哈希表与一般查找方法的比较及冲突的解决. 十堰职业技术学院学报. 2007, (5): 96-98. CNKI SYZJ200705034 （中文（中国大陆））.
王晓东. 一种在TQuery记录集中实现快速搜索的方法. 管理信息系统. 2000, (3): 56-57. CNKI JYXX200003023 （中文（中国大陆））.

dlang.org

std.range - D Programming Language. dlang.org. [2020-04-29]. （原始内容存档于2018-11-27）（英语）.

doi.org

Williams, Jr., Louis F. A modification to the half-interval search (binary search) method. Proceedings of the 14th ACM Southeast Conference. ACM: 95–101. 1976-04-22. doi:10.1145/503561.503582  （英语）.
Flores, Ivan; Madpis, George. Average binary search length for dense ordered lists. Communications of the ACM. 1971-09-01, 14 (9): 602–603. ISSN 0001-0782. S2CID 43325465. doi:10.1145/362663.362752  （英语）.
Bottenbruch, Hermann. Structure and use of ALGOL 60. Journal of the ACM. 1962-04-01, 9 (2): 161–221. ISSN 0004-5411. S2CID 13406983. doi:10.1145/321119.321120  （英语）. Procedure is described at p. 214 (§43), titled "Program for Binary Search".
Rolfe, Timothy J. Analytic derivation of comparisons in binary search. ACM SIGNUM Newsletter. 1997, 32 (4): 15–19. S2CID 23752485. doi:10.1145/289251.289255  （英语）.
Khuong, Paul-Virak; Morin, Pat. Array Layouts for Comparison-Based Searching. Journal of Experimental Algorithmics. 2017, 22. Article 1.3. S2CID 23752485. arXiv:1509.05053 . doi:10.1145/3053370 （英语）.
Beame, Paul; Fich, Faith E. Optimal bounds for the predecessor problem and related problems. Journal of Computer and System Sciences（英语：Journal of Computer and System Sciences）. 2001, 65 (1): 38–72. doi:10.1006/jcss.2002.1822  （英语）.
Dietzfelbinger, Martin; Karlin, Anna; Mehlhorn, Kurt; Meyer auf der Heide, Friedhelm; Rohnert, Hans; Tarjan, Robert E. Dynamic perfect hashing: upper and lower bounds. SIAM Journal on Computing（英语：SIAM Journal on Computing）. August 1994, 23 (4): 738–761. doi:10.1137/S0097539791194094 （英语）.
Fan, Bin; Andersen, Dave G.; Kaminsky, Michael; Mitzenmacher, Michael D. Cuckoo filter: practically better than Bloom. Proceedings of the 10th ACM International on Conference on Emerging Networking Experiments and Technologies: 75–88. 2014. doi:10.1145/2674005.2674994  （英语）.
Bloom, Burton H. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM. 1970, 13 (7): 422–426. CiteSeerX 10.1.1.641.9096 . S2CID 7931252. doi:10.1145/362686.362692 （英语）.
Moffat & Turpin 2002，第33頁. Moffat, Alistair; Turpin, Andrew. Compression and coding algorithms. Hamburg, Germany: Kluwer Academic Publishers. 2002. ISBN 978-0-7923-7668-2. doi:10.1007/978-1-4615-0935-6 （英语）.
Perl, Yehoshua; Itai, Alon; Avni, Haim. Interpolation search—a log log n search. Communications of the ACM. 1978, 21 (7): 550–553. S2CID 11089655. doi:10.1145/359545.359557  （英语）.
Chazelle, Bernard; Liu, Ding. Lower bounds for intersection searching and fractional cascading in higher dimension. 33rd ACM Symposium on Theory of Computing（英语：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）（英语）.
Chazelle, Bernard; Liu, Ding. Lower bounds for intersection searching and fractional cascading in higher dimension (PDF). Journal of Computer and System Sciences. 2004-03-01, 68 (2): 269–284 [2018-06-30]. CiteSeerX 10.1.1.298.7772 . ISSN 0022-0000. doi:10.1016/j.jcss.2003.07.003. （原始内容存档 (PDF)于2022-10-09）（英语）.
Emamjomeh-Zadeh, Ehsan; Kempe, David; Singhal, Vikrant. Deterministic and probabilistic binary search in graphs. 48th ACM Symposium on Theory of Computing（英语：Symposium on Theory of Computing）: 519–532. 2016. arXiv:1503.00805 . doi:10.1145/2897518.2897656 （英语）.
Ben-Or, Michael; Hassidim, Avinatan. The Bayesian learner is optimal for noisy binary search (and pretty good for quantum as well) (PDF). 49th Symposium on Foundations of Computer Science（英语：Annual IEEE Symposium on Foundations of Computer Science）: 221–230. 2008. ISBN 978-0-7695-3436-7. doi:10.1109/FOCS.2008.58. （原始内容存档 (PDF)于2022-10-09）（英语）.
Pelc, Andrzej. Searching with known error probability. Theoretical Computer Science. 1989, 63 (2): 185–202. doi:10.1016/0304-3975(89)90077-7  （英语）.
Rivest, Ronald L.; Meyer, Albert R.; Kleitman, Daniel J.; Winklmann, K. Coping with errors in binary search procedures. 10th ACM Symposium on Theory of Computing（英语：Symposium on Theory of Computing）. doi:10.1145/800133.804351  （英语）.
Pelc, Andrzej. Searching games with errors—fifty years of coping with liars. Theoretical Computer Science. 2002, 270 (1–2): 71–109. doi:10.1016/S0304-3975(01)00303-6  （英语）.
Høyer, Peter; Neerbek, Jan; Shi, Yaoyun. Quantum complexities of ordered searching, sorting, and element distinctness. Algorithmica（英语：Algorithmica）. 2002, 34 (4): 429–448. S2CID 13717616. arXiv:quant-ph/0102078 . doi:10.1007/s00453-002-0976-3 （英语）.
Childs, Andrew M.; Landahl, Andrew J.; Parrilo, Pablo A. Quantum algorithms for the ordered search problem via semidefinite programming. Physical Review A. 2007, 75 (3). 032335. Bibcode:2007PhRvA..75c2335C. S2CID 41539957. arXiv:quant-ph/0608161 . doi:10.1103/PhysRevA.75.032335 （英语）.
Grover, Lov K. A fast quantum mechanical algorithm for database search. 28th ACM Symposium on Theory of Computing（英语：Symposium on Theory of Computing）. Philadelphia, PA: 212–219. 1996. arXiv:quant-ph/9605043 . doi:10.1145/237814.237866 （英语）.
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. ISBN 9780821813102. doi:10.1090/psapm/010  （英语）.
Chazelle, Bernard; Guibas, Leonidas J. Fractional cascading: I. A data structuring technique (PDF). Algorithmica（英语：Algorithmica）. 1986, 1 (1–4): 133–162 [2019-10-06]. CiteSeerX 10.1.1.117.8349 . S2CID 12745042. doi:10.1007/BF01840440. （原始内容存档 (PDF)于2016-03-03）（英语）.
Chazelle, Bernard; Guibas, Leonidas J., Fractional cascading: II. Applications (PDF), Algorithmica（英语：Algorithmica）, 1986, 1 (1–4): 163–191 [2019-10-06], S2CID 11232235, 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 （英语）.
Ruggieri, Salvatore. On computing the semi-sum of two integers (PDF). Information Processing Letters（英语：Information Processing Letters）. 2003, 87 (2): 67–71 [2016-03-19]. CiteSeerX 10.1.1.13.5631 . doi:10.1016/S0020-0190(03)00263-1. （原始内容存档 (PDF)于2006-07-03）（英语）.

edb.gov.hk

香港特別行政區政府教育局課程發展處科技教育組. 中學資訊及通訊科技科常用英漢辭彙 (PDF). 中華人民共和國香港特別行政區教育局: 7. 2023-01 [2025-05-18]. （原始内容存档 (PDF)于2025-04-09）（中文（香港））.

fcu.edu.tw

dspace.fcu.edu.tw

廖永申; 王欣平. 在嵌入式Linux系統上的新一代網路協定轉換軟體開發. 2003年NCS全國計算機會議. 2006-06-12 [2024-07-16] （中文（臺灣））.

ghostarchive.org

Morin, Pat. Hash tables (PDF): 1. [2016-03-28]. （原始内容存档 (PDF)于2022-10-09）（英语）.
Silverstein, Alan, Judy IV shop manual (PDF), Hewlett-Packard: 80–81, （原始内容存档 (PDF)于2022-10-09）（英语）
Chazelle, Bernard; Liu, Ding. Lower bounds for intersection searching and fractional cascading in higher dimension (PDF). Journal of Computer and System Sciences. 2004-03-01, 68 (2): 269–284 [2018-06-30]. CiteSeerX 10.1.1.298.7772 . ISSN 0022-0000. doi:10.1016/j.jcss.2003.07.003. （原始内容存档 (PDF)于2022-10-09）（英语）.
Ben-Or, Michael; Hassidim, Avinatan. The Bayesian learner is optimal for noisy binary search (and pretty good for quantum as well) (PDF). 49th Symposium on Foundations of Computer Science（英语：Annual IEEE Symposium on Foundations of Computer Science）: 221–230. 2008. ISBN 978-0-7695-3436-7. doi:10.1109/FOCS.2008.58. （原始内容存档 (PDF)于2022-10-09）（英语）.

golang.org

Package sort. The Go Programming Language. [2016-04-28]. （原始内容存档于2016-04-25）（英语）.

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）（英语）.

harvard.edu

ui.adsabs.harvard.edu

Childs, Andrew M.; Landahl, Andrew J.; Parrilo, Pablo A. Quantum algorithms for the ordered search problem via semidefinite programming. Physical Review A. 2007, 75 (3). 032335. Bibcode:2007PhRvA..75c2335C. S2CID 41539957. arXiv:quant-ph/0608161 . doi:10.1103/PhysRevA.75.032335 （英语）.

microsoft.com

msdn.microsoft.com

List<T>.BinarySearch method (T). Microsoft Developer Network. [2016-04-10]. （原始内容存档于2016-05-07）（英语）.

mit.edu

www2.lns.mit.edu

Ben-Or, Michael; Hassidim, Avinatan. The Bayesian learner is optimal for noisy binary search (and pretty good for quantum as well) (PDF). 49th Symposium on Foundations of Computer Science（英语：Annual IEEE Symposium on Foundations of Computer Science）: 221–230. 2008. ISBN 978-0-7695-3436-7. doi:10.1109/FOCS.2008.58. （原始内容存档 (PDF)于2022-10-09）（英语）.

oeis.org

A000225 a(n) = 2^n - 1. On-Line Encyclopedia of Integer Sequences. [2016-05-07]. （原始内容存档于2016-06-08）（英语）.

opengroup.org

pubs.opengroup.org

bsearch – binary search a sorted table. The Open Group Base Specifications 7th. The Open Group. 2013 [2016-03-28]. （原始内容存档于2016-03-21）（英语）.

oracle.com

docs.oracle.com

java.util.Arrays. Java Platform Standard Edition 8 Documentation. Oracle Corporation. [2016-05-01]. （原始内容存档于2016-04-29）（英语）.
java.util.Collections. Java Platform Standard Edition 8 Documentation. Oracle Corporation. [2016-05-01]. （原始内容存档于2016-04-23）（英语）.

princeton.edu

algs4.cs.princeton.edu

Sedgewick & Wayne 2011，§3.1 ("Elementary Symbol Tables"), subsection "Rank and selection". Sedgewick, Robert; Wayne, Kevin. Algorithms 4th. Upper Saddle River, New Jersey: Addison-Wesley Professional. 2011. ISBN 978-0-321-57351-3 （英语）. Condensed web version ; book version .
Sedgewick & Wayne 2011，§3.1 ("Elementary Symbol Tables"), subsection "Range queries". Sedgewick, Robert; Wayne, Kevin. Algorithms 4th. Upper Saddle River, New Jersey: Addison-Wesley Professional. 2011. ISBN 978-0-321-57351-3 （英语）. Condensed web version ; book version .
Sedgewick & Wayne 2011，§3.1 ("Elementary Symbol Tables"), subsection "Ordered symbol tables". Sedgewick, Robert; Wayne, Kevin. Algorithms 4th. Upper Saddle River, New Jersey: Addison-Wesley Professional. 2011. ISBN 978-0-321-57351-3 （英语）. Condensed web version ; book version .
Sedgewick & Wayne 2011，§3.2 ("Binary Search Trees"), subsection "Order-based methods and deletion". Sedgewick, Robert; Wayne, Kevin. Algorithms 4th. Upper Saddle River, New Jersey: Addison-Wesley Professional. 2011. ISBN 978-0-321-57351-3 （英语）. Condensed web version ; book version .
Sedgewick & Wayne 2011，§3.5 ("Applications"), "Which symbol-table implementation should I use?". Sedgewick, Robert; Wayne, Kevin. Algorithms 4th. Upper Saddle River, New Jersey: Addison-Wesley Professional. 2011. ISBN 978-0-321-57351-3 （英语）. Condensed web version ; book version .

cs.princeton.edu

Chazelle, Bernard; Liu, Ding. Lower bounds for intersection searching and fractional cascading in higher dimension (PDF). Journal of Computer and System Sciences. 2004-03-01, 68 (2): 269–284 [2018-06-30]. CiteSeerX 10.1.1.298.7772 . ISSN 0022-0000. doi:10.1016/j.jcss.2003.07.003. （原始内容存档 (PDF)于2022-10-09）（英语）.
Chazelle, Bernard; Guibas, Leonidas J. Fractional cascading: I. A data structuring technique (PDF). Algorithmica（英语：Algorithmica）. 1986, 1 (1–4): 133–162 [2019-10-06]. CiteSeerX 10.1.1.117.8349 . S2CID 12745042. doi:10.1007/BF01840440. （原始内容存档 (PDF)于2016-03-03）（英语）.
Chazelle, Bernard; Guibas, Leonidas J., Fractional cascading: II. Applications (PDF), Algorithmica（英语：Algorithmica）, 1986, 1 (1–4): 163–191 [2019-10-06], S2CID 11232235, doi:10.1007/BF01840441, （原始内容存档 (PDF)于2016-03-04）（英语）

psu.edu

citeseerx.ist.psu.edu

Bloom, Burton H. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM. 1970, 13 (7): 422–426. CiteSeerX 10.1.1.641.9096 . S2CID 7931252. doi:10.1145/362686.362692 （英语）.
Chazelle, Bernard; Liu, Ding. Lower bounds for intersection searching and fractional cascading in higher dimension (PDF). Journal of Computer and System Sciences. 2004-03-01, 68 (2): 269–284 [2018-06-30]. CiteSeerX 10.1.1.298.7772 . ISSN 0022-0000. doi:10.1016/j.jcss.2003.07.003. （原始内容存档 (PDF)于2022-10-09）（英语）.
Chazelle, Bernard; Guibas, Leonidas J. Fractional cascading: I. A data structuring technique (PDF). Algorithmica（英语：Algorithmica）. 1986, 1 (1–4): 133–162 [2019-10-06]. CiteSeerX 10.1.1.117.8349 . S2CID 12745042. doi:10.1007/BF01840440. （原始内容存档 (PDF)于2016-03-03）（英语）.
Ruggieri, Salvatore. On computing the semi-sum of two integers (PDF). Information Processing Letters（英语：Information Processing Letters）. 2003, 87 (2): 67–71 [2016-03-19]. CiteSeerX 10.1.1.13.5631 . doi:10.1016/S0020-0190(03)00263-1. （原始内容存档 (PDF)于2006-07-03）（英语）.

python.org

docs.python.org

8.6. bisect — Array bisection algorithm. The Python Standard Library. Python Software Foundation. [2018-03-26]. （原始内容存档于2018-03-25）（英语）.

rust-lang.org

doc.rust-lang.org

Primitive Type slice. The Rust Standard Library. The Rust Foundation. 2024 [2024-05-25]. （原始内容存档于2021-10-05）（英语）.

semanticscholar.org

api.semanticscholar.org

Flores, Ivan; Madpis, George. Average binary search length for dense ordered lists. Communications of the ACM. 1971-09-01, 14 (9): 602–603. ISSN 0001-0782. S2CID 43325465. doi:10.1145/362663.362752  （英语）.
Bottenbruch, Hermann. Structure and use of ALGOL 60. Journal of the ACM. 1962-04-01, 9 (2): 161–221. ISSN 0004-5411. S2CID 13406983. doi:10.1145/321119.321120  （英语）. Procedure is described at p. 214 (§43), titled "Program for Binary Search".
Rolfe, Timothy J. Analytic derivation of comparisons in binary search. ACM SIGNUM Newsletter. 1997, 32 (4): 15–19. S2CID 23752485. doi:10.1145/289251.289255  （英语）.
Khuong, Paul-Virak; Morin, Pat. Array Layouts for Comparison-Based Searching. Journal of Experimental Algorithmics. 2017, 22. Article 1.3. S2CID 23752485. arXiv:1509.05053 . doi:10.1145/3053370 （英语）.
Bloom, Burton H. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM. 1970, 13 (7): 422–426. CiteSeerX 10.1.1.641.9096 . S2CID 7931252. doi:10.1145/362686.362692 （英语）.
Perl, Yehoshua; Itai, Alon; Avni, Haim. Interpolation search—a log log n search. Communications of the ACM. 1978, 21 (7): 550–553. S2CID 11089655. doi:10.1145/359545.359557  （英语）.
Høyer, Peter; Neerbek, Jan; Shi, Yaoyun. Quantum complexities of ordered searching, sorting, and element distinctness. Algorithmica（英语：Algorithmica）. 2002, 34 (4): 429–448. S2CID 13717616. arXiv:quant-ph/0102078 . doi:10.1007/s00453-002-0976-3 （英语）.
Childs, Andrew M.; Landahl, Andrew J.; Parrilo, Pablo A. Quantum algorithms for the ordered search problem via semidefinite programming. Physical Review A. 2007, 75 (3). 032335. Bibcode:2007PhRvA..75c2335C. S2CID 41539957. arXiv:quant-ph/0608161 . doi:10.1103/PhysRevA.75.032335 （英语）.
Chazelle, Bernard; Guibas, Leonidas J. Fractional cascading: I. A data structuring technique (PDF). Algorithmica（英语：Algorithmica）. 1986, 1 (1–4): 133–162 [2019-10-06]. CiteSeerX 10.1.1.117.8349 . S2CID 12745042. doi:10.1007/BF01840440. （原始内容存档 (PDF)于2016-03-03）（英语）.
Chazelle, Bernard; Guibas, Leonidas J., Fractional cascading: II. Applications (PDF), Algorithmica（英语：Algorithmica）, 1986, 1 (1–4): 163–191 [2019-10-06], S2CID 11232235, doi:10.1007/BF01840441, （原始内容存档 (PDF)于2016-03-04）（英语）

sourceforge.net

judy.sourceforge.net

Silverstein, Alan, Judy IV shop manual (PDF), Hewlett-Packard: 80–81, （原始内容存档 (PDF)于2022-10-09）（英语）

unipi.it

di.unipi.it

Ruggieri, Salvatore. On computing the semi-sum of two integers (PDF). Information Processing Letters（英语：Information Processing Letters）. 2003, 87 (2): 67–71 [2016-03-19]. CiteSeerX 10.1.1.13.5631 . doi:10.1016/S0020-0190(03)00263-1. （原始内容存档 (PDF)于2006-07-03）（英语）.

web.archive.org

香港特別行政區政府教育局課程發展處科技教育組. 中學資訊及通訊科技科常用英漢辭彙 (PDF). 中華人民共和國香港特別行政區教育局: 7. 2023-01 [2025-05-18]. （原始内容存档 (PDF)于2025-04-09）（中文（香港））.
Chazelle, Bernard; Liu, Ding. Lower bounds for intersection searching and fractional cascading in higher dimension. 33rd ACM Symposium on Theory of Computing（英语：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）（英语）.
A000225 a(n) = 2^n - 1. On-Line Encyclopedia of Integer Sequences. [2016-05-07]. （原始内容存档于2016-06-08）（英语）.
Chazelle, Bernard; Guibas, Leonidas J. Fractional cascading: I. A data structuring technique (PDF). Algorithmica（英语：Algorithmica）. 1986, 1 (1–4): 133–162 [2019-10-06]. CiteSeerX 10.1.1.117.8349 . S2CID 12745042. doi:10.1007/BF01840440. （原始内容存档 (PDF)于2016-03-03）（英语）.
Chazelle, Bernard; Guibas, Leonidas J., Fractional cascading: II. Applications (PDF), Algorithmica（英语：Algorithmica）, 1986, 1 (1–4): 163–191 [2019-10-06], S2CID 11232235, 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）（英语）.
Ruggieri, Salvatore. On computing the semi-sum of two integers (PDF). Information Processing Letters（英语：Information Processing Letters）. 2003, 87 (2): 67–71 [2016-03-19]. CiteSeerX 10.1.1.13.5631 . doi:10.1016/S0020-0190(03)00263-1. （原始内容存档 (PDF)于2006-07-03）（英语）.
bsearch – binary search a sorted table. The Open Group Base Specifications 7th. The Open Group. 2013 [2016-03-28]. （原始内容存档于2016-03-21）（英语）.
std.range - D Programming Language. dlang.org. [2020-04-29]. （原始内容存档于2018-11-27）（英语）.
Package sort. The Go Programming Language. [2016-04-28]. （原始内容存档于2016-04-25）（英语）.
java.util.Arrays. Java Platform Standard Edition 8 Documentation. Oracle Corporation. [2016-05-01]. （原始内容存档于2016-04-29）（英语）.
java.util.Collections. Java Platform Standard Edition 8 Documentation. Oracle Corporation. [2016-05-01]. （原始内容存档于2016-04-23）（英语）.
List<T>.BinarySearch method (T). Microsoft Developer Network. [2016-04-10]. （原始内容存档于2016-05-07）（英语）.
NSArray. Mac Developer Library. Apple Inc. [2016-05-01]. （原始内容存档于2016-04-17）（英语）.
CFArray. Mac Developer Library. Apple Inc. [2016-05-01]. （原始内容存档于2016-04-20）（英语）.
8.6. bisect — Array bisection algorithm. The Python Standard Library. Python Software Foundation. [2018-03-26]. （原始内容存档于2018-03-25）（英语）.
Primitive Type slice. The Rust Standard Library. The Rust Foundation. 2024 [2024-05-25]. （原始内容存档于2021-10-05）（英语）.

wikipedia.org

en.wikipedia.org

Knuth（1998）使用其设计的MIX计算机模型（英语：MIX (abstract machine)）发现，对于成功搜索而言，前述算法（即二分查找在每次迭代末尾检查元素相等性）的平均运行时间为 ${\textstyle 17.5\log _{2}n+17}$ 个单位，而标准二分查找的平均运行时间则为 ${\textstyle 18\log _{2}n-16}$ 个单位。前者的时间复杂度增长稍慢，但初始复杂度更高。^[27] Knuth, Donald. Sorting and searching. The Art of Computer Programming 3 2nd. Reading, MA: Addison-Wesley Professional. 1998. ISBN 978-0-201-89685-5 （英语）.
Knuth（1998）对这两种搜索算法的运行时间做了形式化分析。在Knuth设计的MIX计算机（英语：MIX (abstract machine)）上，对于成功搜索，二分查找平均耗时为 ${\textstyle 18\log n-16}$ 个单位；而在数组末尾加入哨兵节点（英语：Sentinel node）的线性搜索平均耗时为 ${\textstyle 1.75n+8.5-{\frac {n{\text{ mod }}2}{4n}}}$ 个单位。线性搜索的计算量很少，故初始复杂度较低，但随规模增长，其复杂度很快便会超过二分查找。在MIX计算机上，只有当 ${\textstyle n>44}$ 时，二分查找的性能才会超过带哨兵的线性搜索。^[23]^[32] Knuth, Donald. Sorting and searching. The Art of Computer Programming 3 2nd. Reading, MA: Addison-Wesley Professional. 1998. ISBN 978-0-201-89685-5 （英语）.
一些版本改进了布隆过滤器，优化了其复杂度或支持删除操作。例如，布谷鸟过滤器利用布谷鸟哈希（英语：Cuckoo hashing）技术，实现了这些优势。^[50]
Goldman & Goldman 2008，第461–463頁. Goldman, Sally A.; Goldman, Kenneth J. A practical guide to data structures and algorithms using Java. Boca Raton, Florida: CRC Press（英语：CRC Press）. 2008. ISBN 978-1-58488-455-2 （英语）.
Chang 2003，第169頁. Chang, Shi-Kuo. Data structures and algorithms. Software Engineering and Knowledge Engineering 13. Singapore: World Scientific（英语：World Scientific）. 2003. ISBN 978-981-238-348-8 （英语）.
Beame, Paul; Fich, Faith E. Optimal bounds for the predecessor problem and related problems. Journal of Computer and System Sciences（英语：Journal of Computer and System Sciences）. 2001, 65 (1): 38–72. doi:10.1006/jcss.2002.1822  （英语）.
Dietzfelbinger, Martin; Karlin, Anna; Mehlhorn, Kurt; Meyer auf der Heide, Friedhelm; Rohnert, Hans; Tarjan, Robert E. Dynamic perfect hashing: upper and lower bounds. SIAM Journal on Computing（英语：SIAM Journal on Computing）. August 1994, 23 (4): 738–761. doi:10.1137/S0097539791194094 （英语）.
Chazelle, Bernard; Liu, Ding. Lower bounds for intersection searching and fractional cascading in higher dimension. 33rd ACM Symposium on Theory of Computing（英语：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）（英语）.
Emamjomeh-Zadeh, Ehsan; Kempe, David; Singhal, Vikrant. Deterministic and probabilistic binary search in graphs. 48th ACM Symposium on Theory of Computing（英语：Symposium on Theory of Computing）: 519–532. 2016. arXiv:1503.00805 . doi:10.1145/2897518.2897656 （英语）.
Ben-Or, Michael; Hassidim, Avinatan. The Bayesian learner is optimal for noisy binary search (and pretty good for quantum as well) (PDF). 49th Symposium on Foundations of Computer Science（英语：Annual IEEE Symposium on Foundations of Computer Science）: 221–230. 2008. ISBN 978-0-7695-3436-7. doi:10.1109/FOCS.2008.58. （原始内容存档 (PDF)于2022-10-09）（英语）.
Rivest, Ronald L.; Meyer, Albert R.; Kleitman, Daniel J.; Winklmann, K. Coping with errors in binary search procedures. 10th ACM Symposium on Theory of Computing（英语：Symposium on Theory of Computing）. doi:10.1145/800133.804351  （英语）.
Høyer, Peter; Neerbek, Jan; Shi, Yaoyun. Quantum complexities of ordered searching, sorting, and element distinctness. Algorithmica（英语：Algorithmica）. 2002, 34 (4): 429–448. S2CID 13717616. arXiv:quant-ph/0102078 . doi:10.1007/s00453-002-0976-3 （英语）.
Grover, Lov K. A fast quantum mechanical algorithm for database search. 28th ACM Symposium on Theory of Computing（英语：Symposium on Theory of Computing）. Philadelphia, PA: 212–219. 1996. arXiv:quant-ph/9605043 . doi:10.1145/237814.237866 （英语）.
Chazelle, Bernard; Guibas, Leonidas J. Fractional cascading: I. A data structuring technique (PDF). Algorithmica（英语：Algorithmica）. 1986, 1 (1–4): 133–162 [2019-10-06]. CiteSeerX 10.1.1.117.8349 . S2CID 12745042. doi:10.1007/BF01840440. （原始内容存档 (PDF)于2016-03-03）（英语）.
Chazelle, Bernard; Guibas, Leonidas J., Fractional cascading: II. Applications (PDF), Algorithmica（英语：Algorithmica）, 1986, 1 (1–4): 163–191 [2019-10-06], S2CID 11232235, doi:10.1007/BF01840441, （原始内容存档 (PDF)于2016-03-04）（英语）
Ruggieri, Salvatore. On computing the semi-sum of two integers (PDF). Information Processing Letters（英语：Information Processing Letters）. 2003, 87 (2): 67–71 [2016-03-19]. CiteSeerX 10.1.1.13.5631 . doi:10.1016/S0020-0190(03)00263-1. （原始内容存档 (PDF)于2006-07-03）（英语）.

wolfram.com

mathworld.wolfram.com

埃里克·韦斯坦因. Binary search. MathWorld.

worldcat.org

Flores, Ivan; Madpis, George. Average binary search length for dense ordered lists. Communications of the ACM. 1971-09-01, 14 (9): 602–603. ISSN 0001-0782. S2CID 43325465. doi:10.1145/362663.362752  （英语）.
Bottenbruch, Hermann. Structure and use of ALGOL 60. Journal of the ACM. 1962-04-01, 9 (2): 161–221. ISSN 0004-5411. S2CID 13406983. 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 (PDF). Journal of Computer and System Sciences. 2004-03-01, 68 (2): 269–284 [2018-06-30]. CiteSeerX 10.1.1.298.7772 . ISSN 0022-0000. doi:10.1016/j.jcss.2003.07.003. （原始内容存档 (PDF)于2022-10-09）（英语）.