Average complexity of searching for identical objects in random nonuniform databases

DOI10.1515/DMA.2011.023zbMath1243.68171OpenAlexW2317671991MaRDI QIDQ2889732

N. S. Kucherenko

Publication date: 8 June 2012

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.2011.023

zbMATH Keywords

average complexity of optimal algorithms

Mathematics Subject Classification ID

Database theory (68P15) Approximation algorithms (68W25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Information storage and search complexity theory

Cites Work

• Optimum binary search trees
• A New Algorithm for Minimum Cost Binary Trees

This page was built for publication: Average complexity of searching for identical objects in random nonuniform databases