Hamming weight (English Wikipedia)

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

refsWebsite

Global rank English rank

7doi.org

2^nd place

3semanticscholar.org

11^th place

8^th place

2web.archive.org

1^st place

2books.google.com

3^rd place

2harvard.edu

18^th place

17^th place

2arxiv.org

69^th place

59^th place

2github.com

383^rd place

320^th place

1stanford.edu

179^th place

183^rd place

1hp41.net

low place

1formulae.org

low place

1nih.gov

4^th place

1utexas.edu

916^th place

706^th place

1gnu.org

1,475^th place

1,188^th place

1llvm.org

low place

7,917^th place

1python.org

2,232^nd place

1,903^rd place

1haskell.org

low place

7,198^th place

1mysql.com

low place

8,021^st place

1freepascal.org

low place

1java.com

low place

arxiv.org (Global: 69^th place; English: 59^th 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: 383^rd place; English: 320^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,475^th place; English: 1,188^th place)

gcc.gnu.org

"GCC 3.4 Release Notes". GNU Project.

harvard.edu (Global: 18^th place; English: 17^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.

haskell.org (Global: low place; English: 7,198^th 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: 7,917^th place)

"LLVM 1.5 Release Notes". LLVM Project.

mysql.com (Global: low place; English: 8,021^st place)

dev.mysql.com

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

nih.gov (Global: 4^th place; English: 4^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: 2,232^nd place; English: 1,903^rd place)

docs.python.org

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

semanticscholar.org (Global: 11^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: 179^th place; English: 183^rd 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: 916^th place; English: 706^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)

arxiv.org (Global: 69th place; English: 59th 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: 383rd place; English: 320th place)

gnu.org (Global: 1,475th place; English: 1,188th place)

gcc.gnu.org

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

ui.adsabs.harvard.edu

haskell.org (Global: low place; English: 7,198th 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: 7,917th place)

mysql.com (Global: low place; English: 8,021st place)

dev.mysql.com

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

pubmed.ncbi.nlm.nih.gov

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

docs.python.org

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

api.semanticscholar.org

stanford.edu (Global: 179th place; English: 183rd place)

www-cs-faculty.stanford.edu

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

cs.utexas.edu

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

arxiv.org (Global: 69^th place; English: 59^th 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: 383^rd place; English: 320^th place)

gnu.org (Global: 1,475^th place; English: 1,188^th place)

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

haskell.org (Global: low place; English: 7,198^th place)

llvm.org (Global: low place; English: 7,917^th place)

mysql.com (Global: low place; English: 8,021^st place)

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

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

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

stanford.edu (Global: 179^th place; English: 183^rd place)

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

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