Count sketch (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Count sketch" in English language version.

Last modified: 14:46:29, 23 September 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

43doi.org

2^nd place

33slyusar.kiev.ua

low place

21rutgers.edu

2,011^th place

1,139^th place

21worldcat.org

4^th place

11researchgate.net

96^th place

89^th place

11semanticscholar.org

15^th place

8^th place

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

Charikar, Chen & Farach-Colton 2004. Charikar, Moses; Chen, Kevin; Farach-Colton, Martin (2004). "Finding frequent items in data streams" (PDF). Theoretical Computer Science. 312 (1). Elsevier BV: 3–15. doi:10.1016/s0304-3975(03)00400-6. ISSN 0304-3975.
Ninh, Pham; Pagh, Rasmus (2013). Fast and scalable polynomial kernels via explicit feature maps. SIGKDD international conference on Knowledge discovery and data mining. Association for Computing Machinery. doi:10.1145/2487575.2487591.
Slyusar, V. I. (March 13, 1998). "A Family of Face Products of Matrices and its Properties" (PDF). Cybernetics and Systems Analysis C/C of Kibernetika I Sistemnyi Analiz.- 1999. 35 (3): 379–384. doi:10.1007/BF02733426. S2CID 119661450.

researchgate.net (Global: 96^th place; English: 89^th place)

Ahle, Thomas; Knudsen, Jakob (2019-09-03). "Almost Optimal Tensor Sketch". ResearchGate. Retrieved 2020-07-11.

rutgers.edu (Global: 2,011^th place; English: 1,139^th place)

people.cs.rutgers.edu

Charikar, Chen & Farach-Colton 2004. Charikar, Moses; Chen, Kevin; Farach-Colton, Martin (2004). "Finding frequent items in data streams" (PDF). Theoretical Computer Science. 312 (1). Elsevier BV: 3–15. doi:10.1016/s0304-3975(03)00400-6. ISSN 0304-3975.

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

api.semanticscholar.org

Slyusar, V. I. (March 13, 1998). "A Family of Face Products of Matrices and its Properties" (PDF). Cybernetics and Systems Analysis C/C of Kibernetika I Sistemnyi Analiz.- 1999. 35 (3): 379–384. doi:10.1007/BF02733426. S2CID 119661450.

slyusar.kiev.ua (Global: low place; English: low place)

Slyusar, V. I. (1998). "End products in matrices in radar applications" (PDF). Radioelectronics and Communications Systems. 41 (3): 50–53.
Slyusar, V. I. (1997-05-20). "Analytical model of the digital antenna array on a basis of face-splitting matrix products" (PDF). Proc. ICATT-97, Kyiv: 108–109.
Slyusar, V. I. (March 13, 1998). "A Family of Face Products of Matrices and its Properties" (PDF). Cybernetics and Systems Analysis C/C of Kibernetika I Sistemnyi Analiz.- 1999. 35 (3): 379–384. doi:10.1007/BF02733426. S2CID 119661450.

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Charikar, Chen & Farach-Colton 2004. Charikar, Moses; Chen, Kevin; Farach-Colton, Martin (2004). "Finding frequent items in data streams" (PDF). Theoretical Computer Science. 312 (1). Elsevier BV: 3–15. doi:10.1016/s0304-3975(03)00400-6. ISSN 0304-3975.

Count sketch (English Wikipedia)

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

researchgate.net (Global: 96th place; English: 89th place)

rutgers.edu (Global: 2,011th place; English: 1,139th place)