A compendium of key search references
ACM SIGIR Forum
The generation of binary trees as a numerical problem
Journal of the ACM (JACM)
A new approach to text searching
Communications of the ACM
Fast text searching: allowing errors
Communications of the ACM
A survey of adaptive sorting algorithms
ACM Computing Surveys (CSUR)
Multiple matching of rectangular patterns
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Combinatorial pattern discovery for scientific data: some preliminary results
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
The exact analysis of sparse rectangular linear systems
ACM Transactions on Mathematical Software (TOMS)
ACM Computing Surveys (CSUR)
ACM SIGACT News
Routing on longest-matching prefixes
IEEE/ACM Transactions on Networking (TON)
ACM Computing Surveys (CSUR)
Pattern-matching and text-compression algorithms
ACM Computing Surveys (CSUR)
Fast text searching for regular expressions or automaton searching on tries
Journal of the ACM (JACM)
YAP3: improved detection of similarities in computer program and other texts
SIGCSE '96 Proceedings of the twenty-seventh SIGCSE technical symposium on Computer science education
Recursive hashing functions for n-grams
ACM Transactions on Information Systems (TOIS)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On sorting strings in external memory (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Discovering Patterns from Large and Dynamic Sequential Data
Journal of Intelligent Information Systems
Randomized binary search trees
Journal of the ACM (JACM)
Fast searching on compressed text allowing errors
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
Weight-biased leftist trees and modified skip lists
Journal of Experimental Algorithmics (JEA)
Multi-method dispatching: a geometric approach with applications to string matching problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
The analysis of hybrid trie structures
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Analyzing the expected execution times of parallel programs
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Summary cache: a scalable wide-area web cache sharing protocol
IEEE/ACM Transactions on Networking (TON)
Fast and flexible word searching on compressed text
ACM Transactions on Information Systems (TOIS)
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
IEEE/ACM Transactions on Networking (TON)
A multivariate view of random bucket digital search trees
Journal of Algorithms - Analysis of algorithms
Journal of Algorithms - Analysis of algorithms
Stochastic Bounds for Parallel Program Execution Times with Processor Constraints
IEEE Transactions on Computers
Analysis of linear hashing revisited
Nordic Journal of Computing
Searching the World Wide Web: Challenges and Partial Solutions
IBERAMIA '98 Proceedings of the 6th Ibero-American Conference on AI: Progress in Artificial Intelligence
Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Performing IP Lookup on Very High Line Speed
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Adaptive Algorithms for Cache-Efficient Trie Search
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Trade Off Between Compression and Search Times in Compact Suffix Array
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Improving Mergesort for Linked Lists
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Modified Binary Searching for Static Tables
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
Emerging behavior as binary search trees are symmetrically updated
Theoretical Computer Science - Latin American theoretical informatics
Efficient URL caching for world wide web crawling
WWW '03 Proceedings of the 12th international conference on World Wide Web
A new regular grammar pattern matching algorithm
Theoretical Computer Science
Automated Discovery of Numerical Approximation Formulae via Genetic Programming
Genetic Programming and Evolvable Machines
A new algorithm for the construction of minimal acyclic DFAs
Science of Computer Programming
A Boyer--Moore-style algorithm for regular expression pattern matching
Science of Computer Programming
Compact suffix array: a space-efficient full-text index
Fundamenta Informaticae - Special issue on computing patterns in strings
On scalable and locality-aware web document sharing
Journal of Parallel and Distributed Computing - Scalable web services and architecture
Stereo vision system for precision dimensional inspection of 3D holes
Machine Vision and Applications
Expected time analysis for Delaunay point location
Computational Geometry: Theory and Applications
Experiments with balanced-sample binary trees
Proceedings of the 36th SIGCSE technical symposium on Computer science education
International Journal of High Performance Computing Applications
Exact distribution of individual displacements in linear probing hashing
ACM Transactions on Algorithms (TALG)
GLIMPSE: a tool to search through entire file systems
WTEC'94 Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference
Mutually visible agents in a discrete environment
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
Theoretical Computer Science
Why simple hash functions work: exploiting the entropy in a data stream
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Simple summaries for hashing with choices
IEEE/ACM Transactions on Networking (TON)
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
A Design of Automatic Visualizations for Divide-and-Conquer Algorithms
Electronic Notes in Theoretical Computer Science (ENTCS)
A sequential indexing scheme for flash-based embedded systems
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Automatic wrapper generation using tree matching and partial tree alignment
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Thread-based implementations of the false nearest neighbors method
Parallel Computing
Suffix trees and string complexity
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
DMP-tree: A dynamic M-way prefix tree data structure for strings matching
Computers and Electrical Engineering
Engineering scalable, cache and space efficient tries for strings
The VLDB Journal — The International Journal on Very Large Data Bases
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Redesigning the string hash table, burst trie, and BST to exploit cache
Journal of Experimental Algorithmics (JEA)
ACConv -- An Access Control Model for Conversational Web Services
ACM Transactions on the Web (TWEB)
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
A precise analysis of Cuckoo hashing
ACM Transactions on Algorithms (TALG)
On demand string sorting over unbounded alphabets
Theoretical Computer Science
Data driven approaches to speech and language processing
Nonlinear Speech Modeling and Applications
Information Sciences: an International Journal
Extracting structural features among words from document data streams
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
External Memory Algorithms for String Problems
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Compact Suffix Array — A Space-Efficient Full-Text Index
Fundamenta Informaticae - Computing Patterns in Strings
On demand string sorting over unbounded alphabets
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Duplicate detection in pay-per-click streams using temporal stateful Bloom filters
International Journal of Data Analysis Techniques and Strategies
Indexing for summary queries: Theory and practice
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.04 |