Deterministic parallel algorithms for bilinear objective functions
From MaRDI portal
Publication:666681
DOI10.1007/s00453-018-0471-0zbMath1418.68237arXiv1711.08494OpenAlexW2963080349WikidataQ129650248 ScholiaQ129650248MaRDI QIDQ666681
Publication date: 11 March 2019
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.08494
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10) Randomized algorithms (68W20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pseudorandom generators for space-bounded computation
- Removing randomness in parallel computation without a processor penalty
- \(\text{RL}\subseteq \text{SC}\)
- The probabilistic method yields deterministic parallel algorithms
- Improved algorithms via approximations of probability distributions
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Extensions of Lipschitz mappings into a Hilbert space
- Algorithmic derandomization via complexity theory
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- Simulating (log c n )-wise independence in NC
- The Fourth Moment Method
- Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovász Local Lemma
- A Fast Derandomization Scheme and Its Applications
- Minimization of ±1 matrices under line shifts
This page was built for publication: Deterministic parallel algorithms for bilinear objective functions
