The following pages link to (Q4856179):
Displaying 50 items.
- On incremental approximate saddle-point computation in zero-sum matrix games (Q286267) (← links)
- Bounding duality gap for separable problems with linear constraints (Q288396) (← links)
- Approximate Max \(k\)-Cut with subgraph guarantee (Q293220) (← links)
- Randomized group testing for mutually obscuring defectives (Q293335) (← links)
- Backwards analysis of the Karger-Klein-Tarjan algorithm for minimum spanning trees (Q293385) (← links)
- Estimating the range of a function in an online setting (Q294695) (← links)
- Worst case examples for operations on OBDDs (Q294746) (← links)
- The impact of random initialization on the runtime of randomized search heuristics (Q306492) (← links)
- Vector Monte Carlo stochastic matrix-based algorithms for large linear systems (Q308409) (← links)
- Grover walks on a line with absorbing boundaries (Q331399) (← links)
- Laplacian versus adjacency matrix in quantum walk search (Q332103) (← links)
- One-dimensional three-state quantum walk with single-point phase defects (Q332581) (← links)
- Computing rarity on uncertain data (Q350968) (← links)
- Stochastic enumeration method for counting NP-hard problems (Q352890) (← links)
- (Approximate) uncertain skylines (Q359874) (← links)
- Identifiability and inference of non-parametric rates-across-sites models on large-scale phylo\-genies (Q376326) (← links)
- Optimal scaling of average queue sizes in an input-queued switch: an open problem (Q383214) (← links)
- Signal-flow-based analysis of wireless security protocols (Q385716) (← links)
- Relativization makes contradictions harder for resolution (Q386151) (← links)
- Fast error-tolerant quartet phylogeny algorithms (Q390892) (← links)
- Streaming algorithms for language recognition problems (Q391078) (← links)
- On testing monomials in multivariate polynomials (Q391220) (← links)
- Algorithmic theory of free solvable groups: randomized computations. (Q402669) (← links)
- New approaches to multi-objective optimization (Q403670) (← links)
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- A note on the generalized min-sum set cover problem (Q408432) (← links)
- Crossover can be constructive when computing unique input-output sequences (Q416273) (← links)
- Sparse reliable graph backbones (Q418121) (← links)
- Some results on approximate 1-median selection in metric spaces (Q418725) (← links)
- Memoryless routing in convex subdivisions: random walks are optimal (Q419369) (← links)
- New constructions of SSPDs and their applications (Q419372) (← links)
- Optimal partition trees (Q420575) (← links)
- A large population size can be unhelpful in evolutionary algorithms (Q428903) (← links)
- Toward a model for backtracking and dynamic programming (Q430838) (← links)
- On rainbow-\(k\)-connectivity of random graphs (Q436344) (← links)
- List update with probabilistic locality of reference (Q436596) (← links)
- Distributed probabilistic inferencing in sensor networks using variational approximation (Q436649) (← links)
- Open quantum random walks (Q438750) (← links)
- The \(K\)-armed dueling bandits problem (Q440003) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- Worst-case equilibria (Q458478) (← 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)
- Cache-oblivious hashing (Q472489) (← 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)
- Dealing with undependable workers in decentralized network supercomputing (Q477093) (← links)
- Randomized sampling for large zero-sum games (Q490542) (← links)
