Self-adjusting binary search trees
Journal of the ACM (JACM)
Partial match retrieval of multidimensional data
Journal of the ACM (JACM)
On the Height of Multidimensional Height-Balanced Trees
IEEE Transactions on Computers
The world's fastest Scrabble program
Communications of the ACM
The C programming language
An algorithm for string matching with a sequence of don't cares
Information Processing Letters
Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
Software—Practice & Experience
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Programming pearls: a literate program
Communications of the ACM
Implementing Quicksort programs
Communications of the ACM
Expected time bounds for selection
Communications of the ACM
Increasing the efficiency of quicksort
Communications of the ACM
Randomized binary searching with tree structures
Communications of the ACM
A Discipline of Programming
ACM SIGACT News
On sorting strings in external memory (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Journal of Experimental Algorithmics (JEA)
Lower bounds for high dimensional nearest neighbor search and related problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
The string B-tree: a new data structure for string search in external memory and its applications
Journal of the ACM (JACM)
The analysis of hybrid trie structures
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
All searches are divided into three parts: string searches using ternary trees
APL '98 Proceedings of the APL98 conference on Array processing language
An experimental study of an opportunistic index
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
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
A general-purpose compression scheme for large collections
ACM Transactions on Information Systems (TOIS)
Journal of Algorithms - Analysis of algorithms
TreePredict: improving text entry on PDA's
CHI '01 Extended Abstracts on Human Factors in Computing Systems
Invited Lecture: The Burrows-Wheeler Transform: Theory and Practice
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
The Enhanced Suffix Array and Its Applications to Genome Analysis
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Optimal Exact Strring Matching Based on Suffix Arrays
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Adaptive Algorithms for Cache-Efficient Trie Search
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Efficient Algorithms foe On-Line Symbol Ranking Compression
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Engineering a Lightweight Suffix Array Construction Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Modified Binary Searching for Static Tables
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Efficient trie-based sorting of large sets of strings
ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16
On the Performance of BWT Sorting Algorithms
DCC '00 Proceedings of the Conference on Data Compression
Prototyping of Efficient Hardware Algorithms for Data Compression in Future Communication Systems
RSP '01 Proceedings of the 12th International Workshop on Rapid System Prototyping
Identifying Gene and Protein Names from Biological Texts
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Replacing suffix trees with enhanced suffix arrays
Journal of Discrete Algorithms - SPIRE 2002
Cache-conscious sorting of large sets of strings with dynamic tries
Journal of Experimental Algorithmics (JEA)
Antisequential Suffix Sorting for BWT-Based Data Compression
IEEE Transactions on Computers
Ternary directed acyclic word graphs
Theoretical Computer Science - Implementation and application of automata
Universal Text Preprocessing for Data Compression
IEEE Transactions on Computers
A functional toolkit for morphological and phonological processing, application to a Sanskrit tagger
Journal of Functional Programming
Practical methods for constructing suffix trees
The VLDB Journal — The International Journal on Very Large Data Bases
HOT SAX: Efficiently Finding the Most Unusual Time Series Subsequence
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Cache-oblivious string dictionaries
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
MWE '03 Proceedings of the ACL 2003 workshop on Multiword expressions: analysis, acquisition and treatment - Volume 18
SEFT: a search engine for text
Software—Practice & Experience
The scientific works of Rainer Kemp (1949-2004)
Theoretical Computer Science
Future Generation Computer Systems - Systems performance analysis and evaluation
On using conditional rotations and randomized heuristics for self-organizing ternary search tries
Proceedings of the 43rd annual Southeast regional conference - Volume 1
Fast string sorting using order-preserving compression
Journal of Experimental Algorithmics (JEA)
Using random sampling to build approximate tries for efficient string sorting
Journal of Experimental Algorithmics (JEA)
Cache-efficient string sorting using copying
Journal of Experimental Algorithmics (JEA)
Probabilistic analysis of algorithms for the Dutch national flag problem
Theoretical Computer Science
Compression techniques for fast external sorting
The VLDB Journal — The International Journal on Very Large Data Bases
A taxonomy of suffix array construction algorithms
ACM Computing Surveys (CSUR)
HAT-trie: a cache-conscious trie-based data structure for strings
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
An efficient, versatile approach to suffix sorting
Journal of Experimental Algorithmics (JEA)
Analytic combinatorics: a calculus of discrete structures
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Fast BWT in small space by blockwise suffix sorting
Theoretical Computer Science
Theoretical Computer Science
Fast blocking of undesirable web pages on client PC by discriminating URL using neural networks
Expert Systems with Applications: An International Journal
ACM Transactions on Algorithms (TALG)
An analysis of the height of tries with random weights on the edges
Combinatorics, Probability and Computing
On searching compressed string collections cache-obliviously
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II
Efficiently finding unusual shapes in large image databases
Data Mining and Knowledge Discovery
Engineering Radix Sort for Strings
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
New Frontiers in Applied Data Mining
Improving multikey Quicksort for sorting strings with many equal elements
Information Processing Letters
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
Dictionary-based order-preserving string compression for main memory column stores
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Engineering burstsort: Toward fast in-place string sorting
Journal of Experimental Algorithmics (JEA)
Engineering a software tool for gene structure prediction in higher organisms
Information and Software Technology
Frequency based predictive input system for Hindi
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Implementation of dictionaries via automata and decision trees
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Fast lightweight suffix array construction and checking
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Experiments for algorithm engineering
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Ternary directed acyclic word graphs
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Search data structures for skewed strings
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Engineering burstsort: towards fast in-place string sorting
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Structured annotations of web queries
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
New methods for compression of MP double array by compact management of suffixes
Information Processing and Management: an International Journal
The compressed permuterm index
ACM Transactions on Algorithms (TALG)
Engineering scalable, cache and space efficient tries for strings
The VLDB Journal — The International Journal on Very Large Data Bases
Data-specific analysis of string sorting
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Redesigning the string hash table, burst trie, and BST to exploit cache
Journal of Experimental Algorithmics (JEA)
On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation
Information Processing Letters
A subpath kernel for rooted unordered trees
PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part I
PSAEC: an improved algorithm for short read error correction using partial suffix arrays
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Augmented order preserving minimal perfect hash functions for very large digital libraries
CIT'11 Proceedings of the 5th WSEAS international conference on Communications and information technology
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
Group SAX: extending the notion of contrast sets to time series and multimedia data
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
External string sorting: faster and cache-oblivious
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Optimal in-place sorting of vectors and records
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On demand string sorting over unbounded alphabets
Theoretical Computer Science
A fast suffix-sorting algorithm
General Theory of Information Transfer and Combinatorics
The growing-tree sorting algorithm
WSEAS Transactions on Information Science and Applications
On demand string sorting over unbounded alphabets
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
The simplex tree: an efficient data structure for general simplicial complexes
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Sequential pattern mining -- approaches and algorithms
ACM Computing Surveys (CSUR)
Parallel suffix array and least common prefix for the GPU
Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming
Trends in suffix sorting: a survey of low memory algorithms
ACSC '12 Proceedings of the Thirty-fifth Australasian Computer Science Conference - Volume 122
Sparse suffix tree construction in small space
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Faster semi-external suffix sorting
Information Processing Letters
A P300-based brain computer interface system for words typing
Computers in Biology and Medicine
| Hi-index | 0.01 |