The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
Journal of the ACM (JACM)
The use of quadratic residue research
Communications of the ACM
The quadratic quotient method: a hash code eliminating secondary clustering
Communications of the ACM
Communications of the ACM
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
File structures using hashing functions
Communications of the ACM
Full table quadratic searching for scatter storage
Communications of the ACM
Randomized binary search technique
Communications of the ACM
Programming Technique: An improved hash code for scatter storage
Communications of the ACM
Communications of the ACM
Randomized binary searching with tree structures
Communications of the ACM
On a storage mapping function for data structures
Communications of the ACM
Storage and search properties of a tree-organized memory system
Communications of the ACM
A variant method of file searching
Communications of the ACM
An indirect chaining method for addressing on secondary keys
Communications of the ACM
Use of tree structures for processing files
Communications of the ACM
Communications of the ACM
Analysis of a file addressing method
Communications of the ACM
Random access file organization for indirectly addressed records
ACM '69 Proceedings of the 1969 24th national conference
Information retrieval: information storage and retrieval using AVL trees
ACM '65 Proceedings of the 1965 20th national conference
Some generalized modeling structures for use in design of file organizations.
Some generalized modeling structures for use in design of file organizations.
A programming language
ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
Variable-depth trie index optimization: theory and experimental results
ACM Transactions on Database Systems (TODS)
A compendium of key search references
ACM SIGIR Forum
The Complexity of Trie Index Construction
Journal of the ACM (JACM)
Binary Search Trees and File Organization
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
A Practical Approach to Selecting Record Access Paths
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
The Logical Record Access Approach to Database Design
ACM Computing Surveys (CSUR)
The study of an ordered minimal perfect hashing scheme
Communications of the ACM
An optimal evaluation of Boolean expressions in an online query system
Communications of the ACM
Perfect hashing functions: a single probe retrieving method for static sets
Communications of the ACM
A practitioner's guide to addressing algorithms
Communications of the ACM
Burst tries: a fast, efficient data structure for string keys
ACM Transactions on Information Systems (TOIS)
Performance analysis of three related assignment problems
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
IEEE Annals of the History of Computing
A Dynamic Perfect Hash Function Defined by an Extended Hash Indicator Table
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Some experiments in directory organization - a simulation study
SIGMETRICS '76 Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation
Tree structures construction using key densities
ACM '75 Proceedings of the 1975 annual conference
Some experiments in directory organization: a simulation study
ACM SIGSIM Simulation Digest
HAT-trie: a cache-conscious trie-based data structure for strings
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
Data models for secondary storage representations
VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
Variable-length hash area entries
AFIPS '77 Proceedings of the June 13-16, 1977, national computer conference
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
Data structures and data accessing in data base systems past, present, future
IBM Systems Journal
Scalable parallel word search in multicore/multiprocessor systems
The Journal of Supercomputing
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)
Recent developments in the theory of data structures
Computer Languages
Generalized Model-Based Human Motion Recognition with Body Partition Index Maps
Computer Graphics Forum
| Hi-index | 0.07 |