Probabilistic methods for algorithmic discrete mathematics

No author found.

Publication date: 21 October 1998

Published in: Algorithms and Combinatorics (Search for Journal in Brave)

Probabilistic methods Algorithmic discrete mathematics

Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Proceedings, conferences, collections, etc. pertaining to probability theory (60-06) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Related Items (47)

Packing tight Hamilton cycles in 3-uniform hypergraphs ⋮ Data-driven robust chance constrained problems: a mixture model approach ⋮ Serving in the Dark should be done Non-Uniformly ⋮ Tree/endofunction bijections and concentration inequalities ⋮ Packing hamilton cycles in random and pseudo-random hypergraphs ⋮ Concentration of Markov chains indexed by trees ⋮ Covering the edges of a random hypergraph by cliques ⋮ Improved recovery guarantees for phase retrieval from coded diffraction patterns ⋮ ON DYNAMIC MONOPOLIES OF GRAPHS WITH PROBABILISTIC THRESHOLDS ⋮ Counting in one-hop beeping networks ⋮ A scaling limit for the length of the longest cycle in a sparse random digraph ⋮ The loss of serving in the dark ⋮ Dynamic Double Auctions: Toward First Best ⋮ On dynamic monopolies of graphs with general thresholds ⋮ Maximal inequalities and some applications ⋮ Distributionally robust Weber problem with uncertain demand ⋮ Central moment inequalities using Stein's method ⋮ RIPless compressed sensing from anisotropic measurements ⋮ Average case recovery analysis of tomographic compressive sensing ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Compressing Interactive Communication Under Product Distributions ⋮ Soft memberships for spectral clustering, with application to permeable language distinction ⋮ Bisecting sparse random graphs ⋮ Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs ⋮ A scaling limit for the length of the longest cycle in a sparse random graph ⋮ Faster rumor spreading with multiple calls ⋮ 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”. ⋮ Semi-supervised statistical region refinement for color image segmentation ⋮ Broadcast in the rendezvous model ⋮ Curve reconstruction from noisy samples ⋮ Window-games between TCP flows ⋮ Approximation schemes for scheduling and covering on unrelated machines ⋮ Cover time in edge-uniform stochastically-evolving graphs ⋮ Combinatorial anti-concentration inequalities, with applications ⋮ Window-Games between TCP Flows ⋮ An improved upper bound on the density of universal random graphs ⋮ A General Framework for Graph Sparsification ⋮ Spectrum of heavy-tailed elliptic random matrices ⋮ Radiocoloring in planar graphs: Complexity and approximations ⋮ Quantized compressed sensing for random circulant matrices ⋮ Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma ⋮ Critical window for the vacant set left by random walk on random regular graphs ⋮ Unnamed Item ⋮ A novel giant-subgraph phase-transition in sparse random \(k\)-partite graphs ⋮ Randomized approximation for the set multicover problem in hypergraphs

This page was built for publication: Probabilistic methods for algorithmic discrete mathematics