The Parallel Simplicity of Compaction and Chaining
From MaRDI portal
Publication:4696646
Recommendations
- scientific article; zbMATH DE number 177853
- On the Chain Pair Simplification Problem
- Transitive compaction in parallel via branchings
- A theory of compaction-based parallelization
- On the general chain pair simplification problem
- scientific article; zbMATH DE number 7651116
- A short cut to parallelization theorems
- Simplicity of iterated Ore extensions
- Oblivious parallel tight compaction
Cited in
(18)- A work-time optimal algorithm for computing all string covers
- The complexity of parallel prefix problems on small domains
- Parallel two dimensional witness computation
- On the Chain Pair Simplification Problem
- MATRIX OPERATIONS USING ARRAYS WITH RECONFIGURABLE OPTICAL BUSES∗
- Transitive compaction in parallel via branchings
- Retrieval of scattered information by EREW, CREW, and CRCW PRAMs
- Prefix graphs and their applications
- FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH
- Shared memory simulations with triple-logarithmic delay
- Parallel algorithms for separable permutations
- Parallel vertex colouring of interval graphs
- The parallel complexity of integer prefix summation
- On a compaction theorem of Ragde
- Simulating shared memory in real time: On the computation power of reconfigurable architectures
- scientific article; zbMATH DE number 177853 (Why is no real title available?)
- Optimal parallel selection in sorted matrices
- Primitives for asynchronous list compression
This page was built for publication: The Parallel Simplicity of Compaction and Chaining
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4696646)
