关联数组 (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "关联数组" in Chinese language version.

refsWebsite

Global rank Chinese rank

4web.archive.org

1^st place

1wustl.edu

3,160^th place

4,093^rd place

1acm.org

1,185^th place

809^th place

1doi.org

2^nd place

23^rd place

1faqs.org

4,871^st place

2,410^th place

1calvin.edu

9,834^th place

low place

1schani.wordpress.com

low place

acm.org (Global: 1,185^th place; Chinese: 809^th place)

portal.acm.org

Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., and Tarjan, R. E. 1994. "Dynamic Perfect Hashing: Upper and Lower Bounds" 互联网档案馆的存檔，存档日期2016-03-04.. SIAM J. Comput. 23, 4 (Aug. 1994), 738-761. http://portal.acm.org/citation.cfm?id=182370 doi:10.1137/S0097539791194094

calvin.edu (Global: 9,834^th place; Chinese: low place)

cs.calvin.edu

Joel Adams and Larry Nyhoff. "Trees in STL" （页面存档备份，存于互联网档案馆）. Quote: "The Standard Template library ... some of its containers -- the set<T>, map<T1, T2>, multiset<T>, and multimap<T1, T2> templates -- are generally built using a special kind of self-balancing binary search tree called a red–black tree."

doi.org (Global: 2^nd place; Chinese: 23^rd place)

Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., and Tarjan, R. E. 1994. "Dynamic Perfect Hashing: Upper and Lower Bounds" 互联网档案馆的存檔，存档日期2016-03-04.. SIAM J. Comput. 23, 4 (Aug. 1994), 738-761. http://portal.acm.org/citation.cfm?id=182370 doi:10.1137/S0097539791194094

faqs.org (Global: 4,871^st place; Chinese: 2,410^th place)

When should I use a hash table instead of an association list?. lisp-faq/part2. 1996-02-20 [2021-08-26]. （原始内容存档于2022-03-31）.

schani.wordpress.com (Global: low place; Chinese: low place)

Probst, Mark. Linear vs Binary Search. 2010-04-30 [2016-11-20]. （原始内容存档于2016-11-20）.

web.archive.org (Global: 1^st place; Chinese: 1^st place)

Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., and Tarjan, R. E. 1994. "Dynamic Perfect Hashing: Upper and Lower Bounds" 互联网档案馆的存檔，存档日期2016-03-04.. SIAM J. Comput. 23, 4 (Aug. 1994), 738-761. http://portal.acm.org/citation.cfm?id=182370 doi:10.1137/S0097539791194094
When should I use a hash table instead of an association list?. lisp-faq/part2. 1996-02-20 [2021-08-26]. （原始内容存档于2022-03-31）.
Joel Adams and Larry Nyhoff. "Trees in STL" （页面存档备份，存于互联网档案馆）. Quote: "The Standard Template library ... some of its containers -- the set<T>, map<T1, T2>, multiset<T>, and multimap<T1, T2> templates -- are generally built using a special kind of self-balancing binary search tree called a red–black tree."
Probst, Mark. Linear vs Binary Search. 2010-04-30 [2016-11-20]. （原始内容存档于2016-11-20）.

wustl.edu (Global: 3,160^th place; Chinese: 4,093^rd place)

arl.wustl.edu

Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., and Tarjan, R. E. 1994. "Dynamic Perfect Hashing: Upper and Lower Bounds" 互联网档案馆的存檔，存档日期2016-03-04.. SIAM J. Comput. 23, 4 (Aug. 1994), 738-761. http://portal.acm.org/citation.cfm?id=182370 doi:10.1137/S0097539791194094

关联数组 (Chinese Wikipedia)

acm.org (Global: 1,185th place; Chinese: 809th place)

portal.acm.org

calvin.edu (Global: 9,834th place; Chinese: low place)

cs.calvin.edu

doi.org (Global: 2nd place; Chinese: 23rd place)

faqs.org (Global: 4,871st place; Chinese: 2,410th place)