The following pages link to Walter A. Burkhard (Q1044728):
Displayed 20 items.
- (Q922527) (redirect page) (← links)
- On a complexity-based way of constructivizing the recursive functions (Q922528) (← links)
- Double hashing with passbits (Q1044729) (← links)
- Interpolation-based index maintenance (Q1050774) (← links)
- Inherent complexity trade-offs for range query problems (Q1056239) (← links)
- Heuristics for partial-match retrieval data base design (Q1223153) (← links)
- Efficient Algorithms for (3,1) Graphs (Q1240742) (← links)
- Non-uniform partial-match file designs (Q1241069) (← links)
- Associative retrieval trie hash-coding (Q1252726) (← links)
- A proof of the optimality of the MIN paging algorithm using linear programming duality (Q1924620) (← links)
- Complexity problems in real time languages (Q2547547) (← links)
- Some approaches to best-match file searching (Q3212705) (← links)
- Full table quadratic quotient searching (Q4055167) (← links)
- Nonrecursive traversals of trees (Q4061958) (← links)
- (Q4072816) (← links)
- Partial match retrieval (Q4131628) (← links)
- (Q4136558) (← links)
- (Q4140419) (← links)
- (Q4777268) (← links)
- DOUBLE HASHING WITH MULTIPLE PASSBITS (Q5696961) (← links)