| Display title | Parallel comparison algorithms for approximation problems |
| Default sort key | Parallel comparison algorithms for approximation problems |
| Page length (in bytes) | 15 |
| Namespace ID | 0 |
| Page ID | 8859031 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 1 |
| Counted as a content page | Yes |
| Page views in the past month | 0 |
| MaRDI portal item ID | None |
| Central description | scientific article; zbMATH DE number 4211537 |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | Import240129110113 (talk | contribs) |
| Date of page creation | 12:06, 30 January 2024 |
| Latest editor | AllProfilePages260409040437 (talk | contribs) |
| Date of latest edit | 22:16, 11 April 2026 |
| Total number of edits | 2 |
| Recent number of edits (within past 90 days) | 1 |
| Recent number of distinct authors | 1 |
| Transcluded templates (17) | Pages included on this page:
|
| MaRDI portal entities used in this page | - zbMATH Keywords
- Miscellaneous (e.g. entity existence)
- Label: en
- published in
- Miscellaneous (e.g. entity existence)
- Label: en
- full work available at URL
- Miscellaneous (e.g. entity existence)
- Label: en
- Mathematics Subject Classification ID
- Miscellaneous (e.g. entity existence)
- Label: en
- publication date
- Miscellaneous (e.g. entity existence)
- Label: en
- Routing, merging, and sorting on parallel models of computation
- Sorting in one round
- Parallel algorithms for partitioning sorted sets and related problems
- Combinatorica
- Noga Alon
- Parallel sorting
- Strategy-accurate parallel Buchberger algorithms
- Transforming comparison model lower bounds to the parallel-random-access-machine
- Q3028097
- Searching, Merging, and Sorting in Parallel Computation
- Q3201742
- Parallel complexity of sorting problems
- Q3717990
- Sorting and Selecting in Rounds
- Tight Comparison Bounds on the Complexity of Parallel Sorting
- Sorting, Approximate Sorting, and Searching in Rounds
- Finding an Approximate Maximum
- Finding the maximum, merging, and sorting in a parallel computation model
- Parallel Sorting with Constant Time for Comparisons
- Sorting and Merging in Rounds
- Q4057549
- Parallelism in Comparison Problems
- Q4246513
- Q4289288
- Q4313989
- The acyclic orientation game on random graphs
- A comparative analysis of the convergence regions for different parallel affine projection algorithms
- Yossi Azar
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
- Graphs whose every transitive orientation contains almost every relation
- Parallel comparison algorithms for approximation problems
- Title
- Miscellaneous (e.g. entity existence)
- Label: en
- Sitelink
- Some statements
- Finding an approximate median with high probability in constant parallel time
- Parallel selection
|