Active Bibliography

II-l II. A Scatter Storage Scheme For Dictionary Lookups – D. M. Murray
HASH SORT: A LINEAR TIME COMPLEXITY MULITIPLE-DIMENSIONAL SORT ALGORITHM ORIGINALLY ENTITLED ”MAKING A HASH OF SORTS ” ∗ Abstract. – William F. Gilreath - 2004
to Best-Match File Searching – P. Baxendale, W. A. Burkhard - 1971
A New Approach to the Analysis . . . – Haim Mendelson, Uri Yechiali - 1980
1 Disk Labeling Techniques: Hash-Based Approaches to Disk Scaling – Shu-Yuen Didi Yao, Cyrus Shahabi, Per-Åke Larson
1 Techniques For Improving The Efficiency Of Heuristic Search – John F. Dillenburg - 1993
9 Architectural and Operating System Support for Orthogonal Persistence – John Rosenberg - 1992
31 Algorithms for Automated Protocol Validation – Gerard J. Holzmann, Gerard J. Holzmann - 1990
D. Memory Usage...................... E. Access Time....................... F. Operation Time...................... – Sheldon I. Becker, X. Restore, G. System Measures, Appendix I
16 Software Model Checking – Gerard J. Holzmann - 1999
42 Improving Security and Performance for Capability Systems – Paul Ashley Karger - 1988
52 An Improved Protocol Reachability Analysis Technique – Gerard J. Holzmann - 1988
Adapting to Babel—Adaptivity and Context-Sensitivity in Parsing: from a n b n c n to RNA BY – Copyright August, Quinn Tyler Jackson, Quinn Tyler Jackson, Quinn Tyler Jackson
44 A Comparison of Hashing Schemes for Address Lookup in Computer Networks – Raj Jain - 1989
29 A new page table for 64-bit address spaces – Madhusudhan Talluri, Mark D. Hill, Yousef A. Khalidi - 1995
4 Perfect hashing as an almost perfect subtype test – Roland Ducournau, Lirmm Cnrs, Université Montpellier Ii