Concentration of Measure for the Analysis of Randomized Algorithms
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Robust random number generation for peer-to-peer systems
- Upper tails for arithmetic progressions in random subsets
- Partial sorting problem on evolving data
- Supersaturation in posets and applications involving the container method
- On concentration inequalities and their applications for Gibbs measures in lattice systems
- Cliques enumeration and tree-like resolution proofs
- Security of the blockchain against long delay attack
- Unifying leakage models: from probing attacks to noisy leakage
- Minimizing locality of one-way functions via semi-private randomized encodings
- Roots of random polynomials with coefficients of polynomial growth
- A simple ant colony optimizer for stochastic shortest path problems
- Input locality and hardness amplification
- On separating points by lines
- A note on new Bernstein-type inequalities for the log-likelihood function of Bernoulli variables
- An analysis of the superiorization method via the principle of concentration of measure
- A sharp threshold for bootstrap percolation in a random hypergraph
- On the spread of influence in graphs
- Tight time-space lower bounds for finding multiple collision pairs and their applications
- Singletons for simpletons revisiting windowed backoff with Chernoff bounds
- Some implications of interval approach to dimension for network complexity
- Correlations of random classifiers on large data sets
- Efficient and competitive broadcast in multi-channel radio networks
- Transportation inequalities for stochastic heat equation with rough dependence in space
- An optimal uniform concentration inequality for discrete entropies on finite alphabets in the high-dimensional setting
- Online load balancing with general reassignment cost
- On the volume of unit balls of finite-dimensional Lorentz spaces
- Greed is good for deterministic scale-free networks
- Step-by-step community detection in volume-regular graphs
- Threshold behavior of bootstrap percolation
- Universal arrays
- Finite sample performance of linear least squares estimation
- Windowed backoff algorithms for WiFi: theory and performance under batched arrivals
- Faster rumor spreading with multiple calls
- Talagrand concentration inequalities for stochastic heat-type equations under uniform distance
- Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming
- The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time
- Distribution and asymptotic behavior of the phylogenetic transfer distance
- The linear hidden subset problem for the \((1 + 1)\) EA with scheduled and adaptive mutation rates
- Noisy rumor spreading and plurality consensus
- Computing majority by constant depth majority circuits with low fan-in gates
- Quantitative static analysis of communication protocols using abstract Markov chains
- Parameterized clique on inhomogeneous random graphs
- Distributed coloring algorithms for triangle-free graphs
- Efficient algorithms for privately releasing marginals via convex relaxations
- Exponentially improved algorithms and lower bounds for testing signed majorities
- On the efficiency of a randomized mirror descent algorithm in online optimization problems
- Limit theory for the Gilbert graph
- Fast primal-dual distributed algorithms for scheduling and matching problems
- Kantorovich duality for general transport costs and applications
- Who are you? Secure identities in single hop ad hoc networks
- I/O-efficient similarity join
- On smoothed analysis of quicksort and Hoare's find
- Gaussian concentration and uniqueness of equilibrium states in lattice systems
- Parallel load balancing on constrained client-server topologies
- The loss of serving in the dark
- Bankrupting Sybil despite churn
- Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems
- Universality of random graphs and rainbow embedding
- Routing in undirected graphs with constant congestion
- Learning hurdles for sleeping experts
- Trigger detection for adaptive scientific workflows using percentile sampling
- Subsampling in smoothed range spaces
- Rumor spreading on random regular graphs and expanders
- Simple and optimal randomized fault-tolerant rumor spreading
- Lower bounds for depth-4 formulas computing iterated matrix multiplication
- Push is Fast on Sparse Random Graphs
- Edge-disjoint rainbow spanning trees in complete graphs
- Fast error-tolerant quartet phylogeny algorithms
- Runtime analysis of probabilistic programs with unbounded recursion
- Runtime analysis of non-elitist populations: from classical optimisation to partial information
- Concentration of first hitting times under additive drift
- Open and closed random walks with fixed edgelengths in \(\mathbf{\mathbb{R}^d}\)
- A tail bound for read-k families of functions
- Universality of random permutations
- An Improved Bound for Random Binary Search Trees with Concurrent Insertions
- The Kőnig graph process
- Connectivity oracles for graphs subject to vertex failures
- Serving in the dark should be done non-uniformly
- Ultra-fast load balancing on scale-free networks
- On the diameter of hyperbolic random graphs
- List coloring triangle-free hypergraphs
- Fast Output-Sensitive Matrix Multiplication
- scientific article; zbMATH DE number 5764927 (Why is no real title available?)
- Secrecy results for compound wiretap channels
- Improved approximation of linear threshold functions
- Fast error-tolerant quartet phylogeny algorithms
- Balls into bins with related random choices
- Near-optimal bounds on the bounded-round quantum communication complexity of disjointness
- On the diameter of hyperbolic random graphs
- Average-case lower bounds and satisfiability algorithms for small threshold circuits
- Anomaly Detection and Classification for Streaming Data using PDEs
- Mutation, Sexual Reproduction and Survival in Dynamic Environments
- Random walks in polytopes and negative dependence
- Small-depth multilinear formula lower bounds for iterated matrix multiplication with applications
- Book review of: D. P. Dubhashi and A. Panconesi, Concentration of measure for the analysis of randomized algorithms.
- The cook-book approach to the differential equation method
- Global majority consensus by local majority polling on graphs of a given degree sequence
- Explosive percolation in Erdős-Rényi-like random graph processes
- A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem
- From monetary to nonmonetary mechanism design via artificial currencies
This page was built for publication: Concentration of Measure for the Analysis of Randomized Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5896979)
