Leveraging parameterized Chernoff bounds for simplified algorithm analyses

IF 0.7 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters Pub Date : 2024-06-12 DOI:10.1016/j.ipl.2024.106516

Michael Dillencourt , Michael T. Goodrich , Michael Mitzenmacher

引用次数: 0

Abstract

In this paper, we derive parameterized Chernoff bounds and show their applications for simplifying the analysis of some well-known probabilistic algorithms and data structures. The parameterized Chernoff bounds we provide give probability bounds that are powers of two, with a clean formulation of the relation between the constant in the exponent and the relative distance from the mean. In addition, we provide new simplified analyses with these bounds for hash tables, randomized routing, and a simplified, non-recursive adaptation of the Floyd-Rivest selection algorithm.

查看原文本刊更多论文

利用参数化切尔诺夫边界简化算法分析

在本文中，我们推导了参数化的切尔诺夫边界，并展示了它们在简化一些著名概率算法和数据结构分析中的应用。我们提供的参数化切尔诺夫边界给出了二的幂的概率边界，并对指数中的常数和与均值的相对距离之间的关系进行了简洁的表述。此外，我们还利用这些边界为散列表、随机路由和简化的非递归 Floyd-Rivest 选择算法提供了新的简化分析。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Information Processing Letters 工程技术-计算机：信息系统

CiteScore

1.80

自引率

0.00%

发文量

审稿时长

7.3 months

期刊介绍： Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered. Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.