Algoritmo de memória externa (Portuguese Wikipedia)
Analysis of information sources in references of the Wikipedia article "Algoritmo de memória externa" in Portuguese language version.
refsWebsite
Global rank
Portuguese rank
3rd place
6th place
low place
low place
books.google.com
- NASA SP. [S.l.]: NASA. 1962
- Computers in Crisis. [S.l.]: ACM. 1971
doi.org
dx.doi.org
- Vitter, J. S. (2001). «External Memory Algorithms and Data Structures: Dealing with MASSIVE DATA». ACM Computing Surveys. 33 (2): 209–271. CiteSeerX 10.1.1.42.7064
. doi:10.1145/384192.384193 - Vitter, J. S. (2008). Algorithms and Data Structures for External Memory (PDF). Col: Series on Foundations and Trends in Theoretical Computer Science. 2. Hanover, MA: Now Publishers. pp. 305–474. ISBN 978-1-60198-106-6. doi:10.1561/0400000014
- Tsotras, Vassilis J.; Levialdi, Stefano; Grinstein, Georges; Berry, Damon Andrew; Gouet-Brunet, Valerie; Kosch, Harald; Döller, Mario; Döller, Mario (2009). Encyclopedia of Database Systems. Springer Science+Business Media. pp. 1333–1334. ISBN 978-0-387-35544-3. doi:10.1007/978-0-387-39940-9_752 Faltam os
|sobrenomes1=em Authors list (ajuda) - Aggarwal, Alok; Vitter, Jeffrey (1988). «The input/output complexity of sorting and related problems». Communications of the ACM. 31 (9): 1116–1127. doi:10.1145/48529.48535
erikdemaine.org
- Demaine, Erik (2002). Cache-Oblivious Algorithms and Data Structures (PDF). Lecture Notes from the EEF Summer School on Massive Data Sets. Aarhus: BRICS
inria.fr
hal.inria.fr
- Aggarwal, Alok; Vitter, Jeffrey (1988). «The input/output complexity of sorting and related problems». Communications of the ACM. 31 (9): 1116–1127. doi:10.1145/48529.48535
ku.edu
ittc.ku.edu
- Vitter, J. S. (2008). Algorithms and Data Structures for External Memory (PDF). Col: Series on Foundations and Trends in Theoretical Computer Science. 2. Hanover, MA: Now Publishers. pp. 305–474. ISBN 978-1-60198-106-6. doi:10.1561/0400000014
psu.edu
citeseerx.ist.psu.edu
- Vitter, J. S. (2001). «External Memory Algorithms and Data Structures: Dealing with MASSIVE DATA». ACM Computing Surveys. 33 (2): 209–271. CiteSeerX 10.1.1.42.7064. doi:10.1145/384192.384193