Walter A. Burkhard

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 Information Processing Letters	2009-12-18	Paper
DOUBLE HASHING WITH MULTIPLE PASSBITS International Journal of Foundations of Computer Science	2005-10-19	Paper
A proof of the optimality of the MIN paging algorithm using linear programming duality Operations Research Letters	1996-10-20	Paper
On a complexity-based way of constructivizing the recursive functions Studia Logica	1990-01-01	Paper
Interpolation-based index maintenance BIT	1983-01-01	Paper
Inherent complexity trade-offs for range query problems Theoretical Computer Science	1981-01-01	Paper
Non-uniform partial-match file designs Theoretical Computer Science	1978-01-01	Paper
Associative retrieval trie hash-coding Journal of Computer and System Sciences	1977-01-01	Paper
Efficient Algorithms for (3,1) Graphs Information Sciences	1977-01-01	Paper
scientific article; zbMATH DE number 3569868 (Why is no real title available?)	1976-01-01	Paper
Partial match retrieval BIT	1976-01-01	Paper
Heuristics for partial-match retrieval data base design Information Processing Letters	1976-01-01	Paper
Nonrecursive traversals of trees The Computer Journal	1975-01-01	Paper
Full table quadratic quotient searching The Computer Journal	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
scientific article; zbMATH DE number 3564329 (Why is no real title available?)	1973-01-01	Paper
Some approaches to best-match file searching Communications of the ACM	1973-01-01	Paper
Complexity problems in real time languages Information Sciences	1971-01-01	Paper

Research outcomes over time

This page was built for person: Walter A. Burkhard