Walter A. Burkhard

zbMath Openburkhard.walter-aMaRDI QIDQ1044728

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Double hashing with passbits	2009-12-18	Paper
DOUBLE HASHING WITH MULTIPLE PASSBITS	2005-10-19	Paper
A proof of the optimality of the MIN paging algorithm using linear programming duality	1996-10-20	Paper
On a complexity-based way of constructivizing the recursive functions	1990-01-01	Paper
Interpolation-based index maintenance	1983-01-01	Paper
Inherent complexity trade-offs for range query problems	1981-01-01	Paper
Non-uniform partial-match file designs	1978-01-01	Paper
Associative retrieval trie hash-coding	1977-01-01	Paper
Efficient Algorithms for (3,1) Graphs	1977-01-01	Paper
Partial match retrieval	1976-01-01	Paper
Heuristics for partial-match retrieval data base design	1976-01-01	Paper
scientific article; zbMATH DE number 3569868 (Why is no real title available?)	1976-01-01	Paper
Nonrecursive traversals of trees	1975-01-01	Paper
Full table quadratic quotient searching	1975-01-01	Paper
scientific article; zbMATH DE number 3453573 (Why is no real title available?)	1974-01-01	Paper
scientific article; zbMATH DE number 3490440 (Why is no real title available?)	1974-01-01	Paper
Some approaches to best-match file searching	1973-01-01	Paper
scientific article; zbMATH DE number 3564329 (Why is no real title available?)	1973-01-01	Paper
Complexity problems in real time languages	1971-01-01	Paper

Research outcomes over time

This page was built for person: Walter A. Burkhard