Diffusion Limits in the Online Subsequence Selection Problems

DOI10.4230/LIPICS.AOFA.2020.14OpenAlexW3037678700MaRDI QIDQ5874413FDOQ5874413

Authors: Amirlan Seksenbayev, Alexander Gnedin 

Publication date: 7 February 2023

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2020/12044/pdf/LIPIcs-AofA-2020-14.pdf/

zbMATH Keywords

bin packinglongest increasing subsequencesequential optimisationfunctional limitfluctuations in the selection process

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Cited In (2)

• Online Selection of Alternating Subsequences from a Random Sample
• Asymptotics and renewal approximation in the online selection of increasing subsequence

This page was built for publication: Diffusion Limits in the Online Subsequence Selection Problems

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