Pages that link to "Item:Q4837650"

The following pages link to Chernoff–Hoeffding Bounds for Applications with Limited Independence (Q4837650):

Displaying 50 items.

• Nearly-perfect hypergraph packing is in NC (Q286955) (← links)
• A study on several combination problems of classic shop scheduling and shortest path (Q344790) (← links)
• Competitive throughput in multi-hop wireless networks despite adaptive jamming (Q360275) (← links)
• Cache-oblivious hashing (Q472489) (← links)
• Hölder-type inequalities and their applications to concentration and correlation bounds (Q505059) (← links)
• Approximation algorithms for multiprocessor scheduling under uncertainty (Q613111) (← links)
• Improved parallel approximation of a class of integer programming problems (Q676274) (← links)
• Dynamic dictionaries for multisets and counting filters with constant time operations (Q832853) (← links)
• A note on the distribution of the number of prime factors of the integers (Q975547) (← links)
• Approximability of flow shop scheduling (Q1290640) (← links)
• Makespan minimization in open shops: A polynomial time approximation scheme (Q1290641) (← links)
• A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem (Q1566707) (← links)
• Improved algorithms via approximations of probability distributions (Q1582012) (← links)
• Hoeffding's inequality for sums of dependent random variables (Q1693395) (← links)
• Probabilistic quorum systems (Q1854466) (← links)
• On the approximability of clique and related maximization problems (Q1877696) (← links)
• Sketching asynchronous data streams over sliding windows (Q1954256) (← links)
• Explicit list-decodable codes with optimal rate for computationally bounded channels (Q2029777) (← links)
• Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
• An ensemble extreme learning machine for data stream classification (Q2287500) (← links)
• A constructive proof of a concentration bound for real-valued random variables (Q2308463) (← links)
• Oblivious network RAM and leveraging parallelism to achieve obliviousness (Q2318092) (← links)
• Better streaming algorithms for the maximum coverage problem (Q2322721) (← links)
• The number of rational points of hyperelliptic curves over subsets of finite fields (Q2424286) (← links)
• Collaborate with strangers to find own preferences (Q2471699) (← links)
• Cost-sharing mechanisms for network design (Q2471805) (← links)
• Meet and merge: approximation algorithms for confluent flows (Q2495396) (← links)
• Probabilities of discrepancy between minima of cross-validation, Vapnik bounds and true risks (Q3053683) (← links)
• Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms (Q3196375) (← links)
• Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence (Q3452844) (← links)
• Pseudorandomness via the Discrete Fourier Transform (Q4562280) (← links)
• (Q4638096) (← links)
• On the Bernstein-Hoeffding method (Q4972049) (← links)
• (Q4999109) (← links)
• Optimal Hashing in External Memory (Q5002712) (← links)
• Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q5020727) (← links)
• Fooling Polytopes (Q5066946) (← links)
• A Framework for Adversarially Robust Streaming Algorithms (Q5066953) (← links)
• (Q5090924) (← links)
• Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs (Q5115699) (← links)
• (Q5743421) (← links)
• (Q5743501) (← links)
• How good is a dense shop schedule? (Q5931907) (← links)
• Deterministic Massively Parallel Connectivity (Q6069413) (← links)
• Maximizing Throughput in Flow Shop Real-Time Scheduling (Q6084409) (← links)
• Dynamic dictionaries for multisets and counting filters with constant time operations (Q6103528) (← links)
• Algorithms and lower bounds for comparator circuits from shrinkage (Q6107895) (← links)
• Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q6139831) (← links)
• Tight Probability Bounds with Pairwise Independence (Q6158360) (← links)
• A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints (Q6204660) (← links)