The following pages link to A guided tour of Chernoff bounds (Q915256):
Displayed 50 items.
- Combining fuzzy information from multiple systems (Q1305924) (← links)
- A provably fast linear-expected-time maxima-finding algorithm (Q1329142) (← links)
- Finding a target subnetwork in sparse networks with random faults (Q1334631) (← links)
- Exploiting storage redundancy to speed up randomized shared memory simulations (Q1365933) (← links)
- Exploiting few inversions when sorting: Sequential and parallel algorithms (Q1365941) (← links)
- Upper and lower bounds for some depth-3 circuit classes (Q1377575) (← links)
- Optimal bounds for the approximation of Boolean functions and some applications (Q1390872) (← links)
- Analysis and application of adaptive sampling (Q1394792) (← links)
- Faster deterministic sorting through better sampling. (Q1401197) (← links)
- Sparse networks tolerating random faults. (Q1427202) (← links)
- Covering lattice points by subspaces and counting point-hyperplane incidences (Q1716001) (← links)
- Power-law partial correlation network models (Q1786580) (← links)
- Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions. (Q1853460) (← links)
- On the decisional complexity of problems over the reals (Q1854429) (← links)
- Distributed probabilistic polling and applications to proportionate agreement (Q1854483) (← links)
- On counting point-hyperplane incidences (Q1873152) (← links)
- On learning monotone DNF under product distributions (Q1881232) (← links)
- Blinking model and synchronization in small-world networks with a time-varying coupling (Q1885841) (← links)
- Randomized search trees (Q1923861) (← links)
- Feasible reductions to Kolmogorov-Loveland stochastic sequences (Q1960665) (← links)
- Cautious active clustering (Q2036490) (← links)
- Percolation of new products (Q2067106) (← links)
- Detecting a botnet in a network (Q2078962) (← links)
- Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion (Q2095166) (← links)
- Spanning surfaces in \(3\)-graphs (Q2119367) (← links)
- Estimating the interaction graph of stochastic neuronal dynamics by observing only pairs of neurons (Q2137756) (← links)
- A cell-based population control of Monte Carlo particles for the global variance reduction for transport equations (Q2162008) (← links)
- Communication complexity of quasirandom rumor spreading (Q2354024) (← links)
- Balanced allocation and dictionaries with tightly packed constant size bins (Q2373735) (← links)
- Fast message dissemination in random geometric networks (Q2375822) (← links)
- Resolving Braess's paradox in random networks (Q2408090) (← links)
- Radio communication in random graphs (Q2495397) (← links)
- Posterior contraction in sparse Bayesian factor models for massive covariance matrices (Q2510828) (← links)
- Improved inequalities for the Poisson and binomial distribution and upper tail quantile functions (Q2510939) (← links)
- Ramsey functions involving \(K_{m,n}\) with \(n\) large (Q2570109) (← links)
- Locally consistent constraint satisfaction problems (Q2581264) (← links)
- Randomized allocation processes (Q2746211) (← links)
- Reliable Broadcasting in Hypercubes with Random Link and Node Failures (Q2785368) (← links)
- The diameter and connectivity of networks with random dependent faults (Q3057173) (← links)
- Efficient Broadcasting in Random Power Law Networks (Q3057632) (← links)
- PKDPA: An Enhanced Probabilistic Differential Power Attack Methodology (Q3104719) (← links)
- FAST BROADCASTING WITH BYZANTINE FAULTS (Q3421854) (← links)
- Flit-serial packet routing on meshes and tori (Q3445270) (← links)
- SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS (Q3521590) (← links)
- Kahane-Khinchin type averages (Q3533882) (← links)
- On Radio Broadcasting in Random Geometric Graphs (Q3540232) (← links)
- Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes (Q3599076) (← links)
- Fast diagnosis of multiprocessor systems with random faults (Q4288202) (← links)
- A probably fast, provably optimal algorithm for rectilinear Steiner trees (Q4312746) (← links)
- An Upper Bound on the Space Complexity of Random Formulae in Resolution (Q4405552) (← links)