Pages that link to "Item:Q1175944"
From MaRDI portal
The following pages link to Improved deterministic parallel integer sorting (Q1175944):
Displaying 46 items.
- An optimal parallel algorithm for sorting multisets (Q293338) (← links)
- An efficient parallel algorithm for building the separating tree (Q666141) (← links)
- The Fork95 programming language: Design, implementation, application. (Q676263) (← links)
- Efficient low-contention parallel algorithms (Q676446) (← links)
- Improved parallel construction of wavelet trees and rank/select structures (Q776833) (← links)
- Sorting roughly sorted sequences in parallel (Q909454) (← links)
- Improved nonconservative sequential and parallel integer sorting (Q917274) (← links)
- Routing, merging, and sorting on parallel models of computation (Q1082818) (← links)
- A parallel bucket sort (Q1108803) (← links)
- ERCW PRAMs and optical communication (Q1128717) (← links)
- Sorting on PRAMs with reconfigurable buses (Q1198059) (← links)
- Parallel iterated bucket sort (Q1263965) (← links)
- Sorting in linear time? (Q1273863) (← links)
- Parallel construction and query of index data structures for pattern matching on square matrices (Q1288531) (← links)
- An efficient parallel algorithm for the single function coarsest partition problem (Q1329732) (← links)
- Parallel integer sorting using small operations (Q1346223) (← links)
- Improved parallel integer sorting without concurrent writing (Q1362905) (← links)
- Sorting strings and constructing digital search trees in parallel (Q1365679) (← links)
- The complexity of parallel prefix problems on small domains (Q1373137) (← links)
- Improved bounds for integer sorting in the EREW PRAM model (Q1392302) (← links)
- Faster deterministic sorting through better sampling. (Q1401197) (← links)
- Improved sorting-based procedure for integer programming (Q1611007) (← links)
- Parallel algorithms for separable permutations (Q1763485) (← links)
- A nearly optimal deterministic parallel Voronoi diagram algorithm (Q1817002) (← links)
- Improved fast integer sorting in linear space (Q1854461) (← links)
- \(O(\log \log n)\)-time integer geometry on the CRCW PRAM (Q1894712) (← links)
- Parallel integer sorting and simulation amongst CRCW models (Q1901715) (← links)
- An improved reliability bound of a probabilistic parallel integer sorting algorithm (Q1941705) (← links)
- Probabilistic integer sorting (Q2390249) (← links)
- Approximating Huffman codes in parallel (Q2466011) (← links)
- Fast parallel space allocation, estimation, and integer sorting (Q2508339) (← links)
- Improved fast integer sorting in linear space (Q2768383) (← links)
- OPTIMAL BUCKET SORTING AND OVERLAP REPRESENTATIONS (Q3130162) (← links)
- Deterministic coin tossing with applications to optimal parallel list ranking (Q3753489) (← links)
- On parallel hashing and integer sorting (Q3988822) (← links)
- Matching Nuts and Bolts in O(n log n) Time (Q4210209) (← links)
- Ultrafast Expected Time Parallel Algorithms (Q4377119) (← links)
- Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms (Q4729356) (← links)
- (Q4763434) (← links)
- Matching nuts and bolts in \(O(n\log n)\) time. (Extended abstract) (Q4875190) (← links)
- Fast and optimal simulations between CRCW PRAMs (Q5096768) (← links)
- Merging and sorting strings in parallel (Q5096841) (← links)
- Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees (Q5906512) (← links)
- Optimal parallel suffix tree construction (Q5906825) (← links)
- Conservative algorithms for parallel and sequential integer sorting (Q6085719) (← links)
- More efficient parallel flow algorithms (Q6487968) (← links)