Sign In

Login

Password

Forgot Password ? Sign Up

Associative array (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Associative array" in English language version.

refsWebsite
Global rank English rank
5doi.org
2nd place
2nd place
2web.archive.org
1st place
1st place
2semanticscholar.org
11th place
8th place
2microsoft.com
153rd place
151st place
1mpg.de
1,624th place
1,592nd place
1wustl.edu
3,160th place
2,065th place
1acm.org
1,185th place
840th place
1utexas.edu
916th place
706th place
1harvard.edu
18th place
17th place
1nist.gov
355th place
454th place
1faqs.org
4,871st place
4,382nd place
1calvin.edu
9,834th place
6,399th place
1schani.wordpress.com
low place
low place
1cppreference.com
low place
9,420th place
1oracle.com
1,514th place
1,024th place
1python.org
2,232nd place
1,903rd place
1embarcadero.com
low place
low place
1dlang.org
low place
low place
1apple.com
67th place
64th place

acm.org (Global: 1,185th place; English: 840th place)

portal.acm.org

apple.com (Global: 67th place; English: 64th place)

developer.apple.com

calvin.edu (Global: 9,834th place; English: 6,399th 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."

cppreference.com (Global: low place; English: 9,420th place)

en.cppreference.com

dlang.org (Global: low place; English: low place)

doi.org (Global: 2nd place; English: 2nd place)

  • Collins, Graham; Syme, Donald (1995). "A theory of finite maps". Higher Order Logic Theorem Proving and Its Applications. Lecture Notes in Computer Science. Vol. 971. pp. 122–137. doi:10.1007/3-540-60275-5_61. ISBN 978-3-540-60275-0.
  • Andersson, Arne (1989). "Optimal Bounds on the Dictionary Problem". Proc. Symposium on Optimal Algorithms. Lecture Notes in Computer Science. Vol. 401. Springer Verlag. pp. 106–114. doi:10.1007/3-540-51859-2_10. ISBN 978-3-540-51859-4.
  • 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" Archived 2016-03-04 at the Wayback Machine. SIAM J. Comput. 23, 4 (Aug. 1994), 738-761. http://portal.acm.org/citation.cfm?id=182370 doi:10.1137/S0097539791194094
  • Michie, Donald (1968). "'Memo' Functions and Machine Learning" (PDF). Nature. 218 (5136): 19–22. Bibcode:1968Natur.218...19M. doi:10.1038/218019a0. S2CID 4265138.
  • Alvarez, Victor; Richter, Stefan; Chen, Xiao; Dittrich, Jens (April 2015). "A comparison of adaptive radix trees and hash tables". 2015 IEEE 31st International Conference on Data Engineering. Seoul, South Korea: IEEE. pp. 1227–1238. doi:10.1109/ICDE.2015.7113370. ISBN 978-1-4799-7964-6. S2CID 17170456.

embarcadero.com (Global: low place; English: low place)

docwiki.embarcadero.com

faqs.org (Global: 4,871st place; English: 4,382nd place)

harvard.edu (Global: 18th place; English: 17th place)

ui.adsabs.harvard.edu

microsoft.com (Global: 153rd place; English: 151st place)

docs.microsoft.com

msdn.microsoft.com

mpg.de (Global: 1,624th place; English: 1,592nd place)

people.mpi-inf.mpg.de

nist.gov (Global: 355th place; English: 454th place)

xlinux.nist.gov

  • Black, Paul E.; Stewart, Rob (2 November 2020). "dictionary". Dictionary of Algorithms and Data Structures. Retrieved 26 January 2022.

oracle.com (Global: 1,514th place; English: 1,024th place)

docs.oracle.com

python.org (Global: 2,232nd place; English: 1,903rd place)

docs.python.org

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

semanticscholar.org (Global: 11th place; English: 8th place)

api.semanticscholar.org

utexas.edu (Global: 916th place; English: 706th place)

cs.utexas.edu

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

wustl.edu (Global: 3,160th place; English: 2,065th place)

arl.wustl.edu