Are We Still Missing an Item?

2024/01/12 by Magen, Roey · 1 citation
#Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.2401.06547

Abstract

The missing item problem, as introduced by Stoeckl in his work at SODA 23, focuses on continually identifying a missing element e in a stream of elements e₁, ..., e_ℓ from the set \1,2,...,n\, such that e ≠ e_i for any i ∈ \1,...,ℓ\. Stoeckl's investigation primarily delves into scenarios with ℓ

Cited by

• Shuffling Cards When You Are of Very Little Brain: Low Memory Generation of Permutations

Related

• Finding one excellent element in case of one lie
• Bernoulli amputation
• Conscious and controlling elements in combinatorial group testing problems with more defectives
• Revisiting Concentration of Missing Mass
• Smart elements in combinatorial group testing problems