Trie (English Wikipedia)

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

Last modified: 02:27:45, 1 June 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

2616doi.org

2^nd place

126web.archive.org

1^st place

119semanticscholar.org

15^th place

8^th place

72acm.org

1,200^th place

821^st place

61princeton.edu

802^nd place

528^th place

53adsabs.harvard.edu

14^th place

9^th place

52sciencedirect.com

137^th place

146^th place

51tug.org

low place

51oup.com

292^nd place

233^rd place

42springer.com

182^nd place

172^nd place

42worldcat.org

4^th place

41cambridge.org

209^th place

151^st place

32nist.gov

708^th place

742^nd place

31hdl.handle.net

66^th place

34^th place

22arxiv.org

49^th place

31^st place

21cvr.ac.uk

low place

11archive.org

6^th place

11rutgers.edu

2,011^th place

1,139^th place

11ghostarchive.org

64^th place

28^th place

11syr.edu

1,643^rd place

794^th place

11ufl.edu

880^th place

578^th place

11routledge.com

2,583^rd place

1,549^th place

11mit.edu

476^th place

340^th place

11helsinki.fi

1,384^th place

2,463^rd place

11uzh.ch

1,380^th place

1,488^th place

11unimelb.edu.au

3,366^th place

2,021^st place

11siam.org

9,070^th place

5,832^nd place

acm.org (Global: 1,200^th place; English: 821^st place)

dl.acm.org

Gonnet, G. H.; Yates, R. Baeza (January 1991). Handbook of algorithms and data structures: in Pascal and C (2 ed.). Boston, United States: Addison-Wesley. ISBN 978-0-201-41607-7.
Transier, Frederik; Sanders, Peter (December 2010). "Engineering basic algorithms of an in-memory text search engine". ACM Transactions on Information Systems. 29 (1). Association for Computing Machinery: 1–37. doi:10.1145/1877766.1877768. S2CID 932749.

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

ui.adsabs.harvard.edu

Jan Daciuk; Stoyan Mihov; Bruce W. Watson; Richard E. Watson (1 March 2000). "Incremental Construction of Minimal Acyclic Finite-State Automata". Computational Linguistics. 26 (1). MIT Press: 3–16. arXiv:cs/0007009. Bibcode:2000cs........7009D. doi:10.1162/089120100561601.
Crochemore, Maxime; Lecroq, Thierry (2009). "Trie". Encyclopedia of Database Systems. Boston, United States: Springer Publishing. Bibcode:2009eds..book.....L. doi:10.1007/978-0-387-39940-9. ISBN 978-0-387-49616-0 – via HAL (open archive).
Yang, Lai; Xu, Lida; Shi, Zhongzhi (23 March 2012). "An enhanced dynamic hash TRIE algorithm for lexicon search". Enterprise Information Systems. 6 (4): 419–432. Bibcode:2012EntIS...6..419Y. doi:10.1080/17517575.2012.665483. S2CID 37884057.

archive.org (Global: 6^th place; English: 6^th place)

Thue, Axel (1912). "Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen". Skrifter Udgivne Af Videnskabs-Selskabet I Christiania. 1912 (1): 1–67. Cited by Knuth.

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

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. pp. 302:302–302:309. arXiv:1704.02272. doi:10.1145/2659651.2659723. ISBN 978-1-4503-3033-6. S2CID 12943246.
Jan Daciuk; Stoyan Mihov; Bruce W. Watson; Richard E. Watson (1 March 2000). "Incremental Construction of Minimal Acyclic Finite-State Automata". Computational Linguistics. 26 (1). MIT Press: 3–16. arXiv:cs/0007009. Bibcode:2000cs........7009D. doi:10.1162/089120100561601.

cambridge.org (Global: 209^th place; English: 151^st place)

Brass, Peter (8 September 2008). Advanced Data Structures. UK: Cambridge University Press. doi:10.1017/CBO9780511800191. ISBN 978-0521880374.

cvr.ac.uk (Global: low place; English: low place)

bioinformatics.cvr.ac.uk

Maabar, Maha (17 November 2014). "Trie Data Structure". CVR, University of Glasgow. Archived from the original on 27 January 2021. Retrieved 17 April 2022.

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

de la Briandais, René (1959). File searching using variable length keys (PDF). Proc. Western J. Computer Conf. pp. 295–298. doi:10.1145/1457838.1457895. S2CID 10963780. Archived from the original (PDF) on 2020-02-11. Cited by Brass and by Knuth.
Brass, Peter (8 September 2008). Advanced Data Structures. UK: Cambridge University Press. doi:10.1017/CBO9780511800191. ISBN 978-0521880374.
Edward Fredkin (1960). "Trie Memory". Communications of the ACM. 3 (9): 490–499. doi:10.1145/367390.367400. S2CID 15384533.
Connelly, Richard H.; Morris, F. Lockwood (1993). "A generalization of the trie data structure". Mathematical Structures in Computer Science. 5 (3). Syracuse University: 381–418. doi:10.1017/S0960129500000803. S2CID 18747244.
Aho, Alfred V.; Corasick, Margaret J. (Jun 1975). "Efficient String Matching: An Aid to Bibliographic Search". Communications of the ACM. 18 (6): 333–340. doi:10.1145/360825.360855. S2CID 207735784.
Daciuk, Jan (24 June 2003). Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings. International Conference on Implementation and Application of Automata. Springer Publishing. pp. 255–261. doi:10.1007/3-540-44977-9_26. ISBN 978-3-540-40391-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. pp. 302:302–302:309. arXiv:1704.02272. doi:10.1145/2659651.2659723. ISBN 978-1-4503-3033-6. S2CID 12943246.
Willar, Dan E. (27 January 1983). "Log-logarithmic worst-case range queries are possible in space O(n)". Information Processing Letters. 17 (2): 81–84. doi:10.1016/0020-0190(83)90075-3.
Jan Daciuk; Stoyan Mihov; Bruce W. Watson; Richard E. Watson (1 March 2000). "Incremental Construction of Minimal Acyclic Finite-State Automata". Computational Linguistics. 26 (1). MIT Press: 3–16. arXiv:cs/0007009. Bibcode:2000cs........7009D. doi:10.1162/089120100561601.
Crochemore, Maxime; Lecroq, Thierry (2009). "Trie". Encyclopedia of Database Systems. Boston, United States: Springer Publishing. Bibcode:2009eds..book.....L. doi:10.1007/978-0-387-39940-9. ISBN 978-0-387-49616-0 – via HAL (open archive).
Martinez-Prieto, Miguel A.; Brisaboa, Nieves; Canovas, Rodrigo; Claude, Francisco; Navarro, Gonzalo (March 2016). "Practical compressed string dictionaries". Information Systems. 56. Elsevier: 73–108. doi:10.1016/j.is.2015.08.008. hdl:10533/147675. ISSN 0306-4379.
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. S2CID 3184411.
J. Kärkkäinen and T. Rantala (2008). "Engineering Radix Sort for Strings". In A. Amir and A. Turpin and A. Moffat (ed.). String Processing and Information Retrieval, Proc. SPIRE. Lecture Notes in Computer Science. Vol. 5280. Springer. pp. 3–14. doi:10.1007/978-3-540-89097-3_3. ISBN 978-3-540-89096-6.
Giancarlo, Raffaele (28 May 1992). "A Generalization of the Suffix Tree to Square Matrices, with Applications". SIAM Journal on Computing. 24 (3). Society for Industrial and Applied Mathematics: 520–562. doi:10.1137/S0097539792231982. ISSN 0097-5397.
Yang, Lai; Xu, Lida; Shi, Zhongzhi (23 March 2012). "An enhanced dynamic hash TRIE algorithm for lexicon search". Enterprise Information Systems. 6 (4): 419–432. Bibcode:2012EntIS...6..419Y. doi:10.1080/17517575.2012.665483. S2CID 37884057.
Transier, Frederik; Sanders, Peter (December 2010). "Engineering basic algorithms of an in-memory text search engine". ACM Transactions on Information Systems. 29 (1). Association for Computing Machinery: 1–37. doi:10.1145/1877766.1877768. S2CID 932749.

ghostarchive.org (Global: 64^th place; English: 28^th place)

"Trie". School of Arts and Science, Rutgers University. 2022. Archived from the original on 17 April 2022. Retrieved 17 April 2022.

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

Martinez-Prieto, Miguel A.; Brisaboa, Nieves; Canovas, Rodrigo; Claude, Francisco; Navarro, Gonzalo (March 2016). "Practical compressed string dictionaries". Information Systems. 56. Elsevier: 73–108. doi:10.1016/j.is.2015.08.008. hdl:10533/147675. ISSN 0306-4379.

helsinki.fi (Global: 1,384^th place; English: 2,463^rd place)

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.

mit.edu (Global: 476^th place; English: 340^th place)

direct.mit.edu

Jan Daciuk; Stoyan Mihov; Bruce W. Watson; Richard E. Watson (1 March 2000). "Incremental Construction of Minimal Acyclic Finite-State Automata". Computational Linguistics. 26 (1). MIT Press: 3–16. arXiv:cs/0007009. Bibcode:2000cs........7009D. doi:10.1162/089120100561601.

nist.gov (Global: 708^th place; English: 742^nd place)

xlinux.nist.gov

Black, Paul E. (2009-11-16). "trie". Dictionary of Algorithms and Data Structures. National Institute of Standards and Technology. Archived from the original on 2011-04-29.
"Patricia tree". National Institute of Standards and Technology. Archived from the original on 14 February 2022. Retrieved 17 April 2022.

oup.com (Global: 292^nd place; English: 233^rd place)

global.oup.com

Thareja, Reema (13 October 2018). "Hashing and Collision". Data Structures Using C (2 ed.). Oxford University Press. ISBN 9780198099307.

princeton.edu (Global: 802^nd place; English: 528^th place)

algs4.cs.princeton.edu

Sedgewick, Robert; Wayne, Kevin (3 April 2011). Algorithms (4 ed.). Addison-Wesley, Princeton University. ISBN 978-0321573513.

routledge.com (Global: 2,583^rd place; English: 1,549^th place)

Mehta, Dinesh P.; Sahni, Sartaj (7 March 2018). "Tries". Handbook of Data Structures and Applications (2 ed.). Chapman & Hall, University of Florida. ISBN 978-1498701853.

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

ds.cs.rutgers.edu

"Trie". School of Arts and Science, Rutgers University. 2022. Archived from the original on 17 April 2022. Retrieved 17 April 2022.

sciencedirect.com (Global: 137^th place; English: 146^th place)

Willar, Dan E. (27 January 1983). "Log-logarithmic worst-case range queries are possible in space O(n)". Information Processing Letters. 17 (2): 81–84. doi:10.1016/0020-0190(83)90075-3.
Martinez-Prieto, Miguel A.; Brisaboa, Nieves; Canovas, Rodrigo; Claude, Francisco; Navarro, Gonzalo (March 2016). "Practical compressed string dictionaries". Information Systems. 56. Elsevier: 73–108. doi:10.1016/j.is.2015.08.008. hdl:10533/147675. ISSN 0306-4379.

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

api.semanticscholar.org

de la Briandais, René (1959). File searching using variable length keys (PDF). Proc. Western J. Computer Conf. pp. 295–298. doi:10.1145/1457838.1457895. S2CID 10963780. Archived from the original (PDF) on 2020-02-11. Cited by Brass and by Knuth.
Edward Fredkin (1960). "Trie Memory". Communications of the ACM. 3 (9): 490–499. doi:10.1145/367390.367400. S2CID 15384533.
Connelly, Richard H.; Morris, F. Lockwood (1993). "A generalization of the trie data structure". Mathematical Structures in Computer Science. 5 (3). Syracuse University: 381–418. doi:10.1017/S0960129500000803. S2CID 18747244.
Aho, Alfred V.; Corasick, Margaret J. (Jun 1975). "Efficient String Matching: An Aid to Bibliographic Search". Communications of the ACM. 18 (6): 333–340. doi:10.1145/360825.360855. S2CID 207735784.
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. pp. 302:302–302:309. arXiv:1704.02272. doi:10.1145/2659651.2659723. ISBN 978-1-4503-3033-6. S2CID 12943246.
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. S2CID 3184411.
Yang, Lai; Xu, Lida; Shi, Zhongzhi (23 March 2012). "An enhanced dynamic hash TRIE algorithm for lexicon search". Enterprise Information Systems. 6 (4): 419–432. Bibcode:2012EntIS...6..419Y. doi:10.1080/17517575.2012.665483. S2CID 37884057.
Transier, Frederik; Sanders, Peter (December 2010). "Engineering basic algorithms of an in-memory text search engine". ACM Transactions on Information Systems. 29 (1). Association for Computing Machinery: 1–37. doi:10.1145/1877766.1877768. S2CID 932749.

pdfs.semanticscholar.org

de la Briandais, René (1959). File searching using variable length keys (PDF). Proc. Western J. Computer Conf. pp. 295–298. doi:10.1145/1457838.1457895. S2CID 10963780. Archived from the original (PDF) on 2020-02-11. Cited by Brass and by Knuth.

siam.org (Global: 9,070^th place; English: 5,832^nd place)

epubs.siam.org

Giancarlo, Raffaele (28 May 1992). "A Generalization of the Suffix Tree to Square Matrices, with Applications". SIAM Journal on Computing. 24 (3). Society for Industrial and Applied Mathematics: 520–562. doi:10.1137/S0097539792231982. ISSN 0097-5397.

springer.com (Global: 182^nd place; English: 172^nd place)

link.springer.com

Daciuk, Jan (24 June 2003). Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings. International Conference on Implementation and Application of Automata. Springer Publishing. pp. 255–261. doi:10.1007/3-540-44977-9_26. ISBN 978-3-540-40391-3.
Crochemore, Maxime; Lecroq, Thierry (2009). "Trie". Encyclopedia of Database Systems. Boston, United States: Springer Publishing. Bibcode:2009eds..book.....L. doi:10.1007/978-0-387-39940-9. ISBN 978-0-387-49616-0 – via HAL (open archive).

syr.edu (Global: 1,643^rd place; English: 794^th place)

surface.syr.edu

Connelly, Richard H.; Morris, F. Lockwood (1993). "A generalization of the trie data structure". Mathematical Structures in Computer Science. 5 (3). Syracuse University: 381–418. doi:10.1017/S0960129500000803. S2CID 18747244.

tug.org (Global: low place; English: low place)

Franklin Mark Liang (1983). Word Hy-phen-a-tion By Com-put-er (PDF) (Doctor of Philosophy thesis). Stanford University. Archived (PDF) from the original on 2005-11-11. Retrieved 2010-03-28.

ufl.edu (Global: 880^th place; English: 578^th place)

cise.ufl.edu

Sartaj Sahni (2004). "Data Structures, Algorithms, & Applications in C++: Tries". University of Florida. Archived from the original on 3 July 2016. Retrieved 17 April 2022.

unimelb.edu.au (Global: 3,366^th place; English: 2,021^st place)

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. S2CID 3184411.

uzh.ch (Global: 1,380^th place; English: 1,488^th place)

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 (Global: 1^st place; English: 1^st place)

Maabar, Maha (17 November 2014). "Trie Data Structure". CVR, University of Glasgow. Archived from the original on 27 January 2021. Retrieved 17 April 2022.
de la Briandais, René (1959). File searching using variable length keys (PDF). Proc. Western J. Computer Conf. pp. 295–298. doi:10.1145/1457838.1457895. S2CID 10963780. Archived from the original (PDF) on 2020-02-11. Cited by Brass and by Knuth.
Black, Paul E. (2009-11-16). "trie". Dictionary of Algorithms and Data Structures. National Institute of Standards and Technology. Archived from the original on 2011-04-29.
Franklin Mark Liang (1983). Word Hy-phen-a-tion By Com-put-er (PDF) (Doctor of Philosophy thesis). Stanford University. Archived (PDF) from the original on 2005-11-11. Retrieved 2010-03-28.
Sartaj Sahni (2004). "Data Structures, Algorithms, & Applications in C++: Tries". University of Florida. Archived from the original on 3 July 2016. Retrieved 17 April 2022.
"Patricia tree". National Institute of Standards and Technology. Archived from the original on 14 February 2022. Retrieved 17 April 2022.

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

search.worldcat.org

Martinez-Prieto, Miguel A.; Brisaboa, Nieves; Canovas, Rodrigo; Claude, Francisco; Navarro, Gonzalo (March 2016). "Practical compressed string dictionaries". Information Systems. 56. Elsevier: 73–108. doi:10.1016/j.is.2015.08.008. hdl:10533/147675. ISSN 0306-4379.
Giancarlo, Raffaele (28 May 1992). "A Generalization of the Suffix Tree to Square Matrices, with Applications". SIAM Journal on Computing. 24 (3). Society for Industrial and Applied Mathematics: 520–562. doi:10.1137/S0097539792231982. ISSN 0097-5397.

Trie (English Wikipedia)

acm.org (Global: 1,200th place; English: 821st place)

dl.acm.org

adsabs.harvard.edu (Global: 14th place; English: 9th place)

ui.adsabs.harvard.edu

archive.org (Global: 6th place; English: 6th place)

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

cambridge.org (Global: 209th place; English: 151st place)

cvr.ac.uk (Global: low place; English: low place)

bioinformatics.cvr.ac.uk

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

ghostarchive.org (Global: 64th place; English: 28th place)

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

helsinki.fi (Global: 1,384th place; English: 2,463rd place)