Abstract
In this paper some properties of binary search networks are studied. The binary search networks constitute an extension of the binary search trees and, as a result, their performance depends on their size. This paper is particulary concerned with a subset of the binary search networks, called vertically convex binary search networks. We give a coded representation of them which allows us to determine the number, the average number of columns and the average right width of such binary search networks having a predetermined area. We also introduce two algorithms to calculate the height and left width of a vertically convex binary search network by means of a linear scanning of its codifying word.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
E. Bender, ”Asymptotic Methods in Enumeration”, SIAM Rev., 16 (1974), 485–514
K. Brinck, ”On Deletions in Threaded Binary Trees”, J. of Algorithms, 7 (1986), 395–411
M. P. Delest, S. Dulucq, ”Enumeration of Directed Column-Convex Animals with Given Perimeter and Area”, rapport LABRI n. 87-15, Université de Bordeaux I, (1987)
D. Gouyou-Beauchamps, G. Viennot, ”Equivalence of the Two-Dimensional Directed Animals Problem to a One-Dimensional Path Problem”, Advances in Applied Mathematics, 9 (1988), 334–357
J. G. Penaud, ”Une Nouvelle bijection pour les Animaux Dirigés”, rapport LABRI n. 89–45, Université de Bordeaux I, (1989)
M. P. Schutzenberger, ”Context-free Languages and Pushdown Automata”, Inf. and Cont., 6 (1963), 246–264
X. G. Viennot, ”Problèmes Combinatoires Posés par la Physique Statistique”, Séminaire Bourbaki, 36ème année, 1983/84, exposé n. 626 in ”Astérisque” 121/122 (1985), 225–246
X. G. Viennot, ”Heaps of Pieces, I: Basic Definitions and Combinatorial Lemmas”, Lecture Notes in Maths, 1234 (1986), 321–350
T. Yuba, M. Hoshi, ”Binary Search Networks: a New Method for Key Searching”, Inform. Process. Letters, 24 (1987), 59–65
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barcucci, E., Pinzani, R., Rodella, E., Sprugnoli, R. (1991). A characterization of binary search networks. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1991. Lecture Notes in Computer Science, vol 529. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54458-5_57
Download citation
DOI: https://doi.org/10.1007/3-540-54458-5_57
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54458-6
Online ISBN: 978-3-540-38391-8
eBook Packages: Springer Book Archive