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)

Full work available at URL https://doi.org/10.1142/S0129054125500042

zbMATH Keywords

bit complexitycomparison complexitylinear searchpartition-based algorithmYao's minimax principle

Mathematics Subject Classification ID

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

Cites work

• A Gentle Introduction to Game Theory
• Algorithm design: Foundations, analysis, and Internet examples
• Data structures for storing small sets in the bitprobe model
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Introduction to algorithms.
• Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares
• Phenotypes and genotypes. The search for influential genes
• Randomized algorithms for finding the shortest negative cost cycle in networks
• Searching monotone multi-dimensional arrays
• Searching ordered structures
• Stabilizing a System With an Unbounded Random Gain Using Only Finitely Many Bits

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)