Search results for "G-Tries"

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