Parallel comparison algorithms for approximation problems
From MaRDI portal
Publication:808727
DOI10.1007/BF01206355zbMATH Open0732.68085OpenAlexW2067729110MaRDI QIDQ808727FDOQ808727
Authors: Noga Alon, Yossi Azar 
Publication date: 1991
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01206355
Recommendations
approximate sortingapproximation problemsapproximate mergingapproximate maximum problemparallel comparison tree
Cites Work
- Title not available (Why is that?)
- Parallelism in Comparison Problems
- Routing, merging, and sorting on parallel models of computation
- Tight Comparison Bounds on the Complexity of Parallel Sorting
- Finding an Approximate Maximum
- Finding the maximum, merging, and sorting in a parallel computation model
- Parallel selection
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
- Sorting, Approximate Sorting, and Searching in Rounds
- Sorting and Selecting in Rounds
- Sorting in one round
- Parallel sorting
- Parallel Sorting with Constant Time for Comparisons
- Sorting and Merging in Rounds
- Graphs whose every transitive orientation contains almost every relation
- Searching, Merging, and Sorting in Parallel Computation
Cited In (10)
- Finding an approximate median with high probability in constant parallel time
- A comparative analysis of the convergence regions for different parallel affine projection algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Transforming comparison model lower bounds to the parallel-random-access-machine
- Title not available (Why is that?)
- Strategy-accurate parallel Buchberger algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- The acyclic orientation game on random graphs
This page was built for publication: Parallel comparison algorithms for approximation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808727)
