Abstract
Data may take different forms, depending on the problem to which they pertain, and on the technique used to solve the problem. Such forms are referred to as information structures.
The present study was carried out in cooperation with the Istituto di Elaborazione dell’Informazione del C.N. R., Pisa, Italy.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F.R.A. Hopgood, Compiling Techniques. American Elsevier Publ. Co. New York 1957.
R. Morris, Scatter storage techniques. Communications of the ACM, 11, 1 (Jan. 1968), 38–43.
A.S. Konheim and B. Weiss, An occupancy discipline and applications. SIAM J. Applied Mathematics, 14 (1966), 1266–1274.
W.D. Maurer, An improved hash code for scatter storage. Communications of the ACM, 11, 1 (Jan. 1968), 35–38.
C.E. Radke, The use of quadratic residue research. Communications of the ACM, 13, 2 (Feb. 1970), 103–105.
F. Luccio, Weighted increment linear search for scatter tables. Communications of the ACM, 15, 12 (Dec. 1972), 1045–1047.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1975 CISM, Udine
About this chapter
Cite this chapter
Luccio, F. (1975). Parking Functions and Information Structures. In: Rinaldi, S. (eds) Topics in Combinatorial Optimization. CISM International Centre for Mechanical Sciences, vol 175. Springer, Vienna. https://doi.org/10.1007/978-3-7091-3291-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-7091-3291-3_10
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-81339-3
Online ISBN: 978-3-7091-3291-3
eBook Packages: Springer Book Archive