An analysis of Las Vegas algorithms for linear search

DOI10.1142/S0129054125500042MaRDI QIDQ6881005zbMATH OpenFDO

Authors A. Subramani, K. Subramani

Publication date 18 December 2025

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

bit complexitypartition-based algorithmYao's minimax principlelinear searchcomparison complexity

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10)

This page was built for publication: An analysis of Las Vegas algorithms for linear search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6881005)