Compression using efficient multicasting
From MaRDI portal
Recommendations
- Compression using efficient multicasting
- A faster algorithm for sorting on mesh-connected computers with multiple broadcasting using fewer processors
- Communication-efficient matrix multiplication on hypercubes
- Communication efficient multi-processor FFT
- Lempel-Ziv data compression on parallel and distributed systems
Cites work
- A Construction for Partitions Which Avoid Long Arithmetic Progressions
- A decomposition theorem for partially ordered sets
- A Short Proof of van der Waerden's Theorem on Arithmetic Progressions
- Communication efficient multi-processor FFT
- scientific article; zbMATH DE number 4029619 (Why is no real title available?)
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1256741 (Why is no real title available?)
- scientific article; zbMATH DE number 1775430 (Why is no real title available?)
- Lower Bounds for Threshold and Symmetric Functions in Parallel Computation
- Modeling parallel bandwidth: Local versus global restrictions
- On Certain Sets of Integers
- On sets of integers containing k elements in arithmetic progression
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On the power of concurrent-write PRAMs with read-only memory
- Relations between Concurrent-Write Models of Parallel Computation
- Separating the power of EREW and CREW PRAMs with small communication width
- Trade-offs between communication throughput and parallel time
- Trade-Offs between Depth and Width in Parallel Computation
Cited in
(4)
This page was built for publication: Compression using efficient multicasting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952454)
