The following pages link to (Q4226453):
Displayed 40 items.
- Towards a scalable and robust DHT (Q733718) (← links)
- On the stabbing number of a random Delaunay triangulation (Q857055) (← links)
- Talagrand's inductive method and isoperimetric inequalities involving random sets (Q927360) (← links)
- Unsupervised slow subspace-learning from stationary processes (Q950200) (← links)
- Exponential inequalities for self-normalized martingales with applications (Q957522) (← links)
- Dominated concentration (Q962028) (← links)
- Average-case analysis for the MAX-2SAT problem (Q964385) (← links)
- Robust random number generation for peer-to-peer systems (Q1004308) (← links)
- Rate of relaxation for a mean-field zero-range process (Q1024889) (← links)
- Random regular graphs of non-constant degree: concentration of the chromatic number (Q1043588) (← links)
- Concentration of measure and cluster analysis. (Q1423105) (← links)
- Concentration inequalities using the entropy method (Q1431503) (← links)
- Laws of large numbers and tail inequalities for random tries and PATRICIA trees (Q1612291) (← links)
- The symmetry in the martingale inequality (Q1612953) (← links)
- Moment inequalities for functions of independent random variables (Q1775439) (← links)
- Expected worst-case partial match in random quadtries (Q1827855) (← links)
- Graph imperfection. II (Q1850632) (← links)
- Concentration inequalities, large and moderate deviations for self-normalized empirical processes (Q1872304) (← links)
- Independent transversals in locally sparse graphs (Q2384801) (← links)
- An exponential inequality for autoregressive processes in adaptive tracking (Q2461350) (← links)
- Local tail bounds for functions of independent random variables (Q2468424) (← links)
- Broadcast in the rendezvous model (Q2495650) (← links)
- On the maximum queue length in the supermarket model (Q2496955) (← links)
- Adaptive sampling schemes for density estimation (Q2498749) (← links)
- Concentration inequalities for dependent random variables via the martingale method (Q2519678) (← links)
- Structure and complexity of extreme Nash equilibria (Q2570130) (← links)
- On the power of two choices: balls and bins in continuous time (Q2572391) (← links)
- Concentration of the hypergeometric distribution (Q2576379) (← links)
- Shannon sampling. II: Connections to learning theory (Q2581447) (← links)
- Local Rademacher complexities (Q2583411) (← links)
- On the number of iterations required by Von Neumann addition (Q2771496) (← links)
- Theory of Classification: a Survey of Some Recent Advances (Q3373749) (← links)
- Concentration for self-bounding functions and an inequality of Talagrand (Q3419607) (← links)
- Coloring Graphs with Minimal Edge Load (Q3439119) (← links)
- Regular and General Resolution: An Improved Separation (Q3502715) (← links)
- Following the Perturbed Leader to Gamble at Multi-armed Bandits (Q3520057) (← links)
- Shannon sampling and function reconstruction from point values (Q4813564) (← links)
- An Improved Multi-set Algorithm for the Dense Subset Sum Problem (Q5387614) (← links)
- On an online random k‐SAT model (Q5436980) (← links)
- A Geometric Preferential Attachment Model of Networks II (Q5458299) (← links)