Hamming weight (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Hamming weight" in English language version.

Last modified: 17:56:12, 25 February 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

77doi.org

2^nd place

33semanticscholar.org

15^th place

8^th place

32web.archive.org

1^st place

22books.google.com

3^rd place

22adsabs.harvard.edu

14^th place

9^th place

22arxiv.org

49^th place

31^st place

22github.com

380^th place

337^th place

21hp41.net

low place

21utexas.edu

868^th place

634^th place

11stanford.edu

194^th place

182^nd place

11formulae.org

low place

11nih.gov

5^th place

11gnu.org

1,901^st place

1,743^rd place

11llvm.org

low place

11python.org

4,399^th place

3,941^st place

11haskell.org

low place

11mysql.com

low place

11freepascal.org

low place

11java.com

low place

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

ui.adsabs.harvard.edu

Stoica, I.; Morris, R.; Liben-Nowell, D.; Karger, D. R.; Kaashoek, M. F.; Dabek, F.; Balakrishnan, H. (February 2003). "Chord: a scalable peer-to-peer lookup protocol for internet applications". IEEE/ACM Transactions on Networking. 11 (1): 17–32. Bibcode:2003ITNet..11...17S. doi:10.1109/TNET.2002.808407. S2CID 221276912. Section 6.3: "In general, the number of fingers we need to follow will be the number of ones in the binary representation of the distance from node to query."
Kong, A.W.K.; Zhang, D.; Kamel, M.S. (February 2010). "An analysis of IrisCode". IEEE Transactions on Image Processing. 19 (2): 522–532. Bibcode:2010ITIP...19..522K. doi:10.1109/tip.2009.2033427. PMID 20083454.

arxiv.org (Global: 49^th place; English: 31^st place)

Muła, Wojciech; Kurz, Nathan; Lemire, Daniel (January 2018). "Faster Population Counts Using AVX2 Instructions". Computer Journal. 61 (1): 111–120. arXiv:1611.07612. doi:10.1093/comjnl/bxx046. S2CID 540973.
Muła, Wojciech; Kurz, Nathan; Lemire, Daniel (2018). "Faster Population Counts Using AVX2 Instructions". The Computer Journal. 61: 111–120. arXiv:1611.07612. doi:10.1093/comjnl/bxx046.

books.google.com (Global: 3^rd place; English: 3^rd place)

Glaisher, James Whitbread Lee (1899). "On the residue of a binomial-theorem coefficient with respect to a prime modulus". The Quarterly Journal of Pure and Applied Mathematics. 30: 150–156. (NB. See in particular the final paragraph of p. 156.)
Blaxell, David (1978). Hogben, David; Fife, Dennis W. (eds.). "Record linkage by bit pattern matching". Computer Science and Statistics--Tenth Annual Symposium on the Interface. NBS Special Publication. 503. U.S. Department of Commerce / National Bureau of Standards: 146–156.

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

Cohen, Gérard D.; Lobstein, Antoine; Naccache, David; Zémor, Gilles (1998). "How to improve an exponentiation black-box". In Nyberg, Kaisa (ed.). Advances in Cryptology – EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31 – June 4, 1998, Proceeding. Lecture Notes in Computer Science. Vol. 1403. Springer. pp. 211–220. doi:10.1007/BFb0054128. ISBN 978-3-540-64518-4.
Stoica, I.; Morris, R.; Liben-Nowell, D.; Karger, D. R.; Kaashoek, M. F.; Dabek, F.; Balakrishnan, H. (February 2003). "Chord: a scalable peer-to-peer lookup protocol for internet applications". IEEE/ACM Transactions on Networking. 11 (1): 17–32. Bibcode:2003ITNet..11...17S. doi:10.1109/TNET.2002.808407. S2CID 221276912. Section 6.3: "In general, the number of fingers we need to follow will be the number of ones in the binary representation of the distance from node to query."
Kong, A.W.K.; Zhang, D.; Kamel, M.S. (February 2010). "An analysis of IrisCode". IEEE Transactions on Image Processing. 19 (2): 522–532. Bibcode:2010ITIP...19..522K. doi:10.1109/tip.2009.2033427. PMID 20083454.
Heinz, E.A. (September 1997). "How Darkthought plays chess". ICGA Journal. 20 (3): 166–176. doi:10.3233/icg-1997-20304. Updated and reprinted in Scalable Search in Computer Chess (Vieweg+Teubner Verlag, 2000), pp. 185–198, doi:10.1007/978-3-322-90178-1_13
Wegner, Peter (May 1960). "A technique for counting ones in a binary computer". Communications of the ACM. 3 (5): 322. doi:10.1145/367236.367286. S2CID 31683715.
Muła, Wojciech; Kurz, Nathan; Lemire, Daniel (January 2018). "Faster Population Counts Using AVX2 Instructions". Computer Journal. 61 (1): 111–120. arXiv:1611.07612. doi:10.1093/comjnl/bxx046. S2CID 540973.
Muła, Wojciech; Kurz, Nathan; Lemire, Daniel (2018). "Faster Population Counts Using AVX2 Instructions". The Computer Journal. 61: 111–120. arXiv:1611.07612. doi:10.1093/comjnl/bxx046.

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

R.Ugalde, Laurence. "Population count the Fōrmulæ programming language". Fōrmulæ. Retrieved 2024-06-02.

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

"Free Pascal documentation popcnt". Retrieved 2019-12-07.

github.com (Global: 380^th place; English: 337^th place)

"Sse-popcount/Popcnt-harley-seal.CPP at master · WojciechMula/Sse-popcount". GitHub.
Wolf, Claire (2019-03-22). "RISC-V "B" Bit Manipulation Extension for RISC-V, Draft v0.37" (PDF). Github.

gnu.org (Global: 1,901^st place; English: 1,743^rd place)

gcc.gnu.org

"GCC 3.4 Release Notes". GNU Project.

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

"GHC 7.4.1 release notes". GHC documentation.

hp41.net (Global: low place; English: low place)

Hewlett-Packard HP-16C Computer Scientist Owner's Handbook (PDF). Hewlett-Packard Company. April 1982. 00016-90001. Archived (PDF) from the original on 2017-03-28. Retrieved 2017-03-28.

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

bugs.java.com

"JDK-6378821: bitCount() should use POPC on SPARC processors and AMD+10h". Java bug database. 2006-01-30.

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

"LLVM 1.5 Release Notes". LLVM Project.

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

dev.mysql.com

"Chapter 12.11. Bit Functions — MySQL 5.0 Reference Manual".

nih.gov (Global: 5^th place; English: 5^th place)

pubmed.ncbi.nlm.nih.gov

Kong, A.W.K.; Zhang, D.; Kamel, M.S. (February 2010). "An analysis of IrisCode". IEEE Transactions on Image Processing. 19 (2): 522–532. Bibcode:2010ITIP...19..522K. doi:10.1109/tip.2009.2033427. PMID 20083454.

python.org (Global: 4,399^th place; English: 3,941^st place)

docs.python.org

"What's New In Python 3.10". python.org.

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

api.semanticscholar.org

Stoica, I.; Morris, R.; Liben-Nowell, D.; Karger, D. R.; Kaashoek, M. F.; Dabek, F.; Balakrishnan, H. (February 2003). "Chord: a scalable peer-to-peer lookup protocol for internet applications". IEEE/ACM Transactions on Networking. 11 (1): 17–32. Bibcode:2003ITNet..11...17S. doi:10.1109/TNET.2002.808407. S2CID 221276912. Section 6.3: "In general, the number of fingers we need to follow will be the number of ones in the binary representation of the distance from node to query."
Wegner, Peter (May 1960). "A technique for counting ones in a binary computer". Communications of the ACM. 3 (5): 322. doi:10.1145/367236.367286. S2CID 31683715.
Muła, Wojciech; Kurz, Nathan; Lemire, Daniel (January 2018). "Faster Population Counts Using AVX2 Instructions". Computer Journal. 61 (1): 111–120. arXiv:1611.07612. doi:10.1093/comjnl/bxx046. S2CID 540973.

stanford.edu (Global: 194^th place; English: 182^nd place)

www-cs-faculty.stanford.edu

Knuth, Donald Ervin (2009). "Bitwise tricks & techniques; Binary Decision Diagrams". The Art of Computer Programming. Vol. 4, Fascicle 1. Addison–Wesley Professional. ISBN 978-0-321-58050-4. (NB. Draft of Fascicle 1b Archived 2016-03-12 at the Wayback Machine available for download.)

utexas.edu (Global: 868^th place; English: 634^th place)

cs.utexas.edu

SPARC International, Inc. (1992). "A.41: Population Count. Programming Note". The SPARC architecture manual: version 9 (Version 9 ed.). Englewood Cliffs, New Jersey, USA: Prentice Hall. pp. 205. ISBN 0-13-825001-4.

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

Knuth, Donald Ervin (2009). "Bitwise tricks & techniques; Binary Decision Diagrams". The Art of Computer Programming. Vol. 4, Fascicle 1. Addison–Wesley Professional. ISBN 978-0-321-58050-4. (NB. Draft of Fascicle 1b Archived 2016-03-12 at the Wayback Machine available for download.)
Hewlett-Packard HP-16C Computer Scientist Owner's Handbook (PDF). Hewlett-Packard Company. April 1982. 00016-90001. Archived (PDF) from the original on 2017-03-28. Retrieved 2017-03-28.

Hamming weight (English Wikipedia)

adsabs.harvard.edu (Global: 14th place; English: 9th place)

ui.adsabs.harvard.edu

arxiv.org (Global: 49th place; English: 31st place)

books.google.com (Global: 3rd place; English: 3rd place)

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

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

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

github.com (Global: 380th place; English: 337th place)

gnu.org (Global: 1,901st place; English: 1,743rd place)

gcc.gnu.org

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

hp41.net (Global: low place; English: low place)

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

bugs.java.com

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

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

dev.mysql.com

nih.gov (Global: 5th place; English: 5th place)

pubmed.ncbi.nlm.nih.gov

python.org (Global: 4,399th place; English: 3,941st place)

docs.python.org

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

api.semanticscholar.org

stanford.edu (Global: 194th place; English: 182nd place)

www-cs-faculty.stanford.edu

utexas.edu (Global: 868th place; English: 634th place)

cs.utexas.edu

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

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

arxiv.org (Global: 49^th place; English: 31^st place)

books.google.com (Global: 3^rd place; English: 3^rd place)

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

github.com (Global: 380^th place; English: 337^th place)

gnu.org (Global: 1,901^st place; English: 1,743^rd place)

nih.gov (Global: 5^th place; English: 5^th place)

python.org (Global: 4,399^th place; English: 3,941^st place)

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

stanford.edu (Global: 194^th place; English: 182^nd place)

utexas.edu (Global: 868^th place; English: 634^th place)

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