Range searching (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Range searching" in English language version.

Last modified: 03:23:16, 26 January 2025 (UTC)

Ref.Un. Ref.Website

Global rank English rank

77doi.org

2^nd place

33semanticscholar.org

15^th place

8^th place

11illinois.edu

1,178^th place

745^th place

11psu.edu

299^th place

159^th place

11arxiv.org

49^th place

31^st place

11uni-saarland.de

low place

11hdl.handle.net

66^th place

34^th place

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

Chan, Timothy; Larsen, Kasper; Pătrașcu, Mihai (2011). "Orthogonal range searching on the RAM, revisited". Symposium on Computational Geometry: 1–10. arXiv:1103.5510.

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

Bentley, Jon (1975). "Multidimensional binary search trees used for associative searching". Communications of the ACM. 18 (9): 509–517. doi:10.1145/361002.361007. S2CID 13091446.
Bentley, Jon (1980). "Multidimensional divide-and-conquer". Communications of the ACM. 23 (4): 214–229. doi:10.1145/358841.358850. S2CID 3997186.
Willard, Dan (1985). "New data structures for orthogonal range queries". SIAM Journal on Computing. 14 (1): 232–253. doi:10.1137/0214019.
Chazelle, Bernard (1988). "A functional approach to data structures and its use in multidimensional searching". SIAM Journal on Computing. 17 (3): 427–462. CiteSeerX 10.1.1.133.9153. doi:10.1137/0217026. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Mehlhorn, Kurt; Näher, Stefan (1990). "Dynamic fractional cascading" (PDF). Algorithmica. 5 (2): 215–241. doi:10.1007/BF01840386. S2CID 7721690.
Gupta, Prosenjit; Janardan, Ravi; Smid, Michiel (1995). "Further results on generalized intersection searching problems: Counting, reporting, and dynamization". Journal of Algorithms. 19 (2): 282–317. doi:10.1006/jagm.1995.1038. hdl:11858/00-001M-0000-0014-B721-F.
Kaplan, Haim; Rubin, Natan; Sharir, Micha; Verbin, Elad (2008). "Efficient Colored Orthogonal Range Counting". SIAM Journal on Computing. 38 (3): 982–1011. doi:10.1137/070684483.

hdl.handle.net (Global: 66^th place; English: 34^th place)

Gupta, Prosenjit; Janardan, Ravi; Smid, Michiel (1995). "Further results on generalized intersection searching problems: Counting, reporting, and dynamization". Journal of Algorithms. 19 (2): 282–317. doi:10.1006/jagm.1995.1038. hdl:11858/00-001M-0000-0014-B721-F.

illinois.edu (Global: 1,178^th place; English: 745^th place)

jeffe.cs.illinois.edu

Agarwal, P. K.; Erickson, J. (1999), "Geometric Range Searching and Its Relatives", in Chazelle, Bernard; Goodman, Jacob; Pollack, Richard (eds.), Advances in Discrete and Computational Geometry: proceedings of the 1996 AMS-IMS-SIAM joint summer research conference, Discrete and Computational Geometry--Ten Years Later, July 14-18, 1996, Mount Holyoke College, Contemporary Mathematics, vol. 223, American Mathematical Society Press, pp. 1–56

psu.edu (Global: 299^th place; English: 159^th place)

citeseerx.ist.psu.edu

Chazelle, Bernard (1988). "A functional approach to data structures and its use in multidimensional searching". SIAM Journal on Computing. 17 (3): 427–462. CiteSeerX 10.1.1.133.9153. doi:10.1137/0217026. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)

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

api.semanticscholar.org

Bentley, Jon (1975). "Multidimensional binary search trees used for associative searching". Communications of the ACM. 18 (9): 509–517. doi:10.1145/361002.361007. S2CID 13091446.
Bentley, Jon (1980). "Multidimensional divide-and-conquer". Communications of the ACM. 23 (4): 214–229. doi:10.1145/358841.358850. S2CID 3997186.
Mehlhorn, Kurt; Näher, Stefan (1990). "Dynamic fractional cascading" (PDF). Algorithmica. 5 (2): 215–241. doi:10.1007/BF01840386. S2CID 7721690.

uni-saarland.de (Global: low place; English: low place)

publikationen.sulb.uni-saarland.de

Mehlhorn, Kurt; Näher, Stefan (1990). "Dynamic fractional cascading" (PDF). Algorithmica. 5 (2): 215–241. doi:10.1007/BF01840386. S2CID 7721690.

Range searching (English Wikipedia)

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

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

hdl.handle.net (Global: 66th place; English: 34th place)

illinois.edu (Global: 1,178th place; English: 745th place)