Probability and Computing
From MaRDI portal
Publication:5463630
Markov processesMartingalesRandom graphsHashingMarkov ChainsDiscrete probability theoryContinuous random variables
Computational methods for problems pertaining to probability theory (60-08) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Analysis of algorithms (68W40) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Combinatorial probability (60C05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to probability theory (60-01)
Recommendations
- Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
- Design and analysis of randomized algorithms. Introduction to design paradigms.
- scientific article; zbMATH DE number 1566488
- Concentration of Measure for the Analysis of Randomized Algorithms
- scientific article; zbMATH DE number 819814
Cited in
(only showing first 100 items - show all)- The complexity of computing a bisimilarity pseudometric on probabilistic automata
- Discrete probability models and methods. Probability on graphs and trees, Markov chains and random fields, entropy and coding
- On the use of smoothing to improve the performance of the splitting method
- On the asymptotic behavior of a sequence of random variables of interest in the classical occupancy problem
- Simple and Efficient Leader Election
- Exact camera location recovery by least unsquared deviations
- Cryptanalysis of a dynamic universal accumulator over bilinear groups
- A survey of the modified Moran process and evolutionary graph theory
- Disproving the normal graph conjecture
- Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial
- Improved random graph isomorphism
- High-dimensional approximate \(r\)-nets
- Poisson hyperplane processes and approximation of convex bodies
- Probability and random number. A first guide to randomness
- Long-term balanced allocation via thinning
- The directed spanning forest in the hyperbolic space
- Approximate counting of standard set-valued tableaux
- Maximum throughput of multiple access channels in adversarial environments
- Leader election in well-connected graphs
- Mean field equilibria for resource competition in spatial settings
- Rank of random half-integral polytopes. Extended abstract
- Models of smoothing in dynamic networks
- Mechanism design for correlated valuations: efficient methods for revenue maximization
- scientific article; zbMATH DE number 7626779 (Why is no real title available?)
- Noisy rumor spreading and plurality consensus
- Island models meet rumor spreading
- Efficiently approximating the probability of deadline misses in real-time systems
- Deterministic polynomial approach in the plane
- Self-stabilizing repeated balls-into-bins
- The smoothed number of Pareto-optimal solutions in bicriteria integer optimization
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
- Fast Distributed Approximation for Max-Cut
- On the number of binary-minded individuals required to compute \(\sqrt {\frac 12}\)
- Exact computation of minimum sample size for estimation of binomial parameters
- A self-stabilizing algorithm for cut problems in synchronous networks
- From one to many rainbow Hamiltonian cycles
- Robust gossiping with an application to consensus
- Strong algorithms for the ordinal matroid secretary problem
- Competitive clustering of stochastic communication patterns on a ring
- Coping with silent errors in HPC applications
- Concentration and moment inequalities for polynomials of independent random variables
- Eigenvector-based identification of bipartite subgraphs
- Unbounded contention resolution in multiple-access channels
- Fair Influence Maximization in Large-scale Social Networks Based on Attribute-aware Reverse Influence Sampling
- Coordination problems on networks revisited: statics and dynamics
- Vehicle routing with probabilistic capacity constraints
- Approximate Counting of k-Paths: Deterministic and in Polynomial Space
- Wireless scheduling with partial channel state information: large deviations and optimality
- Perfect matching in random graphs is as hard as Tseitin
- A robust randomized algorithm to perform independent tasks
- Efficient Monte Carlo for high excursions of Gaussian random fields
- Computing the largest bond and the maximum connected cut of a graph
- Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes
- Chebyshev polynomials, moment matching, and optimal estimation of the unseen
- The limits of tractability in resolution-based propositional proof systems
- Smoothed Analysis on Connected Graphs
- Non-standard analysis in dynamic geometry
- Proof complexity and the binary encoding of combinatorial principles
- Efficient decentralized algorithms for the distributed trigger counting problem
- Identifying structural hole spanners to maximally block information propagation
- Range partitioning within sublinear time: algorithms and lower bounds
- Switching competitors reduces win-stay but not lose-shift behaviour: the role of outcome-action association strength on reinforcement learning
- \(\mathbb{Z}_4 \mathbb{Z}_4 \mathbb{Z}_4\)-additive cyclic codes are asymptotically good
- Foundations for entailment checking in quantitative separation logic
- Linking and cutting spanning trees
- The advice complexity of a class of hard online problems
- Sorting and selection on dynamic data
- Hamilton cycles in dense regular digraphs and oriented graphs
- Weakest precondition reasoning for expected run-times of probabilistic programs
- On the uniform random generation of non deterministic automata up to isomorphism
- Multi-twisted additive codes over finite fields are asymptotically good
- Design and analysis of randomized algorithms. Introduction to design paradigms.
- Nearly perfect matchings in uniform hypergraphs
- Fast approximation of betweenness centrality through sampling
- Random Sampling of Trivial Words in Finitely Presented Groups
- Going around in circles
- A communication-efficient private matching scheme in client-server model
- Uniform estimates for almost primes over finite fields
- Limitations of sums of bounded read formulas and ABPs
- Automated category tree construction: hardness bounds and algorithms
- Shape Matching by Random Sampling
- Fast distributed PageRank computation
- On smoothed analysis of quicksort and Hoare's find
- Sublogarithmic test-and-set against a weak adversary
- Spreading messages
- Complexity issues in color-preserving graph embeddings
- A universal online caching algorithm based on pattern matching
- Stability in the self-organized evolution of networks
- Runtime analyses of the population-based univariate estimation of distribution algorithms on LeadingOnes
- Convergence of MCMC and loopy BP in the tree uniqueness region for the hard-core model
- Algorithmics of nonuniformity: tools and paradigms
- Asymptotic existence of proportionally fair allocations
- Multi-partite squash operation and its application to device-independent quantum key distribution
- The complexity of counting locally maximal satisfying assignments of Boolean CSPs
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- Less hashing, same performance: Building a better Bloom filter
- Hybridizing evolutionary algorithms with variable-depth search to overcome local optima
- Populations can be essential in tracking dynamic optima
- Balls into bins via local search: cover time and maximum load
- Improving MinHash via the containment index with applications to metagenomic analysis
This page was built for publication: Probability and Computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5463630)
