Last update: Thu Sep 27 02:46:39 MDT 2018
@Article{Burkhard:1977:NUP,
author = "W. A. Burkhard",
title = "Non-uniform partial-match file designs",
journal = j-THEOR-COMP-SCI,
volume = "5",
number = "1",
pages = "1--23",
month = aug,
year = "1977",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1975.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Dept. of Appl. Phys. and Information Sci., Computer
Sci. Div., Univ. of California, San Diego, La Jolla,
CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "associative access; average case performance; file
designs; file organisation; inversion retrieval; k
letter words; nonuniform partial match file designs;
queries; retrieval; worst case bounds",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}