The following pages link to Probability and Computing (Q5463630):
Displaying 50 items.
- Asymptotic existence of proportionally fair allocations (Q277310) (← links)
- Measuring the impact of adversarial errors on packet scheduling strategies (Q282242) (← links)
- The complexity of counting locally maximal satisfying assignments of Boolean CSPs (Q284575) (← links)
- Simple and optimal randomized fault-tolerant rumor spreading (Q287985) (← links)
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- Runtime analysis of non-elitist populations: from classical optimisation to partial information (Q306486) (← links)
- The impact of random initialization on the runtime of randomized search heuristics (Q306492) (← links)
- Information geometry approach to parameter estimation in Markov chains (Q309718) (← links)
- A unified framework for linear dimensionality reduction in L1 (Q310869) (← links)
- The union-closed sets conjecture almost holds for almost all random bipartite graphs (Q326659) (← links)
- Succinct posets (Q329288) (← links)
- Impact of fairness and heterogeneity on delays in large-scale centralized content delivery systems (Q335907) (← links)
- Random convolution of inhomogeneous distributions with \(\mathcal {O} \)-exponential tail (Q340814) (← links)
- Approximation of smallest linear tree grammar (Q342719) (← links)
- \((\alpha,\tau )\)-monitoring for event detection in wireless sensor networks (Q346476) (← links)
- Time efficient \(k\)-shot broadcasting in known topology radio networks (Q352244) (← links)
- Stochastic enumeration method for counting NP-hard problems (Q352890) (← links)
- Efficient and robust associative memory from a generalized Bloom filter (Q353819) (← links)
- A general model and thresholds for random constraint satisfaction problems (Q359981) (← links)
- External-memory multimaps (Q378243) (← links)
- Unbounded contention resolution in multiple-access channels (Q378254) (← links)
- A random sampling approach to worst-case design of structures (Q381813) (← links)
- The limits of tractability in resolution-based propositional proof systems (Q408157) (← links)
- Running time analysis of ant colony optimization for shortest path problems (Q414437) (← links)
- Going around in circles (Q419506) (← links)
- The use of tail inequalities on the probable computational time of randomized search heuristics (Q428911) (← links)
- Pattern hit-and-run for sampling efficiently on polytopes (Q433826) (← links)
- Efficient Monte Carlo for high excursions of Gaussian random fields (Q433910) (← links)
- Shape matching by random sampling (Q441886) (← links)
- Revisiting randomized parallel load balancing algorithms (Q442270) (← links)
- Loosely-stabilizing leader election in a population protocol model (Q442276) (← links)
- Book review of: D. P. Dubhashi and A. Panconesi, Concentration of measure for the analysis of randomized algorithms. (Q465657) (← links)
- The cook-book approach to the differential equation method (Q465658) (← links)
- Derandomization in game-theoretic probability (Q468727) (← links)
- Rigorous error control methods for estimating means of bounded random variables (Q473522) (← links)
- Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons (Q476439) (← links)
- Competitive analysis of maintaining frequent items of a stream (Q476837) (← links)
- Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances (Q477078) (← links)
- Fast distributed PageRank computation (Q477098) (← links)
- The mean-field computation in a supermarket model with server multiple vacations (Q481355) (← links)
- The dropout learning algorithm (Q490652) (← links)
- Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem (Q494929) (← links)
- Approximation of grammar-based compression via recompression (Q500975) (← links)
- Block-structured supermarket models (Q503021) (← links)
- Improved and simplified inapproximability for \(k\)-means (Q506167) (← links)
- Graph cuts with interacting edge weights: examples, approximations, and algorithms (Q517305) (← links)
- Doing-it-all with bounded work and communication (Q529041) (← links)
- On the number of binary-minded individuals required to compute \(\sqrt {\frac 12}\) (Q533865) (← links)
- Exact computation of minimum sample size for estimation of binomial parameters (Q538110) (← links)
- On success runs of length exceeded a threshold (Q539513) (← links)
