Partial match retrieval of multidimensional data
Journal of the ACM (JACM)
Algorithms
Codes and cryptography
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Birthday paradox, coupon collectors, caching algorithms and self-organizing search
Discrete Applied Mathematics
Mellin transforms and asymptotics: harmonic sums
Theoretical Computer Science - Special volume on mathematical analysis of algorithms (dedicated to D. E. Knuth)
An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
Continued fraction algorithms, functional operators, and structure constants
Theoretical Computer Science
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Fast algorithms for sorting and searching strings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
An Analysis of Binary Search Trees Formed from Sequences of Nondistinct Keys
Journal of the ACM (JACM)
Self-Organizing Binary Search Trees
Journal of the ACM (JACM)
Randomized binary searching with tree structures
Communications of the ACM
All searches are divided into three parts: string searches using ternary trees
APL '98 Proceedings of the APL98 conference on Array processing language
Burst tries: a fast, efficient data structure for string keys
ACM Transactions on Information Systems (TOIS)
Performance of data structures for small sets of strings
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
Concentration of Size and Path Length of Tries
Combinatorics, Probability and Computing
On the average depth of asymmetric LC-tries
Information Processing Letters
On using conditional rotations and randomized heuristics for self-organizing ternary search tries
Proceedings of the 43rd annual Southeast regional conference - Volume 1
Compression techniques for fast external sorting
The VLDB Journal — The International Journal on Very Large Data Bases
Mining longest repeating subsequences to predict world wide web surfing
USITS'99 Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2
An analysis of the height of tries with random weights on the edges
Combinatorics, Probability and Computing
Question classification by structure induction
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
On the average depth of asymmetric LC-tries
Information Processing Letters
Search data structures for skewed strings
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
New methods for compression of MP double array by compact management of suffixes
Information Processing and Management: an International Journal
Engineering scalable, cache and space efficient tries for strings
The VLDB Journal — The International Journal on Very Large Data Bases
Redesigning the string hash table, burst trie, and BST to exploit cache
Journal of Experimental Algorithmics (JEA)
Component-based matching for multiple interacting RNA sequences
ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
Enhancing trie-based syntactic pattern recognition using AI heuristic search strategies
ICAPR'05 Proceedings of the Third international conference on Advances in Pattern Recognition - Volume Part I
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Analysis of a class of tries with adaptive multi-digit branching
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Classifying sentences using induced structure
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
| Hi-index | 0.00 |