An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
type: Item
instance of: scholarly article
title: An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
zbMATH Open document ID: 0625.68044
DOI: 10.1016/0022-0000(86)90043-7
author: J. Ian Munro
published in: Journal of Computer and System Sciences
publication date: 1986-01-01T00:00:00Z
review text: We introduce a data structure that requires only one pointer for every k data values and supports searches in O(log n) time and insertions and deletions in \(O(k+\log n)\) time. By choosing k to be O(log n), pointers can be encoded into the relative order of data values and this technique can be used to support insert, delete and search in \(O(\log^ 2 n)\) time while using only the storage needed for the data.
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 4016202
zbMATH Keywords: data structure
zbMATH Keywords: insertions
zbMATH Keywords: deletions
zbMATH Keywords: pointers
describes a project that uses: heapsort
MaRDI profile type: Publication
full work available at URL: 0022-0000(86)90043-7
OpenAlex ID: W2156305878
cites work: Self-Organizing Heuristics for Implicit Data Structures
cites work: Recursively rotated orders and implicit data structures: A lower bound
cites work: Implicit Data Structures for the Dictionary Problem
cites work: Q4656634
cites work: Implicit data structures for fast search and update
cites work: Q3673089
description: scientific article; zbMATH DE number 4016202