트라이 (컴퓨팅) (Korean Wikipedia)

Analysis of information sources in references of the Wikipedia article "트라이 (컴퓨팅)" in Korean language version.

refsWebsite

Global rank Korean rank

6doi.org

2^nd place

3^rd place

3web.archive.org

1^st place

2unimelb.edu.au

3,221^st place

8,254^th place

2arxiv.org

69^th place

54^th place

1nist.gov

355^th place

172^nd place

1ddj.com

low place

2,095^th place

1semanticscholar.org

11^th place

310^th place

1princeton.edu

741^st place

281^st place

1helsinki.fi

1,670^th place

3,904^th place

1uzh.ch

3,633^rd place

7,734^th place

1allisons.org

low place

1ufl.edu

921^st place

1,075^th place

1oswego.edu

low place

1pg.gda.pl

low place

1mitpressjournals.org

low place

2,475^th place

1aclweb.org

low place

1worldcat.org

5^th place

11^th place

aclweb.org

Ulrich Germann; Eric Joanis; Samuel Larkin (2009). “Tightly packed tries: how to fit large models into memory, and make them load fast, too” (PDF). 《ACL Workshops: Proceedings of the Workshop on Software Engineering, Testing, and Quality Assurance for Natural Language Processing》. Association for Computational Linguistics. 31–39쪽. We present Tightly Packed Tries (TPTs), a compact implementation of read-only, compressed trie structures with fast on-demand paging and short load times. We demonstrate the benefits of TPTs for storing n-gram back-off language models and phrase tables for statistical machine translation. Encoded as TPTs, these databases require less space than flat text file representations of the same data compressed with the gzip utility. At the same time, they can be mapped into memory quickly and be searched directly in time linear in the length of the key, without the need to decompress the entire file. The overhead for local decompression during search is marginal.

allisons.org

Allison, Lloyd. “Tries”. 2014년 2월 18일에 확인함.

arxiv.org

Bellekens, Xavier (2014). 〈A Highly-Efficient Memory-Compression Scheme for GPU-Accelerated Intrusion Detection Systems〉. 《Proceedings of the 7th International Conference on Security of Information and Networks - SIN '14》. Glasgow, Scotland, UK: ACM. 302:302–302:309쪽. arXiv:1704.02272. doi:10.1145/2659651.2659723. ISBN 978-1-4503-3033-6.
Jan Daciuk; Stoyan Mihov; Bruce W. Watson; Richard E. Watson (2000). “Incremental Construction of Minimal Acyclic Finite-State Automata”. 《Computational Linguistics》 (Association for Computational Linguistics) 26: 3–16. arXiv:cs/0007009. doi:10.1162/089120100561601. 2011년 9월 30일에 원본 문서에서 보존된 문서. 2009년 5월 28일에 확인함. This paper presents a method for direct building of minimal acyclic finite states automaton which recognizes a given finite list of words in lexicographical order. Our approach is to construct a minimal automaton in a single phase by adding new strings one by one and minimizing the resulting automaton on-the-fly Alt URL

ddj.com

Bentley, Jon; Sedgewick, Robert (1998년 4월 1일). “Ternary Search Trees”. 《Dr. Dobb's Journal》 (Dr Dobb's). 2008년 6월 23일에 원본 문서에서 보존된 문서.

doi.org

dx.doi.org

Edward Fredkin (1960). “Trie Memory”. 《Communications of the ACM》 3 (9): 490–499. doi:10.1145/367390.367400.
Aho, Alfred V.; Corasick, Margaret J. (Jun 1975). “Efficient String Matching: An Aid to Bibliographic Search” (PDF). 《Communications of the ACM》 18 (6): 333–340. doi:10.1145/360825.360855.
Ranjan Sinha and Justin Zobel and David Ring (Feb 2006). “Cache-Efficient String Sorting Using Copying” (PDF). 《ACM Journal of Experimental Algorithmics》 11: 1–32. doi:10.1145/1187436.1187439.
J. Kärkkäinen and T. Rantala (2008). 〈Engineering Radix Sort for Strings〉. A. Amir and A. Turpin and A. Moffat. 《String Processing and Information Retrieval, Proc. SPIRE》. Lecture Notes in Computer Science 5280. Springer. 3–14쪽. doi:10.1007/978-3-540-89097-3_3.
Bellekens, Xavier (2014). 〈A Highly-Efficient Memory-Compression Scheme for GPU-Accelerated Intrusion Detection Systems〉. 《Proceedings of the 7th International Conference on Security of Information and Networks - SIN '14》. Glasgow, Scotland, UK: ACM. 302:302–302:309쪽. arXiv:1704.02272. doi:10.1145/2659651.2659723. ISBN 978-1-4503-3033-6.
Jan Daciuk; Stoyan Mihov; Bruce W. Watson; Richard E. Watson (2000). “Incremental Construction of Minimal Acyclic Finite-State Automata”. 《Computational Linguistics》 (Association for Computational Linguistics) 26: 3–16. arXiv:cs/0007009. doi:10.1162/089120100561601. 2011년 9월 30일에 원본 문서에서 보존된 문서. 2009년 5월 28일에 확인함. This paper presents a method for direct building of minimal acyclic finite states automaton which recognizes a given finite list of words in lexicographical order. Our approach is to construct a minimal automaton in a single phase by adding new strings one by one and minimizing the resulting automaton on-the-fly Alt URL

helsinki.fi

cs.helsinki.fi

Kärkkäinen, Juha. “Lecture 2” (PDF). University of Helsinki. The preorder of the nodes in a trie is the same as the lexicographical order of the strings they represent assuming the children of a node are ordered by the edge labels.

mitpressjournals.org

Jan Daciuk; Stoyan Mihov; Bruce W. Watson; Richard E. Watson (2000). “Incremental Construction of Minimal Acyclic Finite-State Automata”. 《Computational Linguistics》 (Association for Computational Linguistics) 26: 3–16. arXiv:cs/0007009. doi:10.1162/089120100561601. 2011년 9월 30일에 원본 문서에서 보존된 문서. 2009년 5월 28일에 확인함. This paper presents a method for direct building of minimal acyclic finite states automaton which recognizes a given finite list of words in lexicographical order. Our approach is to construct a minimal automaton in a single phase by adding new strings one by one and minimizing the resulting automaton on-the-fly Alt URL

nist.gov

xlinux.nist.gov

Black, Paul E. (2009년 11월 16일). “trie”. 《Dictionary of Algorithms and Data Structures》. National Institute of Standards and Technology. 2011년 4월 29일에 원본 문서에서 보존된 문서.

oswego.edu

gee.cs.oswego.edu

Lee, Doug. “A Memory Allocator”. 2019년 12월 1일에 확인함. HTTP for Source Code. Binary Trie is described in Version 2.8.6, Section "Overlaid data structures", Structure "malloc_tree_chunk".

pg.gda.pl

Jan Daciuk; Stoyan Mihov; Bruce W. Watson; Richard E. Watson (2000). “Incremental Construction of Minimal Acyclic Finite-State Automata”. 《Computational Linguistics》 (Association for Computational Linguistics) 26: 3–16. arXiv:cs/0007009. doi:10.1162/089120100561601. 2011년 9월 30일에 원본 문서에서 보존된 문서. 2009년 5월 28일에 확인함. This paper presents a method for direct building of minimal acyclic finite states automaton which recognizes a given finite list of words in lexicographical order. Our approach is to construct a minimal automaton in a single phase by adding new strings one by one and minimizing the resulting automaton on-the-fly Alt URL

princeton.edu

algs4.cs.princeton.edu

Sedgewick, Robert; Wayne, Kevin (2020년 6월 12일). “Tries”. 《algs4.cs.princeton.edu》. 2020년 8월 11일에 확인함.

semanticscholar.org

pdfs.semanticscholar.org

Aho, Alfred V.; Corasick, Margaret J. (Jun 1975). “Efficient String Matching: An Aid to Bibliographic Search” (PDF). 《Communications of the ACM》 18 (6): 333–340. doi:10.1145/360825.360855.

ufl.edu

cise.ufl.edu

Sahni, Sartaj. “Tries”. 《Data Structures, Algorithms, & Applications in Java》. University of Florida. 2014년 2월 18일에 확인함.

unimelb.edu.au

people.eng.unimelb.edu.au

Ranjan Sinha and Justin Zobel and David Ring (Feb 2006). “Cache-Efficient String Sorting Using Copying” (PDF). 《ACM Journal of Experimental Algorithmics》 11: 1–32. doi:10.1145/1187436.1187439.
Askitis, Nikolas; Zobel, Justin (2008). “B-tries for Disk-based String Management” (PDF). 《VLDB Journal》: 1–26. ISSN 1066-8888.

uzh.ch

ifi.uzh.ch

Kallis, Rafael (2018). “The Adaptive Radix Tree (Report #14-708-887)” (PDF). 《University of Zurich: Department of Informatics, Research Publications》.

web.archive.org

Black, Paul E. (2009년 11월 16일). “trie”. 《Dictionary of Algorithms and Data Structures》. National Institute of Standards and Technology. 2011년 4월 29일에 원본 문서에서 보존된 문서.
Bentley, Jon; Sedgewick, Robert (1998년 4월 1일). “Ternary Search Trees”. 《Dr. Dobb's Journal》 (Dr Dobb's). 2008년 6월 23일에 원본 문서에서 보존된 문서.
Jan Daciuk; Stoyan Mihov; Bruce W. Watson; Richard E. Watson (2000). “Incremental Construction of Minimal Acyclic Finite-State Automata”. 《Computational Linguistics》 (Association for Computational Linguistics) 26: 3–16. arXiv:cs/0007009. doi:10.1162/089120100561601. 2011년 9월 30일에 원본 문서에서 보존된 문서. 2009년 5월 28일에 확인함. This paper presents a method for direct building of minimal acyclic finite states automaton which recognizes a given finite list of words in lexicographical order. Our approach is to construct a minimal automaton in a single phase by adding new strings one by one and minimizing the resulting automaton on-the-fly Alt URL

worldcat.org

Askitis, Nikolas; Zobel, Justin (2008). “B-tries for Disk-based String Management” (PDF). 《VLDB Journal》: 1–26. ISSN 1066-8888.