The following pages link to A guided tour of Chernoff bounds (Q915256):
Displaying 50 items.
- Concurrent imitation dynamics in congestion games (Q287990) (← links)
- Approximating Wardrop equilibria with finitely many agents (Q352247) (← links)
- Randomised broadcasting: memory vs. randomness (Q391757) (← links)
- Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model (Q399890) (← links)
- Book review of: D. P. Dubhashi and A. Panconesi, Concentration of measure for the analysis of randomized algorithms. (Q465657) (← links)
- The cook-book approach to the differential equation method (Q465658) (← links)
- Bounded size bias coupling: a gamma function bound, and universal Dickman-function behavior (Q495548) (← links)
- Analysis of local search landscapes for \(k\)-SAT instances (Q626907) (← links)
- Thinning protocols for routing \(h\)-relations over shared media (Q666178) (← links)
- Reliable computations on faulty EREW PRAM (Q671425) (← links)
- A simple randomized parallel algorithm for maximal f-matchings (Q672735) (← links)
- Randomized multipacket routing and sorting on meshes (Q675295) (← links)
- Fast randomized parallel methods for planar convex hull construction (Q676065) (← links)
- Improved behaviour of tries by adaptive branching (Q685503) (← links)
- On the runtime and robustness of randomized broadcasting (Q838155) (← links)
- Large alphabets and incompressibility (Q845735) (← links)
- Analysis of evolutionary algorithms for the longest common subsequence problem (Q848642) (← links)
- Learning a subclass of regular patterns in polynomial time (Q860829) (← links)
- Agent-based randomized broadcasting in large networks (Q867856) (← links)
- Feasibility and complexity of broadcasting with random transmission failures (Q868959) (← links)
- On the structure and complexity of worst-case equilibria (Q883997) (← links)
- Local event boundary detection with unreliable sensors: analysis of the majority vote scheme (Q897966) (← links)
- Store-and-forward multicast routing on the mesh (Q927394) (← links)
- Randomized strategies for the plurality problem (Q1003477) (← links)
- On randomized broadcasting in star graphs (Q1003763) (← links)
- A practical approximation algorithm for the LMS line estimator (Q1019876) (← links)
- Optimal many-to-one routing on the mesh with constant queues (Q1044696) (← links)
- Broadcasting in complete networks with faulty nodes using unreliable calls (Q1183465) (← links)
- On the greedy algorithm for satisfiability (Q1198012) (← links)
- On the computational power of depth-2 circuits with threshold and modulo gates (Q1269909) (← links)
- Sorting in linear time? (Q1273863) (← links)
- 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)
