Καμπύλη Z-τάξης (Greek Wikipedia)

Analysis of information sources in references of the Wikipedia article "Καμπύλη Z-τάξης" in Greek language version.

refsWebsite

Global rank Greek rank

5wikipedia.org

low place

3doi.org

2^nd place

3^rd place

3vision-tools.com

low place

2acm.org

1,185^th place

1,817^th place

1opengeospatial.org

low place

1ibm.com

1,131^st place

1,957^th place

1illinois.edu

1,349^th place

1,975^th place

1ntua.gr

low place

101^st place

1compgeom.com

low place

1au.dk

8,222^nd place

7,551^st place

1tum.de

7,448^th place

low place

1s2geometry.io

low place

1vt.edu

2,431^st place

4,929^th place

1wiley.com

222^nd place

225^th place

1ucsb.edu

1,115^th place

2,626^th place

1univie.ac.at

2,529^th place

3,720^th place

acm.org

portal.acm.org

Warren, M. S.; Salmon, J. K. (1993), «A parallel hashed Oct-Tree N-body algorithm», Proceedings of the 1993 ACM/IEEE conference on Supercomputing - Supercomputing '93, Portland, Oregon, United States: ACM Press, σελ. 12–21, doi:10.1145/169627.169640, ISBN 978-0-8186-4340-8, http://portal.acm.org/citation.cfm?doid=169627.169640

dl.acm.org

https://dl.acm.org/doi/pdf/10.1145/280277.280279 Volker Gaede, Oliver Günther: Multidimensional access methods. ACM Computing Surveys volume=30 issue=2 pages=170–231 1998.

au.dk

madalgo.au.dk

Har-Peled, S. (2010), Data structures for geometric approximation, http://www.madalgo.au.dk/img/SS2010/Course%20Material/Data-Structures%20for%20Geometric%20Approximation%20by%20Sariel%20Har-Peled.pdf

compgeom.com

Connor, M.; Kumar, P (2009), «Fast construction of k-nearest neighbour graphs for point clouds», IEEE Transactions on Visualization and Computer Graphics, http://compgeom.com/~piyush/papers/tvcg_stann.pdf, ανακτήθηκε στις 2023-12-07

doi.org

dx.doi.org

Bern, M.; Eppstein, D.; Teng, S.-H. (1999), «Parallel construction of quadtrees and quality triangulations», Int. J. Comput. Geom. Appl. 9 (6): 517–532, doi:10.1142/S0218195999000303 .
Warren, M. S.; Salmon, J. K. (1993), «A parallel hashed Oct-Tree N-body algorithm», Proceedings of the 1993 ACM/IEEE conference on Supercomputing - Supercomputing '93, Portland, Oregon, United States: ACM Press, σελ. 12–21, doi:10.1145/169627.169640, ISBN 978-0-8186-4340-8, http://portal.acm.org/citation.cfm?doid=169627.169640
Gargantini, I. (1982), «An effective way to represent quadtrees», Communications of the ACM 25 (12): 905–910, doi:10.1145/358728.358741 .

ibm.com

domino.research.ibm.com

Morton, G. M. (1966), A computer Oriented Geodetic Data Base; and a New Technique in File Sequencing, Technical Report, Ottawa, Canada: IBM Ltd., https://domino.research.ibm.com/library/cyberdig.nsf/papers/0DABF9473B9C86D48525779800566A39/$File/Morton1966.pdf

illinois.edu

tmc.web.engr.illinois.edu

Chan, T. (2002), «Closest-point problems simplified on the RAM», ACM-SIAM Symposium on Discrete Algorithms, http://tmc.web.engr.illinois.edu/ram_soda.ps .

ntua.gr

itia.ntua.gr

Κολαΐτης, Μ. (1976). Αγγλοελληνικόν Λεξικόν των Θεωρητικών και Εφηρμοσμένων Μαθηματικών. ΤΕΕ.

opengeospatial.org

portal.opengeospatial.org

Discrete Global Grid Systems Abstract Specification, Open Geospatial Consortium, 2017, https://portal.opengeospatial.org/files/15-104r5#.pdf

s2geometry.io

S2 Geometry, https://s2geometry.io/, ανακτήθηκε στις 2023-12-07

tum.de

mistral.in.tum.de

Ramsak, Frank; Markl, Volker; Fenk, Robert; Zirkel, Martin; Elhardt, Klaus; Bayer, Rudolf (2000), «Integrating the UB-tree into a Database System Kernel», Int. Conf. on Very Large Databases (VLDB), σελ. 263–272, http://www.mistral.in.tum.de/results/publications/RMF+00.pdf

ucsb.edu

gauss.cs.ucsb.edu

Buluç, Aydın; Fineman, Jeremy T.; Frigo, Matteo; Gilbert, John R.; Leiserson, Charles E. (2009), «Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks», ACM Symp. on Parallelism in Algorithms and Architectures, http://gauss.cs.ucsb.edu/~aydin/csb2009.pdf, ανακτήθηκε στις 2023-12-07

univie.ac.at

utheses.univie.ac.at

Martin Perdacher: Space-filling curves for improved cache-locality in shared memory environments. PhD thesis, University of Vienna 2020

vision-tools.com

vt.edu

people.cs.vt.edu

Vinod Valsalam, Anthony Skjellum: A framework for high-performance matrix multiplication based on hierarchical abstractions, algorithms and optimized low-level kernels. Concurrency and Computation: Practice and Experience 14(10): 805-839 (2002)[1][2]

wikipedia.org

en.wikipedia.org

Discrete Global Grid Systems Abstract Specification, Open Geospatial Consortium, 2017, https://portal.opengeospatial.org/files/15-104r5#.pdf
Bern, M.; Eppstein, D.; Teng, S.-H. (1999), «Parallel construction of quadtrees and quality triangulations», Int. J. Comput. Geom. Appl. 9 (6): 517–532, doi:10.1142/S0218195999000303 .
Gargantini, I. (1982), «An effective way to represent quadtrees», Communications of the ACM 25 (12): 905–910, doi:10.1145/358728.358741 .
Har-Peled, S. (2010), Data structures for geometric approximation, http://www.madalgo.au.dk/img/SS2010/Course%20Material/Data-Structures%20for%20Geometric%20Approximation%20by%20Sariel%20Har-Peled.pdf
Buluç, Aydın; Fineman, Jeremy T.; Frigo, Matteo; Gilbert, John R.; Leiserson, Charles E. (2009), «Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks», ACM Symp. on Parallelism in Algorithms and Architectures, http://gauss.cs.ucsb.edu/~aydin/csb2009.pdf, ανακτήθηκε στις 2023-12-07

wiley.com

onlinelibrary.wiley.com

Vinod Valsalam, Anthony Skjellum: A framework for high-performance matrix multiplication based on hierarchical abstractions, algorithms and optimized low-level kernels. Concurrency and Computation: Practice and Experience 14(10): 805-839 (2002)[1][2]