Padded lists revisited

We study a data structure ${\bf L}$ referred to variously as a padded list, controlled density array or sparse table containing records $\{ R_i \} $ each uniquely identified by a key $\{ k(R_i )\} $. ${\bf L}$ is required to support the operations Search $({\bf L},k)$, Insert $({\bf L},k)$ and Delet...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on computing 1987-12, Vol.16 (6), p.1073-1114
Hauptverfasser:	HOFRI, M, KONHEIM, A. G
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Combinatorics. Ordered structures Computer science Designs and configurations Efficiency Exact sciences and technology Mathematics Sciences and techniques of general use
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!