The following pages link to Two results on tables (Q1069703):
Displaying 7 items.
- Improved bounds for dictionary look-up with one error (Q294796) (← links)
- The problem of space invariance for sequential machines (Q1102112) (← links)
- The effect of table expansion on the program complexity of perfect hash functions (Q1198971) (← links)
- Perfect hashing (Q1391123) (← links)
- Tables should be sorted (on random access machines) (Q5057459) (← links)
- (Q5116481) (← links)
- Polynomial hash functions are reliable (Q5204320) (← links)