Search results for "Tries"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
19	Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura	Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2017	DBLP DOI BibTeX RDF
19	Shunsuke Kanda, Kazuhiro Morita, Masao Fuketa	Compressed double-array tries for string dictionaries supporting fast lookup.	Knowl. Inf. Syst.	2017	DBLP DOI BibTeX RDF
19	Aleksandar Prokopec	Analysis of Concurrent Lock-Free Hash Tries with Constant-Time Operations.	CoRR	2017	DBLP BibTeX RDF
19	Aleksandar Prokopec, Phil Bagwell, Martin Odersky	Cache-Aware Lock-Free Concurrent Hash Tries.	CoRR	2017	DBLP BibTeX RDF
19	Johannes Fischer 0001, Dominik Köppl	Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries.	CoRR	2017	DBLP BibTeX RDF
19	Marcel Ehrhardt, Wolfgang Mulzer	Delta-Fast Tries: Local Searches in Bounded Universes with Linear Space.	WADS	2017	DBLP DOI BibTeX RDF
19	Johannes Fischer 0001, Dominik Köppl	Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries.	SPIRE	2017	DBLP DOI BibTeX RDF
19	Tony Finch	QP tries are smaller and faster than crit-bit trees.	Tiny Trans. Comput. Sci.	2016	DBLP BibTeX RDF
19	Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi	Linear-size suffix tries.	Theor. Comput. Sci.	2016	DBLP DOI BibTeX RDF
19	Michael Drmota, Abram Magner, Wojciech Szpankowski	Asymmetric Rényi Problem and PATRICIA Tries.	CoRR	2016	DBLP BibTeX RDF
19	Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura	Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing.	CoRR	2016	DBLP BibTeX RDF
19	Nicolai Diethelm	Randomized Ternary Search Tries.	CoRR	2016	DBLP BibTeX RDF
19	Michael J. Steindorfer, Jurgen J. Vinju	Fast and Lean Immutable Multi-Maps on the JVM based on Heterogeneous Hash-Array Mapped Tries.	CoRR	2016	DBLP BibTeX RDF
19	Michael Fuchs 0001, Hsien-Kuei Hwang	Dependence between External Path-Length and Size in Random Tries.	CoRR	2016	DBLP BibTeX RDF
19	Junichiro Fukuyama	Partial-Match Queries with Random Wildcards: In Tries and Distributed Hash Tables.	CoRR	2016	DBLP BibTeX RDF
19	Lerrel Pinto, Abhinav Gupta 0001	Supersizing self-supervision: Learning to grasp from 50K tries and 700 robot hours.	ICRA	2016	DBLP DOI BibTeX RDF
19	Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura	Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing.	IWOCA	2016	DBLP DOI BibTeX RDF
19	Manu Goel, Kanu Goel	FP-Growth Implementation Using Tries for Association Rule Mining.	SocProS (2)	2016	DBLP DOI BibTeX RDF
19	Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda	Constructing LZ78 tries and position heaps in linear time for large alphabets.	Inf. Process. Lett.	2015	DBLP DOI BibTeX RDF
19	Jesper Jansson 0001, Kunihiko Sadakane, Wing-Kin Sung	Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space.	Algorithmica	2015	DBLP DOI BibTeX RDF
19	Siavash Sheikhizadeh, Dick de Ridder	ACE: accurate correction of errors using K-mer tries.	Bioinform.	2015	DBLP DOI BibTeX RDF
19	Sven Groppe, Dennis Heinrich, Stefan Werner 0002, Christopher Blochwitz, Thilo Pionteck	PatTrieSort - External String Sorting based on Patricia Tries.	Open J. Databases	2015	DBLP BibTeX RDF
19	Lerrel Pinto, Abhinav Gupta 0001	Supersizing Self-supervision: Learning to Grasp from 50K Tries and 700 Robot Hours.	CoRR	2015	DBLP BibTeX RDF
19	Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda	Constructing LZ78 Tries and Position Heaps in Linear Time for Large Alphabets.	CoRR	2015	DBLP BibTeX RDF
19	Kevin Leckey, Ralph Neininger, Wojciech Szpankowski	A Limit Theorem for Radix Sort and Tries with Markovian Input.	CoRR	2015	DBLP BibTeX RDF
19	Peggy Cénac, Brigitte Chauvin, Frédéric Paccaut, Nicolas Pouyanne	Uncommon suffix tries.	Random Struct. Algorithms	2015	DBLP DOI BibTeX RDF
19	Alistair Morris, Constantinos Patsakis, Vinny Cahill, Mélanie Bouroche	Snapcab: Urban Scale Context-Aware Smart Transport Using Adaptive Context Tries.	ICCASA	2015	DBLP DOI BibTeX RDF
19	Michael J. Steindorfer, Jurgen J. Vinju	Optimizing hash-array mapped tries for fast and lean immutable JVM collections.	OOPSLA	2015	DBLP DOI BibTeX RDF
19	Takahiro Ota, Hiroyoshi Morita	On a two-dimensional antidictionary construction using suffix tries.	ISIT	2015	DBLP DOI BibTeX RDF
19	Michael Cochez, Hao Mou	Twister Tries: Approximate Hierarchical Agglomerative Clustering for Average Distance in Linear Time.	SIGMOD Conference	2015	DBLP DOI BibTeX RDF
19	Philippe Jacquet, Abram Magner	Variance of Size in Regular Graph Tries.	ANALCO	2015	DBLP DOI BibTeX RDF
19	Andreas Poyias, Rajeev Raman	Improved Practical Compact Dynamic Tries.	SPIRE	2015	DBLP DOI BibTeX RDF
19	Michael Cochez, Ferrante Neri	Scalable Hierarchical Clustering: Twister Tries with a Posteriori Trie Elimination.	SSCI	2015	DBLP DOI BibTeX RDF
19	Pedro Manuel Pinto Ribeiro, Fernando M. A. Silva	G-Tries: a data structure for storing and finding subgraphs.	Data Min. Knowl. Discov.	2014	DBLP DOI BibTeX RDF
19	Roberto Grossi, Giuseppe Ottaviano	Fast Compressed Tries through Path Decompositions.	ACM J. Exp. Algorithmics	2014	DBLP DOI BibTeX RDF
19	Miguel Areias 0001, Ricardo Rocha 0001	On the Correctness and Efficiency of Lock-Free Expandable Tries for Tabled Logic Programs.	PADL	2014	DBLP DOI BibTeX RDF
19	Karen Renaud, Rosanne English, Thomas Wynne, Florian Weber	You Have Three Tries Before Lockout. Why Three?.	HAISA	2014	DBLP BibTeX RDF
19	Pramod G. Joisha	Sticky tries: fast insertions, fast lookups, no deletions for large key universes.	ISMM	2014	DBLP DOI BibTeX RDF
19	Zachary A. Kissel, Jie Wang 0002	A Note on Verifiable Privacy-Preserving Tries.	IEEE CLOUD	2014	DBLP DOI BibTeX RDF
19	Michael J. Steindorfer, Jurgen J. Vinju	Code specialization for memory efficient hash tries (short paper).	GPCE	2014	DBLP DOI BibTeX RDF
19	Abram Magner, Charles Knessl, Wojciech Szpankowski	Expected External Profile of PATRICIA Tries.	ANALCO	2014	DBLP DOI BibTeX RDF
19	Craig W. Johnson, Craig Harrington, Rodney Howell, Taiwo Akinwande	Does Allowing Repeated Tries Without Penalty for Incorrect Responses Increase Guessing?	AMIA	2014	DBLP BibTeX RDF
19	Niloufar Shafiei	Non-blocking Patricia Tries with Replace Operations	CoRR	2013	DBLP BibTeX RDF
19	Ralph Neininger, Kevin Leckey, Wojciech Szpankowski	Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model.	SODA	2013	DBLP DOI BibTeX RDF
19	Fritz Henglein, Ralf Hinze	Sorting and Searching by Distribution: From Generic Discrimination to Generic Tries.	APLAS	2013	DBLP DOI BibTeX RDF
19	Niloufar Shafiei	Non-blocking Patricia Tries with Replace Operations.	ICDCS	2013	DBLP DOI BibTeX RDF
19	Brice Bognet	Strate'gies nume'riques avance'es pour la simulation de modèles de'finis sur des ge'ome'tries de plaques et coques : solutions 3D avec une complexite' 2D. (Advanced simulation of models defined in plate and shell geometries: 3D solutions with 2D computational complexity).		2013	RDF
19	Svante Janson	Renewal theory in the analysis of tries and strings.	Theor. Comput. Sci.	2012	DBLP DOI BibTeX RDF
19	Kevin Leckey, Ralph Neininger, Wojciech Szpankowski	Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model	CoRR	2012	DBLP BibTeX RDF
19	Silvio do Lago Pereira, Leliane Nunes de Barros	A planner agent that tries its best in presence of nondeterminism.	J. Appl. Log.	2012	DBLP DOI BibTeX RDF
19	Vincent Gripon, Michael G. Rabbat, Vitaly Skachek, Warren J. Gross	Compressing multisets using tries.	ITW	2012	DBLP DOI BibTeX RDF
19	Pedro Manuel Pinto Ribeiro, Fernando M. A. Silva	Querying subgraph sets with g-tries.	DBSocial	2012	DBLP DOI BibTeX RDF
19	Giuseppe Ottaviano, Roberto Grossi	Fast Compressed Tries through Path Decompositions.	ALENEX	2012	DBLP DOI BibTeX RDF
19	Aleksandar Prokopec, Nathan Grasso Bronson, Phil Bagwell, Martin Odersky	Concurrent tries with efficient non-blocking snapshots.	PPoPP	2012	DBLP DOI BibTeX RDF
19	Paolo Boldi, Sebastiano Vigna	E=I+T: The internal extent formula for compacted tries.	Inf. Process. Lett.	2011	DBLP DOI BibTeX RDF
19	Ming-che Lai, Lei Gao	Two-level tries: A general acceleration structure for parallel routing table accesses.	J. Commun. Networks	2011	DBLP DOI BibTeX RDF
19	Peggy Cénac, Brigitte Chauvin, Frédéric Paccaut, Nicolas Pouyanne	Uncommon Suffix Tries	CoRR	2011	DBLP BibTeX RDF
19	Flávio Cruz, Ricardo Rocha 0001	Single Time-Stamped Tries for Retroactive Call Subsumption	CoRR	2011	DBLP BibTeX RDF
19	Roberto Grossi, Giuseppe Ottaviano	Fast Compressed Tries through Path Decompositions	CoRR	2011	DBLP BibTeX RDF
19	Michel Hanna, Sangyeun Cho, Rami G. Melhem	A Novel Scalable IPv6 Lookup Scheme Using Compressed Pipelined Tries.	Networking (1)	2011	DBLP DOI BibTeX RDF
19	Koray Ak, Olcay Taner Yildiz	Unsupervised Morphological Analysis Using Tries.	ISCIS	2011	DBLP DOI BibTeX RDF
19	Aleksandar Prokopec, Phil Bagwell, Martin Odersky	Lock-Free Resizeable Concurrent Tries.	LCPC	2011	DBLP DOI BibTeX RDF
19	Yi Wu 0011, Ge Nong	A scalable routing architecture for prefix tries.	ICON	2011	DBLP DOI BibTeX RDF
19	Ioannis Sourdis, Sri Harsha Katamaneni	Longest Prefix Match and updates in Range Tries.	ASAP	2011	DBLP DOI BibTeX RDF
19	Neil V. Murray, Erik Rosenthal	Identifying Prime Implicate Branches in Reduced Implicate Tries.	Fundam. Informaticae	2010	DBLP DOI BibTeX RDF
19	A. G. Alagu Priya, Hyesook Lim	Hierarchical packet classification using a Bloom filter and rule-priority tries.	Comput. Commun.	2010	DBLP DOI BibTeX RDF
19	Erik D. Demaine, Stefan Langerman, Eric Price 0001	Confluently Persistent Tries for Efficient Version Control.	Algorithmica	2010	DBLP DOI BibTeX RDF
19	Hyesook Lim, Changhoon Yim, Earl E. Swartzlander Jr.	Priority Tries for IP Address Lookup.	IEEE Trans. Computers	2010	DBLP DOI BibTeX RDF	binary trie, priority trie, range representation, Internet, router, IP address lookup
19	Paolo Boldi, Sebastiano Vigna	E = I + T: The internal extent formula for compacted tries	CoRR	2010	DBLP BibTeX RDF
19	Neil V. Murray, Erik Rosenthal	Reduced Implicate Tries with Updates.	J. Log. Comput.	2010	DBLP DOI BibTeX RDF
19	Nikolas Askitis, Ranjan Sinha	Engineering scalable, cache and space efficient tries for strings.	VLDB J.	2010	DBLP DOI BibTeX RDF
19	Gahyun Park, Minseok Kwon	Distributed tries for load balancing in peer-to-peer systems.	IWQoS	2010	DBLP DOI BibTeX RDF
19	Djamal Belazzougui, Paolo Boldi, Sebastiano Vigna	Dynamic Z-Fast Tries.	SPIRE	2010	DBLP DOI BibTeX RDF
19	Pedro Manuel Pinto Ribeiro, Fernando M. A. Silva	Efficient Subgraph Frequency Estimation with G-Tries.	WABI	2010	DBLP DOI BibTeX RDF
19	Wencheng Lu, Sartaj Sahni	Efficient 2D Multibit Tries for Packet Classification.	IEEE Trans. Computers	2009	DBLP DOI BibTeX RDF
19	Svante Janson	Renewal theory in analysis of tries and strings	CoRR	2009	DBLP BibTeX RDF
19	Luc Devroye, Gábor Lugosi, GaHyun Park, Wojciech Szpankowski	Multiple choice tries and distributed hash tables.	Random Struct. Algorithms	2009	DBLP DOI BibTeX RDF
19	GaHyun Park, Hsien-Kuei Hwang, Pierre Nicodème, Wojciech Szpankowski	Profiles of Tries.	SIAM J. Comput.	2009	DBLP DOI BibTeX RDF
19	Nikolas Askitis, Justin Zobel	B-tries for disk-based string management.	VLDB J.	2009	DBLP DOI BibTeX RDF	Burst trie, Vocabulary accumulation, Word-level indexing, Data structures, B-tree, Secondary storage
19	Neil V. Murray, Erik Rosenthal	Prime Implicates and Reduced Implicate Tries.	ISMIS	2009	DBLP DOI BibTeX RDF
19	Stas Bevc, Iztok Savnik	Using tries for subset and superset queries.	ITI	2009	DBLP DOI BibTeX RDF
19	Ray R. Larson	Decomposing Text Processing for Retrieval: Cheshire Tries GRID@CLEF.	CLEF (1)	2009	DBLP DOI BibTeX RDF
19	Ray R. Larson	Decomposing Text Processing for Retrieval: Cheshire tries GRID@CLEF.	CLEF (Working Notes)	2009	DBLP BibTeX RDF
19	Andrew Matusiewicz, Neil V. Murray, Erik Rosenthal	Reduced Implicate Tries and Logical Operations.	KEOD	2009	DBLP BibTeX RDF
19	Ioannis Sourdis, Georgios Stefanakis, Ruben de Smet, Georgi Gaydadjiev	Range Tries for scalable address lookup.	ANCS	2009	DBLP DOI BibTeX RDF
19	Bernd Stefan Eckhardt	Complexity analysis of tries and spanning tree problems.		2009	RDF
19	Nicolas Broutin, Luc Devroye	An Analysis of the Height of Tries with Random Weights on the Edges.	Comb. Probab. Comput.	2008	DBLP DOI BibTeX RDF
19	Bradford G. Nickerson, Qingxiu Shi	On k-d Range Search with Patricia Tries.	SIAM J. Comput.	2008	DBLP DOI BibTeX RDF
19	GaHyun Park, Hsien-Kuei Hwang, Pierre Nicodème, Wojciech Szpankowski	Profile of Tries.	LATIN	2008	DBLP DOI BibTeX RDF
19	Mian Pan, Haibin Lu	Build shape-shifting tries for fast IP lookup in O(n) time.	Comput. Commun.	2007	DBLP DOI BibTeX RDF
19	Neil V. Murray, Erik Rosenthal	Efficient Query Processing with Reduced Implicate Tries.	J. Autom. Reason.	2007	DBLP DOI BibTeX RDF	reduced implicate trie, query processing, knowledge base
19	Neil V. Murray, Erik Rosenthal	Updating Reduced Implicate Tries.	TABLEAUX	2007	DBLP DOI BibTeX RDF
19	Jesper Jansson 0001, Kunihiko Sadakane, Wing-Kin Sung	Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space.	FSTTCS	2007	DBLP DOI BibTeX RDF
19	Ghada Badr, B. John Oommen	On optimizing syntactic pattern recognition using tries and AI-based heuristic-search strategies.	IEEE Trans. Syst. Man Cybern. Part B	2006	DBLP DOI BibTeX RDF
19	Alberto Apostolico, Yongwook Choi	Compressing with Collapsible Tries.	ITW	2006	DBLP DOI BibTeX RDF
19	Alberto Apostolico, Yongwook Choi	Textual Compression by Collapsible Tries.	DCC	2006	DBLP DOI BibTeX RDF
19	Svante Janson, Wojciech Szpankowski	Partial Fillup and Search Time in LC Tries.	ANALCO	2006	DBLP DOI BibTeX RDF
19	Muhammad Umer Arshad, Muhammad Naeem Ayyaz	Mining N-most Interesting Itemsets using Support-Ordered Tries.	AICCSA	2006	DBLP DOI BibTeX RDF
19	Yuriy A. Reznik	On the average depth of asymmetric LC-tries.	Inf. Process. Lett.	2005	DBLP DOI BibTeX RDF
19	Ranjan Sinha, Justin Zobel	Using random sampling to build approximate tries for efficient string sorting.	ACM J. Exp. Algorithmics	2005	DBLP DOI BibTeX RDF	cache-aware, cache-conscious, in-memory, data structure, Sorting, string