The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for Tries with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1976-1982 (16) 1983-1987 (18) 1988-1989 (24) 1990 (21) 1991-1992 (25) 1993-1994 (26) 1995 (16) 1996 (24) 1997 (22) 1998 (27) 1999 (46) 2000 (99) 2001 (96) 2002 (112) 2003 (145) 2004 (183) 2005 (261) 2006 (278) 2007 (295) 2008 (274) 2009 (181) 2010 (39) 2011-2012 (17) 2013-2014 (15) 2015 (15) 2016-2017 (21) 2018-2019 (17) 2020-2021 (17) 2022-2024 (11)
Publication types (Num. hits)
article(401) incollection(10) inproceedings(1928) phdthesis(2)
Venues (Conferences, Journals, ...)
CoRR(35) IPDPS(19) HICSS(16) ISCC(16) DAC(14) IROS(14) GECCO(13) CIKM(12) ICRA(12) Algorithmica(11) DEXA(11) SODA(11) ICPR (2)(10) IEEE Trans. Computers(10) Theor. Comput. Sci.(10) ACM Trans. Database Syst.(9) More (+10 of total 1120)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 2318 occurrences of 1673 keywords

Results
Found 2341 publication records. Showing 2341 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
115Wencheng Lu, Sartaj Sahni Packet Classification Using Space-Efficient Pipelined Multibit Tries. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2008 DBLP  DOI  BibTeX  RDF fixed-stride tries, variable-stride tries, two-dimensional tries, dynamic programming, Packet classification, longest matching prefix, controlled prefix expansion
103Wencheng Lu, Sartaj Sahni Packet Classification Using Pipelined Two-Dimensional Multibit Tries. Search on Bibsonomy ISCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF fixed-stride tries, variable-stride tries, two-dimensional tries, dynamic programming, Packet classification, longest matching prefix, controlled prefix expansion
95Wencheng Lu, Sartaj Sahni Packet Forwarding Using Pipelined Multibit Tries. Search on Bibsonomy ISCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF fixed-stride tries, variable-stride tries, dynamic programming, Packet classification, longest matching prefix, controlled prefix expansion
83T. Srinivasan 0001, R. Balakrishnan, S. A. Gangadharan, Hayawardh Vijayakumar Supervised Grid-of-Tries: A Novel Framework for Classifier Management. Search on Bibsonomy ICDCN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF grid-of-tries, supervised grid-of-tries, routing, Packet classification
77Wencheng Lu, Sartaj Sahni Packet Classification Using Two-Dimensional Multibit Tries. Search on Bibsonomy ISCC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF two-dimensional tries, multibit tries, prefix expansion, dynamic programming, Packet classification
69Svante Janson, Wojciech Szpankowski Partial fillup and search time in LC tries. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Digital trees, level-compressed tries, partial fillup, trees, probabilistic analysis, strings, Poissonization
60Dow-Yung Yang, Akshay Johar, Ananth Grama, Wojciech Szpankowski Summary Structures for Frequency Queries on Large Transaction Sets. Search on Bibsonomy Data Compression Conference The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Frequency Queries, Patricia Tries, Compressed Tries, Compression, Transactions, Tries, Frequent Sets
55Yuriy A. Reznik Some Results on Tries with Adaptive Branching. Search on Bibsonomy COCOON The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
53Robert W. P. Luk Time-Space Trade-Off Analysis of Morphic Trie Images. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
52Venkatachary Srinivasan, George Varghese Fast Address Lookups Using Controlled Prefix Expansion. Search on Bibsonomy ACM Trans. Comput. Syst. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Internet address lookup, binary search on levels, expanded tries, multibit tries, router preformance, longest-prefix match, controlled prefix expansion
51Steffen Heinz, Justin Zobel, Hugh E. Williams Burst tries: a fast, efficient data structure for string keys. Search on Bibsonomy ACM Trans. Inf. Syst. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF string data structures, vocabulary accumulation, Binary trees, text databases, tries, splay trees
49Luc Devroye, Gábor Lugosi, GaHyun Park, Wojciech Szpankowski Multiple choice tries and distributed hash tables. Search on Bibsonomy SODA The full citation details ... 2007 DBLP  BibTeX  RDF
45Pedro Manuel Pinto Ribeiro, Fernando M. A. Silva g-tries: an efficient data structure for discovering network motifs. Search on Bibsonomy SAC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF algorithms, data structures, complex networks, graph mining, biological networks, tries, network motifs
43Luc Devroye Random Tries. Search on Bibsonomy ISAAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
43Arne Andersson, Stefan Nilsson Faster Searching in Tries and Quadtrees - An Analysis of Level Compression. Search on Bibsonomy ESA The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
43Wojciech Szpankowski Patricia Tries Again Revisited Search on Bibsonomy J. ACM The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
40Pedro Manuel Pinto Ribeiro, Fernando M. A. Silva, Luís M. B. Lopes Efficient Parallel Subgraph Counting Using G-Tries. Search on Bibsonomy CLUSTER The full citation details ... 2010 DBLP  DOI  BibTeX  RDF G-Tries, Parallel Algorithms, Complex Networks, Graph Mining, Adaptive Load Balancing
40Marshall D. Brain, Alan L. Tharp Using Tries to Eliminate Pattern Collisions in Perfect Hashing. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF sparse matrix packing algorithm, retrieval function complexity, perfect hashing algorithms, array-based tries, Unix word list, large word lists, function building efficiency, pattern collision avoidance, ordered minimal perfect hashing function, item lists, sparse array packing, computational complexity, Unix, file organisation, ordering, list processing
39Aleksandar Prokopec Cache-tries: concurrent lock-free hash tries with constant-time operations. Search on Bibsonomy PPoPP The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
39Weitian Tong, Randy Goebel, Guohui Lin Smoothed heights of tries and patricia tries. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
39Michael Fuchs 0001, Chung-Kuei Lee A General Central Limit Theorem for Shape Parameters of $m$-ary Tries and PATRICIA Tries. Search on Bibsonomy Electron. J. Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
39Charles Knessl, Wojciech Szpankowski Heights in Generalized Tries and PATRICIA Tries. Search on Bibsonomy LATIN The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
37GaHyun Park, Wojciech Szpankowski Towards a complete characterization of tries. Search on Bibsonomy SODA The full citation details ... 2005 DBLP  BibTeX  RDF
37Sartaj Sahni, Kun Suk Kim Efficient construction of multibit tries for IP lookup. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF multibit trie, dynamic programming, packet routing, longest matching prefix, controlled prefix expansion
32Ghada Badr, B. John Oommen A novel look-ahead optimization strategy for trie-based approximate string matching. Search on Bibsonomy Pattern Anal. Appl. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Trie-based syntactic pattern recognition, Noisy syntactic recognition using tries, Branch and bound techniques, Pruning, Approximate string matching
32Lars Arge, David Eppstein, Michael T. Goodrich Skip-webs: efficient distributed data structures for multi-dimensional data sets. Search on Bibsonomy PODC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF trapezoidal maps, peer-to-peer networks, quadtrees, octrees, distributed data structures, tries, skip lists
31Andrew Matusiewicz, Neil V. Murray, Erik Rosenthal Prime Implicate Tries. Search on Bibsonomy TABLEAUX The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
31Neil V. Murray, Erik Rosenthal Reduced Implicate/Implicant Tries. Search on Bibsonomy ISMIS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
31Haoyu Song 0001, Jonathan S. Turner, John W. Lockwood Shape Shifting Tries for Faster IP Route Lookup. Search on Bibsonomy ICNP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
31Yat-Kin Lam, Qiang Huo A Data Structure Using Hashing and Tries For Efficient Chinese Lexical Access. Search on Bibsonomy ICDAR The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
31Sartaj Sahni, Kun Suk Kim Efficient Construction of Fixed-Stride Multibit Tries for IP Lookup. Search on Bibsonomy FTDCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF multibit trie, dynamic programming, Packet routing, longest matching prefix, controlled prefix expansion
29Conrado Martinez, Alois Panholzer, Helmut Prodinger Partial Match Queries in Relaxed Multidimensional Search Trees. Search on Bibsonomy Algorithmica The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
26Wencheng Lu, Sartaj Sahni Succinct representation of static packet classifiers. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF one- and two-dimensional tries, dynamic programming, packet classification, succinct representation
26David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman 0001, S. Srinivasa Rao 0001 Representing Trees of Higher Degree. Search on Bibsonomy Algorithmica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Cardinal trees, Ordinal trees, Digital search trees, Data structures, Data compression, Information theory, Hashing, Analysis of algorithms, Dictionary, Tries, Succinct data structures
26Jahangir Hasan, T. N. Vijaykumar Dynamic pipelining: making IP-lookup truly scalable. Search on Bibsonomy SIGCOMM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF scalable, pipelined, IP-lookup, longest prefix matching, tries
25 Compact Suffix Tries. Search on Bibsonomy Encyclopedia of Database Systems The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
25Erik D. Demaine, Stefan Langerman, Eric Price 0001 Confluently Persistent Tries for Efficient Version Control. Search on Bibsonomy SWAT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
25P. Suman Karthik, C. V. Jawahar Efficient Region Based Indexing and Retrieval for Images with Elastic Bucket Tries. Search on Bibsonomy ICPR (4) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
25Mickaël Gastineau, Jacques Laskar Development of TRIP: Fast Sparse Multivariate Polynomial Multiplication Using Burst Tries. Search on Bibsonomy International Conference on Computational Science (2) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
25Luc Devroye Universal Asymptotics for Random Tries and PATRICIA Trees. Search on Bibsonomy Algorithmica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
25Yuriy A. Reznik Analysis of a Class of Tries with Adaptive Multi-digit Branching. Search on Bibsonomy WADS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
25Yuriy A. Reznik, Wojciech Szpankowski Improved Behaviour of Tries by the "Symmetrization" of the Source. Search on Bibsonomy DCC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
25Sartaj Sahni, Kun Suk Kim Efficient Construction of Variable-Stride Multibit Tries for IP Lookup. Search on Bibsonomy SAINT The full citation details ... 2002 DBLP  DOI  BibTeX  RDF multibit trie, dynamic programming, Packet routing, longest matching prefix, controlled prefix expansion
25Charles Knessl A Note on the Asymptotic Behavior of the Depth of Tries. Search on Bibsonomy Algorithmica The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Digital trees, Asymptotics
25Pilar de la Torre, David T. Kao A Uniform Analysis of Trie Structures that Store Prefixing-Keys with Application to Doubly-Chained Prefixing-Tries. Search on Bibsonomy MFCS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
25Wojciech Szpankowski Average Complexity of Additive Properties for Multiway Tries: A Unified Approach (Extended Abstract). Search on Bibsonomy TAPSOFT, Vol.1 The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
23Douglas Comer Analysis of a Heuristic for Trie Minimization. Search on Bibsonomy ACM Trans. Database Syst. The full citation details ... 1981 DBLP  DOI  BibTeX  RDF trie index, trie size, heuristic
20Rajeev Raman, Venkatesh Raman 0001, Srinivasa Rao Satti Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Dictionaries, sets, perfect hashing, multisets, prefix sums, tries, succinct data structures
20B. John Oommen, Ghada Hany Badr Breadth-first search strategies for trie-based syntactic pattern recognition. Search on Bibsonomy Pattern Anal. Appl. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Trie-based syntactic pattern recognition, Noisy syntactic recognition using tries, Approximate string matching
20Nian-Feng Tzeng Routing Table Partitioning for Speedy Packet Lookups in Scalable Routers. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF line cards, prefix matching search, routing table lookups, Caches, interconnects, routers, tries, forwarding engines
20Ranjan Sinha, Justin Zobel, David Ring Cache-efficient string sorting using copying. Search on Bibsonomy ACM J. Exp. Algorithmics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF algorthims, string management, cache, Sorting, tries, experimental algorithms
20Manolis Terrovitis, Spyros Passas, Panos Vassiliadis, Timos K. Sellis A combination of trie-trees and inverted files for the indexing of set-valued attributes. Search on Bibsonomy CIKM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF HTI, containment queries, inverted files, tries
20Adam L. Buchsbaum, Glenn S. Fowler, Balachander Krishnamurthy, Kiem-Phong Vo, Jia Wang 0001 Fast prefix matching of bounded strings. Search on Bibsonomy ACM J. Exp. Algorithmics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF prefix matching, tries, table look-up, IP routing
20Torben Hagerup Sorting and Searching on the Word RAM. Search on Bibsonomy STACS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF word-level parallelism, exponential range reduction, fusion trees, exponential search trees, AC', searching, Sorting, network flow, multiplication, dictionaries, tries, word RAM, conservative algorithms
19Hideo Bannai, Keisuke Goto 0001, Shunsuke Kanda, Dominik Köppl NP-Completeness for the Space-Optimality of Double-Array Tries. Search on Bibsonomy CoRR The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
19Shunsuke Inenaga Linear-size Suffix Tries and Linear-size CDAWGs Simplified and Improved. Search on Bibsonomy CoRR The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
19Michael Fuchs 0001, Tsan-Cheng Yu Asymptotic normality for the size of graph tries built from M-ary tree labelings. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
19Andrew W. Appel, Xavier Leroy Efficient Extensional Binary Tries. Search on Bibsonomy J. Autom. Reason. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
19Eduardo Kochenborger Duarte, Masahiro Shiomi, Alexey V. Vinel, Martin Cooney Trust in Robot Self-Defense: People Would Prefer a Competent, Tele-Operated Robot That Tries to Help*. Search on Bibsonomy RO-MAN The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
19Christoffer J. W. Romild, Thomas H. Schauser, Joachim Alexander Borup Enhancing Approximate Nearest Neighbor Search: Binary-Indexed LSH-Tries, Trie Rebuilding, and Batch Extraction. Search on Bibsonomy SISAP The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
19Berg Ferreira, Edleno Silva de Moura, Altigran Soares da Silva Applying burst-tries for error-tolerant prefix search. Search on Bibsonomy Inf. Retr. J. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
19Amin Hosseininasab, Willem-Jan van Hoeve, André A. Ciré Memory Efficient Tries for Sequential Pattern Mining. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  BibTeX  RDF
19Hasibul Jamil, Ning Weng Multibit Tries Packet Classification with Deep Reinforcement Learning. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
19Virginia Niculescu, Robert Manuel Stefanica Tries-Based Parallel Solutions for Generating Perfect Crosswords Grids. Search on Bibsonomy Algorithms The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
19Robert Binna, Eva Zangerle, Martin Pichl, Günther Specht, Viktor Leis Height Optimized Tries. Search on Bibsonomy ACM Trans. Database Syst. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
19Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann Top Tree Compression of Tries. Search on Bibsonomy Algorithmica The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
19Ioana O. Bercea, Guy Even Upper tail analysis of bucket sort and random tries. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
19Diego Arroyuelo, Rodrigo Cánovas, Johannes Fischer 0001, Dominik Köppl, Marvin Löbel, Gonzalo Navarro 0001, Rajeev Raman Engineering Practical Lempel-Ziv Tries. Search on Bibsonomy ACM J. Exp. Algorithmics The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
19Bolong Zheng, Lianggui Weng, Xi Zhao 0006, Kai Zeng, Xiaofang Zhou 0001, Christian S. Jensen REPOSE: Distributed Top-k Trajectory Similarity Search with Local Reference Point Tries. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
19Akio Nishimoto, Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga Position Heaps for Cartesian-tree Matching on Strings and Tries. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
19Andrew W. Appel, Xavier Leroy Efficient Extensional Binary Tries. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
19Nicola Prezza On Locating Paths in Compressed Tries. Search on Bibsonomy SODA The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
19Bolong Zheng, Lianggui Weng, Xi Zhao 0006, Kai Zeng 0002, Xiaofang Zhou 0001, Christian S. Jensen REPOSE: Distributed Top-k Trajectory Similarity Search with Local Reference Point Tries. Search on Bibsonomy ICDE The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
19Ioana O. Bercea, Guy Even Upper Tail Analysis of Bucket Sort and Random Tries. Search on Bibsonomy CIAC The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
19Akio Nishimoto, Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga Position Heaps for Cartesian-Tree Matching on Strings and Tries. Search on Bibsonomy SPIRE The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
19Shunsuke Kanda, Dominik Köppl, Yasuo Tabei, Kazuhiro Morita, Masao Fuketa Dynamic Path-decomposed Tries. Search on Bibsonomy ACM J. Exp. Algorithmics The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
19Ioana Oriana Bercea, Guy Even Upper Tail Analysis of Bucket Sort and Random Tries. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
19Svante Janson Central limit theorems for additive functionals and fringe trees in tries. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
19Hasibul Jamil, Ning Weng Multibit Tries Packet Classification with Deep Reinforcement Learning. Search on Bibsonomy HPSR The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
19Valérie Berthé, Eda Cesaratto, Frédéric Paccaut, Pablo Rotondo, Martín D. Safe, Brigitte Vallée Two Arithmetical Sources and Their Associated Tries. Search on Bibsonomy AofA The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
19Shunsuke Inenaga Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries. Search on Bibsonomy LATIN The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
19Katsuhito Nakashima, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara An Extension of Linear-size Suffix Tries for Parameterized Strings. Search on Bibsonomy SOFSEM (Doctoral Student Research Forum) The full citation details ... 2020 DBLP  BibTeX  RDF
19Tomasz Placek Laplace's demon tries on Aristotle's cloak: on two approaches to determinism. Search on Bibsonomy Synth. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
19Niloufar Shafiei Non-blocking Patricia tries with replace operations. Search on Bibsonomy Distributed Comput. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
19Philip Bille, Inge Li Gørtz, Pawel Gawrychowski, Gad M. Landau, Oren Weimann Top Tree Compression of Tries. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
19Katsuhito Nakashima, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara Linear-size Suffix Tries for Parameterized Strings. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
19Shunsuke Kanda, Dominik Köppl, Yasuo Tabei, Kazuhiro Morita, Masao Fuketa Dynamic Path-Decomposed Tries. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
19Shunsuke Inenaga Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
19Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda Dynamic Packed Compact Tries Revisited. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
19Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann Top Tree Compression of Tries. Search on Bibsonomy ISAAC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
19Lingjing You, Yongkun Li 0001, Fan Guo 0003, Yinlong Xu, Jinzhong Chen, Liu Yuan 0002 Leveraging Array Mapped Tries in KSM for Lightweight Memory Deduplication. Search on Bibsonomy NAS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
19Pedro Moreno, Miguel Areias 0001, Ricardo Rocha 0001 Memory Reclamation Methods for Lock-Free Hash Tries. Search on Bibsonomy SBAC-PAD The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
19Mehri Javanian Protected node profile of Tries. Search on Bibsonomy Discret. Math. Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
19Abram Magner, Wojciech Szpankowski Profiles of PATRICIA Tries. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
19Chia-Tung Kuo, Ian Davidson On The Equivalence of Tries and Dendrograms - Efficient Hierarchical Clustering of Traffic Data. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
19Huanchen Zhang, Hyeontaek Lim, Viktor Leis, David G. Andersen, Michael Kaminsky, Kimberly Keeton, Andrew Pavlo SuRF: Practical Range Query Filtering with Fast Succinct Tries. Search on Bibsonomy SIGMOD Conference The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
19Michael J. Steindorfer, Jurgen J. Vinju To-many or to-one? all-in-one! efficient purely functional multi-maps with type-heterogeneous hash-tries. Search on Bibsonomy PLDI The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
19Holger Heissmeyer Yes/no-object: a communicative object that tries to establish boundaries. Search on Bibsonomy AfriCHI The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
19Yi Wu 0011, Ge Nong, Mounir Hamdi Scalable pipelined IP lookup with prefix tries. Search on Bibsonomy Comput. Networks The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
19Silvia Businger Asymptotics of the occupancy scheme in a random environment and its applications to tries. Search on Bibsonomy Discret. Math. Theor. Comput. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 2341 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license