Title :
Insertion Networks
Author :
Davio, M. ; Ronse, C.
Author_Institution :
Philips Research Laboratory, 2, Ave. Van Becelaere, Box 8, 1170 Brussels, Belgium.
fDate :
6/1/1985 12:00:00 AM
Abstract :
The problem of inserting an item in a list is frequently encountered in various application fields such as sorting, compiling, etc. It is shown that the insertion of an item in a list of N members may be realized at a cost proportional to N and within a delay proportional to log N.
Keywords :
Algorithm design and analysis; Binary search trees; Binary trees; Circuits; Computer science; Costs; Delay effects; Parallel algorithms; Sorting; Velocity measurement; Computational complexity; memories; permutation networks;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1985.5009412
