Know When to Persist: Deriving Value from a Stream Buffer

DOI10.1007/978-3-319-41168-2_9zbMath1476.68308OpenAlexW2338813786MaRDI QIDQ2830062

George Karakostas, Konstantinos Georgiou, Danny Krizanc, Evangelos Kranakis

Publication date: 9 November 2016

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-41168-2_9

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Know when to persist: deriving value from a stream buffer

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The infinite secretary problem
• The space complexity of approximating the frequency moments
• Who solved the secretary problem
• Know when to persist: deriving value from a stream buffer
• A new secretary problem with rank-based selection and cardinal payoffs
• Submodular secretary problem and extensions
• Approximate counting of inversions in a data stream
• The Secretary Problem and Its Extensions: A Review
• A secretary problem with uncertain employment

This page was built for publication: Know When to Persist: Deriving Value from a Stream Buffer