Pages that link to "Item:Q1342858"
From MaRDI portal
The following pages link to The probabilistic method yields deterministic parallel algorithms (Q1342858):
Displaying 22 items.
- Deterministic parallel algorithms for bilinear objective functions (Q666681) (← links)
- Improved parallel approximation of a class of integer programming problems (Q676274) (← links)
- Parallel PROFIT/COST algorithms through fast derandomization (Q1306566) (← links)
- Weighted fractional and integral \(k\)-matching in hypergraphs (Q1346702) (← links)
- Tight approximations for resource constrained scheduling and bin packing (Q1372745) (← links)
- On construction of \(k\)-wise independent random variables (Q1375059) (← links)
- (De)randomized construction of small sample spaces in \(\mathcal{NC}\) (Q1384529) (← links)
- Improved algorithms via approximations of probability distributions (Q1582012) (← links)
- Randomized OBDD-based graph algorithms (Q1625606) (← links)
- Uniform generation of NP-witnesses using an NP-oracle (Q1854397) (← links)
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions (Q1923858) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- Finding a vector orthogonal to roughly half a collection of vectors (Q2479315) (← links)
- Improved algorithms via approximations of probability distributions (extended abstract) (Q2817653) (← links)
- Derandomized Construction of Combinatorial Batch Codes (Q2947886) (← links)
- Lower bounds on black-box reductions of hitting to density estimation (Q3304157) (← links)
- Rosenthal type inequalities for random variables (Q3304667) (← links)
- Small Sample Spaces Cannot Fool Low Degree Polynomials (Q3541801) (← links)
- MODp-tests, almost independence and small probability spaces (Q5047166) (← links)
- Very fast parallel algorithms for approximate edge coloring (Q5929308) (← links)
- On the parallel approximability of a subclass of quadratic programming. (Q5941277) (← links)
- Deterministic Massively Parallel Connectivity (Q6069413) (← links)