Pages that link to "Item:Q1270418"

The following pages link to Probabilistic methods for algorithmic discrete mathematics (Q1270418):

Displaying 46 items.

• Randomized approximation for the set multicover problem in hypergraphs (Q262245) (← links)
• Improved recovery guarantees for phase retrieval from coded diffraction patterns (Q347510) (← links)
• On dynamic monopolies of graphs with general thresholds (Q409449) (← links)
• Soft memberships for spectral clustering, with application to permeable language distinction (Q955819) (← links)
• Window-games between TCP flows (Q982652) (← links)
• Data-driven robust chance constrained problems: a mixture model approach (Q1626548) (← links)
• Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs (Q1756034) (← links)
• Curve reconstruction from noisy samples (Q1775779) (← links)
• A scaling limit for the length of the longest cycle in a sparse random graph (Q1998764) (← links)
• Spectrum of heavy-tailed elliptic random matrices (Q2082701) (← links)
• Tree/endofunction bijections and concentration inequalities (Q2144318) (← links)
• Concentration of Markov chains indexed by trees (Q2157456) (← links)
• Covering the edges of a random hypergraph by cliques (Q2158205) (← links)
• Central moment inequalities using Stein's method (Q2201505) (← links)
• Faster rumor spreading with multiple calls (Q2256120) (← links)
• Cover time in edge-uniform stochastically-evolving graphs (Q2283819) (← links)
• Quantized compressed sensing for random circulant matrices (Q2330944) (← links)
• Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma (Q2333832) (← links)
• Counting in one-hop beeping networks (Q2420611) (← links)
• RIPless compressed sensing from anisotropic measurements (Q2437334) (← links)
• Average case recovery analysis of tomographic compressive sensing (Q2437338) (← links)
• Semi-supervised statistical region refinement for color image segmentation (Q2485064) (← links)
• Broadcast in the rendezvous model (Q2495650) (← links)
• Approximation schemes for scheduling and covering on unrelated machines (Q2503309) (← links)
• Radiocoloring in planar graphs: Complexity and approximations (Q2566036) (← links)
• A novel giant-subgraph phase-transition in sparse random \(k\)-partite graphs (Q2581553) (← links)
• The loss of serving in the dark (Q2680226) (← links)
• Critical window for the vacant set left by random walk on random regular graphs (Q2856577) (← links)
• Packing tight Hamilton cycles in 3-uniform hypergraphs (Q2884005) (← links)
• Packing hamilton cycles in random and pseudo-random hypergraphs (Q2909240) (← links)
• ON DYNAMIC MONOPOLIES OF GRAPHS WITH PROBABILISTIC THRESHOLDS (Q2933686) (← links)
• (Q3390429) (← links)
• Serving in the Dark should be done Non-Uniformly (Q3448776) (← links)
• Compressing Interactive Communication Under Product Distributions (Q4637503) (← links)
• Bisecting sparse random graphs (Q4761356) (← links)
• Visualization of Distributed Algorithms Based on Graph Relabelling Systems1 1This work has been supported by the European TMR research network GETGRATS, and by the “Conseil Régional d' Aquitane”. (Q4921550) (← links)
• Combinatorial anti-concentration inequalities, with applications (Q4958638) (← links)
• An improved upper bound on the density of universal random graphs (Q4982616) (← links)
• (Q5026476) (← links)
• Dynamic Double Auctions: Toward First Best (Q5106370) (← links)
• A General Framework for Graph Sparsification (Q5232324) (← links)
• Window-Games between TCP Flows (Q5459975) (← links)
• (Q5743376) (← links)
• A scaling limit for the length of the longest cycle in a sparse random digraph (Q6074672) (← links)
• Maximal inequalities and some applications (Q6158179) (← links)
• Distributionally robust Weber problem with uncertain demand (Q6175466) (← links)