scientific article; zbMATH DE number 437558

MaRDI QIDQ3140437zbMATH OpenFDO

Authors Jeanette P. Schmidt, Aravind Srinivasan, Alan Siegel

Publication date 12 December 1994

zbMATH Keywords

approximation algorithms for job-shop schedulingChernoff-Hoeffding boundslimited independencerandomized algorithms for random samplingtail probabilities

Mathematics Subject Classification ID

Foundations of probability theory (60A99) Inequalities; stochastic orderings (60E15) Sums of independent random variables; random walks (60G50)

Recommendations

• Chernoff–Hoeffding Bounds for Applications with Limited Independence
• scientific article; zbMATH DE number 1419210
• scientific article; zbMATH DE number 1833421
• Equitable colorings extend Chernoff-Hoeffding bounds
• A guided tour of Chernoff bounds

Cited in

(22)

• Exploiting storage redundancy to speed up randomized shared memory simulations
• Randomized path coloring on binary trees.
• Uniform generation of NP-witnesses using an NP-oracle
• Singletons for simpletons revisiting windowed backoff with Chernoff bounds
• Sublinear-time distributed algorithms for detecting small cliques and even cycles
• Counting distinct items over update streams
• Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis
• Equitable colorings extend Chernoff-Hoeffding bounds
• An asymptotically least-favorable Chernoff bound for a large class of dependent data processes
• Constructive proofs of concentration bounds
• A contribution to the theory of Chernoff bounds
• Linear classifiers are nearly optimal when hidden variables have diverse effects
• scientific article; zbMATH DE number 1833421 (Why is no real title available?)
• Chernoff–Hoeffding Bounds for Applications with Limited Independence
• scientific article; zbMATH DE number 852056 (Why is no real title available?)
• Efficient parallel computing with memory faults
• A time-randomness tradeoff for selection in parallel
• THE IONESCU–WAINGER MULTIPLIER THEOREM AND THE ADELES
• Beyond the worst-case bisection bound: Fast sorting and ranking on meshes
• Tight Probability Bounds with Pairwise Independence
• Leveraging parameterized Chernoff bounds for simplified algorithm analyses
• A guided tour of Chernoff bounds

This page was built for publication:

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