scientific article
From MaRDI portal
Publication:3140437
zbMath0802.60044MaRDI QIDQ3140437
Jeanette P. Schmidt, Aravind Srinivasan, Alan R. Siegel
Publication date: 12 December 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
tail probabilitiesChernoff-Hoeffding boundslimited independenceapproximation algorithms for job-shop schedulingrandomized algorithms for random sampling
Inequalities; stochastic orderings (60E15) Sums of independent random variables; random walks (60G50) Foundations of probability theory (60A99)
Related Items
Counting distinct items over update streams, Efficient parallel computing with memory faults, A time-randomness tradeoff for selection in parallel, Sublinear-time distributed algorithms for detecting small cliques and even cycles, Exploiting storage redundancy to speed up randomized shared memory simulations, THE IONESCU–WAINGER MULTIPLIER THEOREM AND THE ADELES, Beyond the worst-case bisection bound: Fast sorting and ranking on meshes, Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis, Linear classifiers are nearly optimal when hidden variables have diverse effects, Randomized path coloring on binary trees., Uniform generation of NP-witnesses using an NP-oracle
