Probabilistic methods for algorithmic discrete mathematics
From MaRDI portal
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to probability theory (60-06) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06)
Cited in
(53)- Visualization of distributed algorithms based on graph relabelling systems
- Combinatorial anti-concentration inequalities, with applications
- Dimension reduction for finite trees in \(\ell_1\)
- Randomized approximation for the set multicover problem in hypergraphs
- On dynamic monopolies of graphs with general thresholds
- A scaling limit for the length of the longest cycle in a sparse random digraph
- Packing tight Hamilton cycles in 3-uniform hypergraphs
- Packing Hamilton cycles in random and pseudo-random hypergraphs
- A novel giant-subgraph phase-transition in sparse random \(k\)-partite graphs
- On dynamic monopolies of graphs with probabilistic thresholds
- RIPless compressed sensing from anisotropic measurements
- Faster rumor spreading with multiple calls
- Critical window for the vacant set left by random walk on the configuration model
- A general framework for graph sparsification
- Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma
- Window-games between TCP flows
- An improved upper bound on the density of universal random graphs
- Cover time in edge-uniform stochastically-evolving graphs
- Serving in the dark should be done non-uniformly
- Dynamic double auctions: toward first best
- Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs
- scientific article; zbMATH DE number 7771747 (Why is no real title available?)
- Maximal inequalities and some applications
- Tree/endofunction bijections and concentration inequalities
- scientific article; zbMATH DE number 1197458 (Why is no real title available?)
- Distributionally robust Weber problem with uncertain demand
- Quantized compressed sensing for random circulant matrices
- Probabilistic-algebraic algorithms of Monte Carlo methods
- Covering the edges of a random hypergraph by cliques
- Approximation schemes for scheduling and covering on unrelated machines
- Semi-supervised statistical region refinement for color image segmentation
- On weak twins and up-and-down sub-permutations
- Counting in one-hop beeping networks
- Window-Games between TCP Flows
- Average case recovery analysis of tomographic compressive sensing
- Broadcast in the rendezvous model
- scientific article; zbMATH DE number 1643840 (Why is no real title available?)
- Critical window for the vacant set left by random walk on random regular graphs
- Compressing interactive communication under product distributions
- Soft memberships for spectral clustering, with application to permeable language distinction
- A scaling limit for the length of the longest cycle in a sparse random graph
- Cross-validation on extreme regions
- Improved recovery guarantees for phase retrieval from coded diffraction patterns
- The loss of serving in the dark
- Curve reconstruction from noisy samples
- Ordered unavoidable sub-structures in matchings and random matchings
- Bisecting sparse random graphs
- Spectrum of heavy-tailed elliptic random matrices
- Radiocoloring in planar graphs: Complexity and approximations
- Data-driven robust chance constrained problems: a mixture model approach
- Central moment inequalities using Stein's method
- Concentration of Markov chains indexed by trees
- A strengthened asymptotic uniform distribution property
This page was built for publication: Probabilistic methods for algorithmic discrete mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1270418)
